Global consistency for continuous constraints

  • D. Haroud
  • B. Faltings
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 874)


This paper provides a technique for solving general constraint satisfaction problems (CSPs) with continuous variables. Constraints are represented by a hierarchical binary decomposition of the space of feasible values. We propose algorithms for path- and higher degrees of consistency based on logical operations defined on this representation and demonstrate that the algorithms terminate in polynomial time. We show that, in analogy to convex temporal problems and discrete row-convex problems, convexity properties of the solution spaces can be exploited to compute minimal and decomposable networks using path consistency algorithms. Based on these properties, we also show that a certain class of non binary CSPs can be solved using strong 5-consistency.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Davis E.: “Constraint propagation with interval labels”, Artificial Intelligence 32 (1987)Google Scholar
  2. 2.
    Dechter R., Meiri I., Pearl J.: “Temporal constraint networks”, Artificial Intelligence 49(1–3) (1990)Google Scholar
  3. 3.
    Dechter R.: “From local to global consistency”, Proceedings of the 8th Canadian Conference on AI (1990)Google Scholar
  4. 4.
    Deville Y., Van Hetenryck P.: “An efficient arc consistency algorithm for a class of CSP problems”, Proceedings of the 12th International Joint Conference on AI (1991)Google Scholar
  5. 5.
    Faltings B.: “Arc consistency for continuous variables”, Artificial Intelligence 65 (2) (1994)Google Scholar
  6. 6.
    Freuder E.C.: “Synthesizing constraint expressions”, Comm. ACM 21 (1978)Google Scholar
  7. 7.
    Freuder E.C.: “A sufficient condition for backtrack-free search”, J ACM 29 (1982)Google Scholar
  8. 8.
    Freuder E.C.: “A sufficient condition for backtrack-bounded search”, J. ACM 32 (1985)Google Scholar
  9. 9.
    Hyvönen E.: “Constraint reasoning based on interval arithmetic: the tolerance propagation approach”, Artificial Intelligence 58(1–3) (1992)Google Scholar
  10. 10.
    Lhomme O.: “Consistency techniques for numeric CSPs”, Proceedings of the 13th International Joint Conference on AI (1993)Google Scholar
  11. 11.
    Mackworth A.: “Consistency in networks of relations”, Artificial Intelligence 8 (1977)Google Scholar
  12. 12.
    Montanari U.: “Networks of constraints: fundamental properties and applications to picture processing”, Inform. Scie. 7 (1974)Google Scholar
  13. 13.
    Tanimoto T.: “A constraint decomposition method for spatio-temporal configurations problems”, Proceedings of the the 11th National Conference on AI (1993)Google Scholar
  14. 14.
    Van Beek P.: “Approximation algorithms for temporal reasoning”, Proceedings of the 11th International Joint Conference on AI (1989)Google Scholar
  15. 15.
    Van Beek P.: “On the minimality and decomposability of constraint networks”, Proceedings of the 10th National Conference on AI (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • D. Haroud
    • 1
  • B. Faltings
    • 1
  1. 1.Swiss Federal Institute of TechnologyLausanneSwitzerland

Personalised recommendations