References

For a complete list of references on Waldmeister see Th. Hillenbrands Homepage.

AL00
J. Avenhaus, B. Löchner, and Th. Hillenbrand (2000): On Using Ground Joinable Equations in Equational Theorem Proving, Baumgartner P., Zhang H., Proceedings of the 3rd International Workshop on First Order Theorem Proving (St Andrews, Scotland), Fachberichte Informatik 5/2000, pages 33-43. Universität Koblenz-Landau 2000.

BDP89
L. Bachmair, N. Dershowitz, D.A. Plaisted (1989): Completion Without Failure, Ait-Kaci H., Nivat M., Resolution of Equations in Algebraic Structures, pages 1-30, Academic Press.

BG+92
L. Bachmair, H. Ganzinger, C. Lynch, W. Snyder (1992): Basic Paramodulation and Superposition, Kapur D., Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, USA), pages 462-476, Lecture Notes in Artificial Intelligence 607, Springer-Verlag.

JLH99
A. Jaeger, B. Löchner, and Th. Hillenbrand (1999): Waldmeister - Improvements in Performance and Ease of Use, Ganzinger H., Proceedings of the 16th International Conference on Automated Deduction (Trento, Italy), pages 232-236, Lecture Notes in Artificial Intelligence 1632, Springer-Verlag.

LH02
B. Löchner, Th. Hillenbrand (2002): The Next Waldmeister Loop, Voronkov A., Proceedings of the 18th International Conference on Automated Deduction (Copenhagen, Denmark), pages 486-500, Lecture Notes in Artificial Intelligence 2392, Springer-Verlag.

NR92
R. Nieuwenhuis, J.M. Rivero (1992): Basic Superposition is Complete, Krieg-Brückner B., Proceedings of the 4th European Symposium on Programming (Rennes, France), pages 371-390, Lecture Notes in Computer Science 582, Springer-Verlag.