Advertisement

Combination techniques for non-disjoint equational theories

  • Eric Domenjoud
  • Francis Klay
  • Christophe Ringeissen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 814)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. Theoretical Computer Science, 67(2–3):203–260, October 1989.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    M. Kurihara and A. Ohuchi. Modularity of simple termination of term rewriting systems with shared constructors. Theoretical Computer Science, 103(2):273–282, 1992.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    E. Post. Recursive unsolvability of a problem of thue. The Journal of Symbolic Logic, 12:1–11, 1947.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Ch. Ringeissen. Combinaison de Résolutions de Contraintes. Thèse de Doctorat d'Université, Université de Nancy I, December 1993.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    M. Schmidt-Schau\. Combination of unification algorithms. Journal of Symbolic Computation, 8(1 & 2):51–100, 1989. Special issue on unification. Part two.Google Scholar
  14. 14.
    K. Yelick. Unification in combinations of collapse-free regular theories. Journal of Symbolic Computation, 3(1 & 2):153–182, April 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Eric Domenjoud
    • 1
  • Francis Klay
    • 1
  • Christophe Ringeissen
    • 1
  1. 1.CRIN-CNRS & INRIA-LorraineVandœuvre-lès-Nancy CedexFrance

Personalised recommendations