| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Abdelwaheb, Basin, Podelski
(Ed: Nielsen, Thomas)
[-] | 1998 | | LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34 | Proceedings Article |
Afshordel, Hillenbrand, Weidenbach
(Ed: Nieuwenhuis, Voronkov)
[Nieuwenhuis, Voronkov] | 2001 |  | First-Order Atom Definitions Extended
In: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-2001), 309-319 | Proceedings Article |
Ahrendt, Baumgartner, de Nivelle (ed.)
(Ed: Ahrendt, Baumgartner, de Nivelle)
[-] | 2006 | | IJCAR'06 Workshop : Disproving'06: Non-Theorems, Non-Validity, Non-Provability | Electronic Proceedings |
Althaus
[-] | 1998 | | Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Thesis - Masters thesis |
Anderson, Basin
[-] | 1995 | | Deriving and Applying Logic Program Transformers
In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), 301-318 | Proceedings Article |
Anderson, Basin
[Anderson] | 2000 | | Program Development Schemata as Derived Rules
In: Journal of Symbolic Computation [30], 5-36 | Journal Article |
Antoy, Echahed, Hanus
[Antoy, Echahed] | 1994 | | A Needed Narrowing Strategy
In: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 268-279 | Proceedings Article |
Areces, de Rijke, de Nivelle
[-] | 2001 | | Resolution in modal, description and hybrid logic
In: Journal of Logic and Computation [11], 717-736 | Journal Article |
Argon, Delzanno, Mukhopadhyay, Podelski
(Ed: Pacholski, Ruzicka)
[Argon, Delzanno] | 2001 | | Model Checking for Communication Protocols
In: Proceedings of the 28th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM-2001), 160-170 | Proceedings Article |
Autexier
[-] | 1996 | | Heuristiken zum Beweisen von Gleichungen
Universität des Saarlandes | Thesis - Masters thesis |
Avenhaus, Hillenbrand, Löchner
[Avenhaus, Löchner] | 2003 | | On Using Ground Joinable Equations in Equational Theorem Proving
In: Journal of Symbolic Computation [36], 217-233 | Journal Article |
Ayari
[-] | 1995 | | A Reinterpretation of the Deductive Tableaux System in Higher-Order Logic
Universität des Saarlandes | Thesis - Masters thesis |
Ayari, Basin
(Ed: Margaria, Steffen)
[-] | 1996 | | Generic System Support for Deductive Program Development
In: Second International Workshop, TACAS'96: Tools and Algorithms for the Construction and Analysis of Systems, 313-328 | Proceedings Article |
Ayari, Basin
(Ed: Paulson)
[-] | 1995 | | Interpretation of the Deductive Tableau in HOL
In: Proceedings of the First Isabelle Users Workshop, 91-100 | Proceedings Article |
Ayari, Basin
[Ayari] | 2001 | | A Higher-order Interpretation of Deductive Tableau
In: Journal of Symbolic Computation [31], 487-520 | Journal Article |
Baader, Ohlbach
[-] | 1995 | | A Multi-Dimensional Terminological Knowledge Representation Language
In: Journal of Applied Non-Classical Logics [5], 153-198 | Journal Article |
Bach
[-] | 1996 | | Static analysis of functional programs via Linear Logic
Universität des Saarlandes | Thesis - Masters thesis |
Bachmair, Ganzinger
(Ed: Bibel, Schmitt)
[-] | 1998 | | Equational Reasoning in Saturation-Based Theorem Proving
In: Automated Deduction: A Basis for Applications, 353-397 | Part of a Book |
Bachmair, Ganzinger
(Ed: Bundy)
[-] | 1994 | | Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450 | Proceedings Article |
Bachmair, Ganzinger
(Ed: Dershowitz, Lindenstrauss)
[-] | 1995 | | Associative-Commutative Superposition
In: Proceedings of the 4th International Workshop on Conditional and Typed Rewrite Systems (CTRS-94), 1-14 | Proceedings Article |
Bachmair, Ganzinger
(Ed: Jouannaud)
[-] | 1994 | | Buchberger's algorithm: a constraint-based completion procedure
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 285-301 | Proceedings Article |
Bachmair, Ganzinger
(Ed: Kaplan, Okada)
[-] | 1991 | | Completion of first-order clauses with equality by strict superposition
In: Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting, 162-180 | Proceedings Article |
Bachmair, Ganzinger
(Ed: Kirchner, Kirchner)
[-] | 1998 | | Strict Basic Superposition
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 160-174 | Proceedings Article |
Bachmair, Ganzinger
(Ed: Robinson, Voronkov)
[Robinson, Voronkov] | 2001 | | Resolution Theorem Proving
In: Handbook of Automated Reasoning, 19-99 | Part of a Book |
Bachmair, Ganzinger
(Ed: Voronkov)
[-] | 1992 | | Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284 | Proceedings Article |
Bachmair, Ganzinger
[-] | 1994 | | Rewrite-based equational theorem proving with selection and simplification
In: Journal of Logic and Computation [4], 217-247 | Journal Article |
Bachmair, Ganzinger
[-] | 1994 | | Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393 | Proceedings Article |
Bachmair, Ganzinger
[-] | 1991 | | Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659 | Proceedings Article |
Bachmair, Ganzinger
[Bachmair] | 1998 | | Ordered Chaining Calculi for First-Order Theories of Transitive Relations
In: Journal of the ACM [45], 1007-1049 | Journal Article |
Bachmair, Ganzinger, Lynch, Snyder
(Ed: Kapur)
[-] | 1992 | | Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476 | Proceedings Article |
