Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Equational inference, canonical proofs, and proof orderings;Leo;J. of the Association for Computing Machinery,1994
2. Leo Bachmair and Harald Ganzinger. Completion of first-order clauses with equality by strict superposition (Extended abstract). In M. Okada and S. Kaplan, editors, Proceedings of the Second International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada), volume 516 of Lecture Notes in Computer Science, pages 162–180, Berlin, June 1990. Springer-Verlag.
3. Resolution theorem proving;Leo,2001
4. Maria Paola Bonacina. Distributed automated deduction. PhD thesis, Department of Computer Science, State University of New York at Stony Brook, December 1992.
5. Towards a foundation of completion procedures as semidecision procedures;Bonacina;Theoretical Computer Science,1995