Constraint Logic Programming over unions of Constraint theories

  • Cesare Tinelli
  • Mehdi Harandi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1118)


In this paper, we propose an extension of the Jaffar-Lassez Constraint Logic Programming scheme that operates with unions of constraint theories with different signatures and decides the satisfiability of mixed constraints by appropriately combining the constraint solvers of the component theories. We describe the extended scheme and provide logical and operational semantics for it along the lines of those given for the original scheme. Then we show how the main soundness and completeness results of Constraint Logic Programming lift to our extension.


Constraint Logic Programming combination of satisfiability procedures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Franz Baader and Klaus U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings of the 11th International Conference on Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 50–65. Springer-Verlag, 1992.Google Scholar
  2. 2.
    Franz Baader and Klaus U. Schulz. Combination of constraint solving techniques: An algebraic point of view. In Proceedings of the 6th International Conference on Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 50–65. Springer-Verlag, 1995.Google Scholar
  3. 3.
    Franz Baader and Klaus U. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, Cassis (France), September 1995.Google Scholar
  4. 4.
    Alexandre Boudet. Combining unification algorithms. Journal of Symbolic Computation, 16(6):597–626, December 1993.Google Scholar
  5. 5.
    E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for nondisjoint equational theories. In A. Bundy, editor, Proceedings 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 267–281. Springer-Verlag, 1994.Google Scholar
  6. 6.
    A. Herold. Combination of unification algorithms. In J. Siekmann, editor, Proceedings 8th International Conference on Automated Deduction, Oxford (UK), volume 230 of Lecture Notes in Artificial Intelligence, pages 450–469. Springer-Verlag, 1986.Google Scholar
  7. 7.
    Markus Höhfeld and Gert Smolka. Definite relations over constraint languages. Journal of Logic Programming, 1991.Google Scholar
  8. 8.
    Joxan Jaffar and Jean-Louis Lassez. Constraint Logic Programming. Technical Report 86/74, Monash University, Victoria, Australia, June 1986.Google Scholar
  9. 9.
    Joxan Jaffar and Michael Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19/20:503–581, 1994.Google Scholar
  10. 10.
    Hélène Kirchner and Christophe Ringeissen. A constraint solver in finite algebras and its combination with unification algorithms. In K. Apt, editor, Proc. Joint International Conference and Symposium on Logic Programming, pages 225–239. MIT Press, 1992.Google Scholar
  11. 11.
    Michael Maher. Logic semantics for a class of committed-choice programs. In Jean-Louis Lassez, editor, ICLP'87: Proceedings 4th International Conference on Logic Programming, pages 858–876, Melbourne, May 1987. MIT.Google Scholar
  12. 12.
    Greg Nelson. Combining satisfiability procedures by equality-sharing. Contemporary Mathematics, 29:201–211, 1984.Google Scholar
  13. 13.
    Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245–257, October 1979.Google Scholar
  14. 14.
    Manfred Schmidt-Schauß. Combination of unification algorithms. Journal of Symbolic Computation, 8(1-2):51–100, 1989.Google Scholar
  15. 15.
    Joseph. R. Shoenfield. Mathematical Logic. Addison-Wesley, Reading, MA, 1967.Google Scholar
  16. 16.
    Robert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31:1–12, 1984.Google Scholar
  17. 17.
    Cesare Tinelli. Extending the CLP scheme to unions of constraint theories. Master's thesis, Department of Computer Science, University of Illinois, Urbana-Champaign, Illinois, October 1995.Google Scholar
  18. 18.
    Cesare Tinelli and Mehdi Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In (to appear in) Proceedings of the 1st International Workshop “Frontiers of Combining Systems”, Munich (Germany), Applied Logic. Kluwer, 1996.Google Scholar
  19. 19.
    K. Yelik. 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 1996

Authors and Affiliations

  • Cesare Tinelli
    • 1
  • Mehdi Harandi
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations