_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.

Which of the Following problems can be modeled as CSP?

What among the following constitutes to the incremental formulation of CSP?

The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure.

Consider a problem of preparing a schedule for a class of student. What type of problem is this?

Constraint satisfaction problems on finite domains are typically solved using a form of ___________

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.

____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.

Flexible CSPs relax on _______

Language/Languages used for programming Constraint Programming includes ____________

Backtracking is based on ____________

Constraint Propagation technique actually modifies the CSP problem.

When do we call the states are safely explored?

Which of the following algorithm is generally used CSP search algorithm?