Theorem-proving with resolution and superposition
- 28 February 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 11 (1-2) , 21-49
- https://doi.org/10.1016/s0747-7171(08)80131-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On word problems in horn theoriesJournal of Symbolic Computation, 1991
- Termination of rewritingJournal of Symbolic Computation, 1987
- A superposition oriented theorem proverTheoretical Computer Science, 1985
- TerminationPublished 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
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965