A completion-based method for mixed universal and rigid E-unification
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 678-692
- https://doi.org/10.1007/3-540-58156-1_49
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Theorem proving using equational matings and rigid E -unificationJournal of the ACM, 1992
- Rigid E-unification: NP-completeness and applications to equational matingsInformation and Computation, 1990
- Unification theoryJournal of Symbolic Computation, 1989
- Basic narrowing revisitedJournal of Symbolic Computation, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987