Rigid E-Unification Revisited
Authors:
- 1 January 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 220-234
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Abstract Congruence Closure and Specializations2000
- Congruence Closure Modulo Associativity and CommutativityLecture Notes in Computer Science, 2000
- Normalization via Rewrite ClosuresLecture Notes in Computer Science, 1999
- What You Always Wanted to Know about Rigid E-UnificationJournal of Automated Reasoning, 1998
- Term Rewriting and All That1998
- The undecidability of simultaneous rigid E-unificationTheoretical Computer Science, 1996
- A completion-based method for mixed universal and rigid E-unification1994
- Rigid unification by completion and rigid paramodulation1994
- 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