Using Finite Domains in Constraint Satisfaction Problem
Constraint satisfaction problem (CSP) methodologies are intended to solve (mostly combinatorial) problems especially in areas of planning and scheduling. Our paper focuses on a model enforcing arc consistency without changing the structure of the constraint network (CN), i.e., only by efficiently removing values from variable domains. The propagation of a variable domain to the constraints related to this variable allows the model to keep under control the size of the search space, by enumerating only the variable values which are part of a solution.
Key wordsConstraint satisfaction problem consistency search space
- 1.R. Bartak. On-line guide to Constraint Programming, Prague, 1998, http://kti.mff.cusni.ez/≈bartak/constraints/.Google Scholar
- 3.R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 276–284. John Wiley & Sons, 1992.Google Scholar
- 4.A.K. Mackworth. Constraint satisfaction. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 285–293. John Wiley & Sons, 1992.Google Scholar
- 6.P. Meseguer. Constraint satisfaction problems: An overview. AICOM, 2, pages 3–17, 1989.Google Scholar
- 8.E. Tsang. Foundations of Constraint Satisfaction. London, Academic Press, 1993.Google Scholar