Rigid unification by completion and rigid paramodulation
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 319-330
- https://doi.org/10.1007/3-540-58467-6_28
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An improved general E-unification methodJournal of Symbolic Computation, 1992
- Programming with equalities, subsorts, overloading, and parametrization in OBJThe Journal of Logic Programming, 1992
- Rigid E-unification: NP-completeness and applications to equational matingsInformation and Computation, 1990
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- A simple non-termination test for the Knuth-Bendix methodPublished by Springer Nature ,1986
- Natural and formal logicPublished by Springer Nature ,1982
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Mechanical Theorem-Proving by Model EliminationJournal of the ACM, 1968