The undecidability of simultaneous rigid E-unification
- 20 October 1996
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 166 (1-2) , 291-300
- https://doi.org/10.1016/0304-3975(96)00092-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Simultaneous rigid E-unification is undecidablePublished by Springer Nature ,1996
- 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
- First-order modal tableauxJournal of Automated Reasoning, 1988
- Linear logicTheoretical Computer Science, 1987
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- Positive First-Order Logic Is NP-CompleteIBM Journal of Research and Development, 1981
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Mechanical Theorem-Proving by Model EliminationJournal of the ACM, 1968