Unification in a combination of arbitrary disjoint equational theories
Open Access
- 8 July 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (1-2) , 51-99
- https://doi.org/10.1016/s0747-7171(89)80022-7
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Matching — A special case of unification?Journal of Symbolic Computation, 1989
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- The theory of idempotent semigroups is of unification type zeroJournal of Automated Reasoning, 1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- The decision problem for equational bases of algebrasAnnals of Mathematical Logic, 1976
- Untersuchungen ber das logische Schlie en. IMathematische Zeitschrift, 1935