Three Constraint satisfaction problems

(25th-April-2020)

• There are three constraint satisfaction problem (CSP) were consisted as following.

1. a set of variables,

2. a domain for each variable, and

3. a set of constraints.

• The aim is to choose a value for each variable so that the resulting possible world satisfies the constraints; we want a model of the constraints.

• A finite CSP has a finite set of variables and a finite domain for each variable. Many of the methods considered in this chapter only work for finite CSPs, although some are designed for infinite, even continuous, domains.

• The multidimensional aspect of these problems, where each variable can be seen as a separate dimension, makes them difficult to solve but also provides structure that can be exploited.