max planck institut
informatik

# MPI-INF RG1 Publications, generated: 7:01, 23 October 2019

Search the publication database

. Return

Your search returned the following 5 documents:

1. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
Refutational Theorem Proving for Hierarchic First-Order Theories
Applicable Algebra in Engineering, Communication and Computing (AAECC) 5 (3/4): 193-212, 1994. Note: Earlier Version: Theorem Proving for Hierarchic First-Order Theories, in Giorgio Levi and H{\'e}l{\`e}ne Kirchner, editors, {\em Algebraic and Logic Programming, Third International Conference}, LNCS 632, pages 420--434, Volterra, Italy, September 2--4, 1992, Springer-Verlag
2. Leo Bachmair and Harald Ganzinger
Rewrite-based equational theorem proving with selection and simplification
Journal of Logic and Computation 4 (3): 217-247, 1994. Note: Revised version of Technical Report MPI-I-91-208, 1991
3. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 1992, 420-434. Note: Revised version in AAECC, vol.\ 5, number 3/4, pp.\ 193--212, 1994)
4. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, June 19-23, 1993, 1993, 75-83
5. Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
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, Brno, Czech Republic, August 24-27, 1993, 1993, 83-96. Note: Revised version of Technical Report MPI-I-93-204