| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
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 |
Bachmair, Ganzinger, Lynch, Snyder
[Lynch, Snyder] | 1995 | | Basic Paramodulation
In: Information and Computation [121], 172-192 | Journal Article |
Bachmair, Ganzinger, Stuber
(Ed: Astesiano, Reggio, Tarlecki)
[-] | 1995 | | Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings
In: Recent Trends in Data Type Specification. 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop, 1-29 | Proceedings Article |
Bachmair, Ganzinger, Voronkov
(Ed: Kirchner, Kirchner)
[-] | 1998 | | Elimination of Equality via Transformation with Ordering Constraints
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 175-190 | Proceedings Article |
Bachmair, Ganzinger, Waldmann
(Ed: Gottlob, Leitsch, Mundici)
[Bachmair, Gottlob, Leitsch, Mundici] | 1993 | | Superposition with simplification as a decision procedure for the monadic class with equality
In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96 | Proceedings Article |
Bachmair, Ganzinger, Waldmann
(Ed: Kirchner, Levi)
[-] | 1992 | | Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434 | Proceedings Article |
Bachmair, Ganzinger, Waldmann
[-] | 1994 | | Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212 | Journal Article |
Bachmair, Ganzinger, Waldmann
[Bachmair] | 1993 | | Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83 | Proceedings Article |
Backes
[-] | 2005 | | Programmanalyse des XRTL Zwischencodes
Universität des Saarlandes | Thesis - PhD thesis |
Backes, Wetzel
(Ed: Bosma)
[Wetzel] | 2000 | | New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152 | Proceedings Article |
Backes, Wetzel
(Ed: Näher, Wagner)
[Wetzel] | 2001 | | Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73 | Proceedings Article |
Ball, Podelski, Rajamani
(Ed: Margaria, Yi)
[Ball, Rajamani] | 2001 | | Boolean and Cartesian Abstraction for Model Checking C Programs
In: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-2001), 268-283 | Proceedings Article |
Barnett, Basin, Hesketh
[-] | 1993 | | A Recursion Planning Analysis of Inductive Completion
In: Annals of Mathematics and Artificial Intelligence [8], 363-381 | Journal Article |
Barth
(Ed: Benhamou, Colmerauer, Smolka)
[-] | 1993 | | A Complete Symbolic 0-1 Constraint Solver
In: 3rd Workshop on Constraint Logic Programming (WCLP '93), ? | Proceedings Article |
Barth
(Ed: Jouannaud)
[-] | 1994 | | Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33 | Proceedings Article |
Barth
(Ed: Voronkov)
[-] | 1993 | | Linear 0-1 Inequalities and Extended Clauses
In: Proceedings~4th International~Conference on Logic Programming and Automated Reasoning LPAR '93, 40-51 | Proceedings Article |
