Unification in the combination of disjoint theories
We consider unifaction modulo some equational theory E: Given are terms s, t ε Τ (E) built from the signature ε(E) of E and from variables x in V. A substitution unifies s,t if σ(s) ≡E σ(t), i.e. σ(s), σ(t) are equivalent modulo theory E.
Unable to display preview. Download preview PDF.
- Peter Auer. Unification with associative functions. PhD thesis, Technical University Vienna, 1992.Google Scholar
- Franz Baader and Klaus Schulz. Unification in the union of disjoint equational theories: combining decision procedures. 1991. To be published in the proceedings of the IWWERT'91.Google Scholar
- Alexander Herold. Combination of unification algorithms. In Proceedings of the 8th Conference on Automated Deduction, pages 450–496, Springer LNCS 230, 1986.Google Scholar
- Claude Kirchner. A new unification method: a generalisation of Martelli-Montanari's algorithm. In Proceedings of the 7th International Conference on Automated Deduction, pages 224–247, Springer LNCS 170, May 1984.Google Scholar
- Manfred Schmidt-Schau\. Unification in a combination of arbitrary disjoint equational theories. In Claude Kirchner, editor, Unification, pages 217–265, Academic Press, 1990.Google Scholar
- Jörg H. Siekmann. Unification theory. In Claude Kirchner, editor, Unification, pages 1–68, Academic Press, 1990.Google Scholar
- Erik Tiden. Unification in combinations of collapse-free theories with disjoint sets of function symbols. In Proceedings of the 8th Conference on Automated Deduction, pages 431–449, Springer LNCS 230, 1986.Google Scholar
- Kathy Yelick. Combining unification algorithms for confined regular equational theories. In Proceedings of the 1st International Conference on Rewriting Techniques and Applications, pages 365–380, Springer LNCS 202, 1985.Google Scholar