| # |  | Author/Editor | Year | | Title | |
|---|
| 4 |
 | Book |
| |
| 42 |
| |
| 9 |
| Proceedings |
| |
| 1 |
| |
| 429 |
 | Proceedings Article |
| |
| | Abdelwaheb, Ayari
Basin, David A.
Podelski, Andreas | 1998 | | LISA: A Specification Language Based on WS2S
In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), 18-34 | |
| | Afshordel, Bijan
Hillenbrand, Thomas
Weidenbach, Christoph | 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 | |
| | Anderson, Penny
Basin, David A. | 1995 | | Deriving and Applying Logic Program Transformers
In: Algorithms, Concurrency and Knowledge (1995 Asian Computing Science Conference), 301-318 | |
| | Antoy, Sergio
Echahed, Rachid
Hanus, Michael | 1994 | | A Needed Narrowing Strategy
In: Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 268-279 | |
| | Argon, Pablo
Delzanno, Giorgio
Mukhopadhyay, Supratik
Podelski, Andreas | 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 | |
| | Ayari, Abdelwaheb
Basin, David A. | 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 | |
| | Ayari, Abdelwaheb
Basin, David A. | 1995 | | Interpretation of the Deductive Tableau in HOL
In: Proceedings of the First Isabelle Users Workshop, 91-100 | |
| | Bachmair, Leo
Ganzinger, Harald | 1998 | | Strict Basic Superposition
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 160-174 | |
| | Bachmair, Leo
Ganzinger, Harald | 1995 | | Associative-Commutative Superposition
In: Proceedings of the 4th International Workshop on Conditional and Typed Rewrite Systems (CTRS-94), 1-14 | |
| | Bachmair, Leo
Ganzinger, Harald | 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 | |
| | Bachmair, Leo
Ganzinger, Harald | 1994 | | Ordered Chaining for Total Orderings
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 435-450 | |
| | Bachmair, Leo
Ganzinger, Harald | 1994 | | Rewrite Techniques for Transitive Relations
In: Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 384-393 | |
| | Bachmair, Leo
Ganzinger, Harald | 1992 | | Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria
In: Logic Programming and Automated Reasoning, 273-284 | |
| | Bachmair, Leo
Ganzinger, Harald | 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 | |
| | Bachmair, Leo
Ganzinger, Harald | 1991 | | Perfect model semantics for logic programs with equality
In: Proceedings International Conference on Logic Programming '91, 645-659 | |
| | Bachmair, Leo
Ganzinger, Harald
Lynch, Christopher
Snyder, Wayne | 1992 | | Basic Paramodulation and Superposition
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 462-476 | |
| | Bachmair, Leo
Ganzinger, Harald
Stuber, Jürgen | 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 | |
| | Bachmair, Leo
Ganzinger, Harald
Voronkov, Andrei | 1998 | | Elimination of Equality via Transformation with Ordering Constraints
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 175-190 | |
| | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | 1993 | | Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83 | |
| | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | 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 | |
| | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | 1992 | | Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434 | |
| | Backes, Werner
Wetzel, Susanne | 2001 | | Lattice Basis Reduction with Dynamic Approximation
In: Proceedings of the 4th Workshop On Algorithm Engineering (WAE-2000), 63-73 | |
| | Backes, Werner
Wetzel, Susanne | 2000 | | New Results on Lattice Basis Reduction in Practice
In: Proceedings of the 4th International Algorithmic Number Theory Symposium (ANTS-IV), 135-152 | |
| | Ball, Thomas
Podelski, Andreas
Rajamani, Sriram K. | 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 | |
| | Barth, Peter | 1994 | | Simplifying Clausal Satisfiability Problems
In: Proceedings of the 1st International Conference on Constraints in Computational Logics (CCL'94), 19-33 | |
