A new method for establishing refutational completeness in theorem proving
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 141-152
- https://doi.org/10.1007/3-540-16780-3_86
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Two results in term rewriting theorem provingPublished by Springer Nature ,1985
- A Technique for Establishing Completeness Results in Theorem Proving with EqualitySIAM Journal on Computing, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Proving Theorems with the Modification MethodSIAM Journal on Computing, 1975
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- Paramodulation and set of supportPublished by Springer Nature ,1970
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965