Rigid E-unification: NP-completeness and applications to equational matings
Open Access
- 1 July 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 87 (1-2) , 129-195
- https://doi.org/10.1016/0890-5401(90)90061-l
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- Linear logicTheoretical Computer Science, 1987
- About the rewriting systems produced by the Knuth-Bendix completion algorithmInformation Processing Letters, 1983
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Positive First-Order Logic Is NP-CompleteIBM Journal of Research and Development, 1981
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Linear unificationJournal of Computer and System Sciences, 1978