We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 30 April 2024
What is common between solving a sudoku or a crossword puzzle and placing eight queens on a chessboard so that none attacks another? They are all problems where each number or word or queen placed on the board is not independent of the others. Each constrains some others. Like a piece in a jigsaw puzzle that must conform to its neighbours. Interestingly, all these puzzles can be posed in a uniform formalism, constraints. The constraints must be respected by the solution – the constraints must be satisfied. And a unified representation admits general purpose solvers. This has given rise to an entire community engaged in constraint processing. Constraint processing goes beyond constraint satisfaction, with variations concerned with optimization. And it is applicable on a vast plethora of problems, some of which have been tackled by specialized algorithms like linear programming and integer programming.
In this chapter we confine ourselves to finite domain constraint satisfaction problems (CSPs) and study different approaches to solving them. We highlight the fact that CSP solvers can combine search and logical inferences in a flexible manner.
A constraint network R or a CSP is a triple,
R = <X, D, C>
where X is a set of variable names, D is a set of domains, one for each variable, and C is a set of constraints on some subsets of variables (Dechter, 2003). We will use the names X = ﹛x1, x2, …, xn﹜ where convenient with the corresponding domains D = ﹛D1, D2, …, Dn﹜. The domains can be different for each variable and each domain has values that the variable can take, Di = ﹛ai1, ai2, …, aik﹜. Let C = ﹛C1, C2, …, Cm﹜ be the constraints. Each constraint Ci has a scope Si R X and a relation Ri that is a subset of the cross product of the domains of the variables in Si. Based on the size of Si, we will refer to the constraints as unary, binary, ternary, and so on. A CSP is often depicted by a constraint graph and a matching diagram, as described in the examples to follow.
We will confine ourselves to finite domain CSPs, in which the domain of each variable is discrete and finite. We will also specify the relations in extensional form well suited for our algorithms.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.
