Unification in a combination of equational theories: an efficient algorithm
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 292-307
- https://doi.org/10.1007/3-540-52885-7_95
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Rewrite SystemsPublished by Elsevier ,1990
- Matching — A special case of unification?Journal of Symbolic Computation, 1989
- Unification in Boolean Rings and Abelian GroupsJournal of Symbolic Computation, 1989
- On word problems in equational theoriesPublished by Springer Nature ,1987
- Unification in boolean ringsPublished by Springer Nature ,1986
- Abelian group unification algorithms for elementary termsContemporary Mathematics, 1984
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965