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. © 2005 by International Federation for Information Processing.
CITATION STYLE
Popescu, I. (2005). Using finite domains in constraint satisfaction problem. In IFIP Advances in Information and Communication Technology (Vol. 163, pp. 351–354). Springer New York LLC. https://doi.org/10.1007/0-387-23152-8_44
Mendeley helps you to discover research relevant for your work.