Skip to main content
SpringerLink
Log in

Solving Mixed and Conditional Constraint Satisfaction Problems

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

Constraints are a powerful general paradigm for representing knowledge in intelligent systems. The standard constraint satisfaction paradigm involves variables over a discrete value domain and constraints which restrict the solutions to allowed value combinations. This standard paradigm is inapplicable to problems which are either:

(a) mixed, involving both numeric and discrete variables, or

(b) conditional,1 containing variables whose existence depends on the values chosen for other variables, or

(c) both, conditional and mixed.

We present a general formalism which handles both exceptions in an integral search framework. We solve conditional problems by analyzing dependencies between constraints that enable us to directly compute all possible configurations of the CSP rather than discovering them during search. For mixed problems, we present an enumeration scheme that integrates numeric variables with discrete ones in a single search process. Both techniques take advantage of enhanced propagation rule for numeric variables that results in tighter labelings than the algorithms commonly used. From real world examples in configuration and design, we identify several types of mixed constraints, i.e. constraints defined over numeric and discrete variables, and propose new propagation rules in order to take advantage of these constraints during problem solving.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benhamou, F. (1996). Heterogeneous constraint solving. In Hanus, M., & Rodríguez-Artalejo, M., ed., Algebraic and Logic Programming, 5th International Conference, ALP'96, Vol. 1139 of lncs, pages 62–76, Aachen, Germany: Springer.

    Google Scholar 

  2. Benhamou, F., McAllester, D., & Van Hentenryck, P. CLP (intervals) revisited. (1994). In Bruynooghe, M., ed., Logic Programming-Proceedings of the 1994 International Symposium, pages 124–138, The MIT Press.

  3. Benhamou, F., & Touraivane (1995). Prolog IV: Langage et Algorithmes. In Quatrièmes Journées Francophones de Programmation en Logique, JFPL'95, pages 51–65.

  4. Bessière, C. (1994). Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1): 179–190.

    Google Scholar 

  5. Bessière, C., & Régin, J.-C. (1993). Arc consistency for general constraint networds: preliminary results. In International Joint Conference on Artificial Intelligence, IJCAI-93, pages 398–404.

  6. Bessière, C., & Régin, J.-C. (1996). Mac and combined heuristics: two reasons to forsake fc (and cbj). In Fréuder, E. C., & Jampel, M., eds., Principles and Practice of Constraint Programming, Volume 1118, of Lecture Notes in Computer Science. Springer.

  7. Bowen, J., & Bahler, D. (1991). Conditional existence of variables in generalized constraint networks. In Proceedings of the Ninth National Conference on Artificial Intelligence, pages 215–220.

  8. Chiu, C. K., & Lee, J. H. M. (1994). Interval linear constraint solving using the preconditioned interval gauss-seidel method. In Yap, R. H. C., ed., Proceedings ILPS'94 Workshop on Constraint Languages/Systems and Their Use in Problem Modelling, Volume 2, Ithaca, Technical Report 94/19, Department of Computer Science, University of Melbourne.

  9. Chiu, C. K., & Lee, J. H. M. (1994). Towards practical interval constraint solving in logic programming. In Bruynooghe, M., ed., Logic Programming-Proceedings of the 1994 International Symposium, pages 109–123. The MIT Press.

  10. Collavizza, H., Delobel, F., & Rueher, M. (1998). A note on partial consistencies over continuous domains. In Principles and Practice of Constraint Programming, CP98, Springer LNCS 1713, pp. 147–161.

  11. Colmerauer, A. An introduction to PrologIII. (1990). Communications of the ACM, 33(7): 69–90.

  12. Davis, E. (1987). Constraint propagation with interval labels. In Artificial Intelligence 32: 281–332.

    Google Scholar 

  13. Dechter, R., Meiri, I., & Pearl, J. (1989). Temporal constraint networks. In Levesque, H. J., Brachman, R. J., & Reiter, R., eds., Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 83–93, Toronto, Canada, Morgan Kaufmann.

    Google Scholar 

  14. Faltings, B. (1994). Arc consistency for continuous variables. In Artificial Intelligence 65(2), pages 85–118.

    Google Scholar 

  15. Faltings, B., & Gelle, E. (1997). Local consistency for ternary numeric constraints. In Proc. 11th Int. Joint Conf. on Artificial Intelligence, IJCAI-97, pages 392–397.

  16. Frost, D., & Dechter, R. (1995). Look-ahead value ordering for constraint satisfaction problems. In Mellish, C. S., ed., Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 572–578, Morgan Kaufmann.

  17. Gelle, E. (1998). On the generation of locally consistent solution spaces in mixed dynamic constraint problems. Ph.D. thesis, Swiss Federal Institute of Technology, EPFL.

  18. Gelle, E., Faltings, B., Clément, D., & Smith, I. (2000). Constraint satisfaction methods for applications in engineering. Engineering With Computers, 16(2): 81–95.

    Google Scholar 

  19. Gondran, M., & Minoux, M. (1986). Graphs and Algorithms. John Wiley & Sons, Chichester, 1st edition.

    Google Scholar 

  20. Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263–313.

    Google Scholar 

  21. Heintze, N. C., Michaylov, S., & Stuckey, P. J. (1987). CLP(ℛ) and some electrical engineering problems. In Lassez, J.-L., ed., Proceedings of the Fourth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 675–703. The MIT Press.

  22. Van Hentenryck, P. (1989). Constraint satisfaction in logic programming. In Logic Programming Series. MIT Press.

  23. Hyvönen, E. (1992). Constraint reasoning based on interval arithmetic: the tolerance propagation approach. In Artificial Intelligence, 58: 71–112.

    Google Scholar 

  24. Jussien, N., & Lhomme, O. (1998). Dynamic domain splitting for numeric csps. In ECAI-98, pp. 224–228.

  25. Lhomme, O. (1993). Consistency techniques for numeric CSPs. In International Joint Conference on Artificial Intelligence, IJCAI-93, pages 232–238.

  26. Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8: 99–118.

    Google Scholar 

  27. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Dietterich, W., & Swartout, T., eds., Proceedings of the 8th National Conference on Artificial Intelligence, pages 25–32, MIT Press.

  28. Montanari, U. (1974). Networks of constraints: fundamental properties and applications to picture processing. Inform. Sci., 7: 95–132.

    Google Scholar 

  29. Moore, R. E. (1979). Methods and Applications of Interval Analysis. Philadelphia, PA: Society for Industrial and Applied Mathematics.

    Google Scholar 

  30. Rueher, M. (1994). An architecture for cooperating constraint solvers on reals. In Podelski, A., ed., Constraint Programming: Basics and Trends, LNCS 910, Springer.

  31. Sabin, D., & Freuder, E. (1994). Contradicting conventional wisdom in constraint satisfaction. In Borning, A., ed., Principles and Practice of Constraint Programming, Volume 874 of Lecture Notes in Computer Science, Springer.

  32. Sabin, D., & Freuder, E. C. (1996). Configuration as composite constraint satisfaction. In Configuration-Papers from the 1996 Fall Symposium. AAAI Technical Report FS-96-03.

  33. Sabin, M., & Freuder, E. (1999). Detecting and resolving inconsistency in conditional constraint satisfaction problems. In Proceedings of the AAAI'99 Workshop on Configuration, pages 95–100.

  34. Sam-Haroud, D. (1995). Constraint consistency techniques for continuous domains. Ph.D. thesis, Swiss Federal Institute of Technology, EPFL.

  35. Sam-Haroud, D., & Faltings, B. (1996). Consistency techniques for continuous constraints. Constraints, 1: 85–118.

    Google Scholar 

  36. Soininen, T., Gelle, E., & Niemelä, I. (1999). A fixpoint definition for dynamic constraint satisfaction. Principles and Practice of Constraint Programming, CP'99, Springer LNCS 1713, pp. 419–433.

  37. Tinelli, C., & Harandi, M. (1996). Constraint logic programming over unions of constraint theories. Lecture Notes in Computer Science, 1118: 436–450.

    Google Scholar 

  38. Tsang, E. (1998). No more partial and full looking ahead. Artificial Intelligence, 98(1-2): 351–361.

    Google Scholar 

  39. Van Hentenryck, P. (1997). Numerica: a modeling language for global optimization. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI '97), pages 1642–1647, Nagoya.

  40. Van Hentenryck, P., Deville, Y., & Teng, C.-M. (1992). A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57(2-3): 291–321.

    Google Scholar 

  41. Van Hentenryck, P., McAllester, D., & Kapur, D. (1997). Solving polynomial systems using a branch and prune approach. SIAM Journal of Numerical Analysis, 34(2): 797–827. Also available as Brown University technical report CS-95-01.

    Google Scholar 

  42. Van Hentenryck, P., Michel, L., & Deville, Y. (1997). Numerica. A Modeling Language for Global Optimization. MIT Press.

  43. van Velzen, M. (1993). A Piece of CAKE, Computer Aided Knowledge Engineering on KADSified Con-figuration Tasks. Master's thesis, Univeristy of Amsterdam, Social Science Informatics.

  44. Waltz, D. L. (1975). Understanding line drawings of scenes with shadows. In Winston, P. H., ed., The Psychology of Computer Vision, pages 19–91. McGraw-Hill.

Download references

Author information

Authors and Affiliations

  1. Information Technologies Department, ABB Corporate Research Ltd., CH-5405, Baden-Daettwil, Switzerland

    Esther Gelle

  2. Artificial Intelligence Laboratory (LIA), Swiss Federal Institute of Technology (EPFL), CH-1015, Lausanne, Switzerland

    Boi Faltings

Authors
  1. Esther Gelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boi Faltings
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gelle, E., Faltings, B. Solving Mixed and Conditional Constraint Satisfaction Problems. Constraints 8, 107–141 (2003). https://doi.org/10.1023/A:1022394531132

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022394531132

Search

Navigation