Unification in commutative theories
- 30 November 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (5) , 479-497
- https://doi.org/10.1016/s0747-7171(89)80055-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Unification in commutative idempotent monoidsTheoretical Computer Science, 1988
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Unification in datastructure multisetsJournal of Automated Reasoning, 1986
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 1986
- Abelian group unification algorithms for elementary termsContemporary Mathematics, 1984
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- An algorithm to generate the basis of solutions to homogeneous linear diophantine equationsInformation Processing Letters, 1978
- A Human Oriented Logic for Automatic Theorem-ProvingJournal of the ACM, 1974
- On well-quasi-ordering finite treesMathematical Proceedings of the Cambridge Philosophical Society, 1963