This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Franz Baader and Klaus Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings 11th International Conference on Automated Deduction, Saratoga Springs (N.Y., USA), pages 50–65, 1992.
Franz Baader and Klaus U. Schulz. Combination techniques and decision problems for disunification. In Claude Kirchner, editor. Rewriting Techniques and Applications, 5th International Conference, RTA-93, LNCS 690, pages 301–315, Montreal, Canada, June 16–18, 1993. Springer-Verlag.
A. Boudet. Unification dans les mélanges de théories équationelles. Thèse de Doctorat d'Université, Université de Paris-Sud, Orsay (France), February 1990.
D. Dougherty and P. Johann. An improved general E-unification method. In M. E. Stickel, editor, Proceedings 10th International Conference on Automated Deduction, Kaiserslautern (Germany), volume 449 of Lecture Notes in Computer Science, pages 261–275. Springer-Verlag, July 1990.
J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science, 67(2–3):203–260, October 1989.
Claude Kirchner. Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles. Thèse de Doctorat d'Etat, Université de Nancy I, 1985.
M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103(2):273–282, 1992.
T. Nipkow. Combining matching algorithms: The regular case. In N. Dershowitz, editor, Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill (N.C., USA), volume 355 of Lecture Notes in Computer Science, pages 343–358. Springer-Verlag, April 1989.
E. Post. Recursive unsolvability of a problem of thue. The Journal of Symbolic Logic, 12:1–11, 1947.
Ch. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In Proceedings of the 1st International Conference on Logic Programming and Automated Reasoning, St. Petersburg (Russia), volume 624 of Lecture Notes in Artificial Intelligence, pages 261–272. Springer-Verlag, 1992.
Ch. Ringeissen. Combinaison de Résolutions de Contraintes. Thèse de Doctorat d'Université, Université de Nancy I, December 1993.
Ch. Ringeissen. Combination of matching algorithms. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, Proceedings 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen (France), volume 775 of Lecture Notes in Computer Science, pages 187–198. Springer-Verlag, February 1994.
M. Schmidt-Schau\. Combination of unification algorithms. Journal of Symbolic Computation, 8(1 & 2):51–100, 1989. Special issue on unification. Part two.
K. Yelick. Unification in combinations of collapse-free regular theories. Journal of Symbolic Computation, 3(1 & 2):153–182, April 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domenjoud, E., Klay, F., Ringeissen, C. (1994). Combination techniques for non-disjoint equational theories. In: Bundy, A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science, vol 814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58156-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-58156-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58156-7
Online ISBN: 978-3-540-48467-7
eBook Packages: Springer Book Archive