Rigid E-Unification and, Its Applications to Equational Matings
- 1 January 1989
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Termination of rewritingJournal of Symbolic Computation, 1987
- Linear logicTheoretical Computer Science, 1987
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- On Matrices with ConnectionsJournal of the ACM, 1981
- 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
- Tautology testing with a generalized matrix reduction methodTheoretical Computer Science, 1979
- Complexity of finitely presented algebrasPublished by Association for Computing Machinery (ACM) ,1977