Unification in a combination of arbitrary disjoint equational theories
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 378-396
- https://doi.org/10.1007/bfb0012845
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Unification in Abelian semigroupsJournal of Automated Reasoning, 1987
- Unification in combinations of collapse-free regular theoriesJournal of Symbolic Computation, 1987
- Complete sets of unifiers and matchers in equational theoriesTheoretical Computer Science, 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
- 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
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965