14 Apr 2005
CS 3243 - Revision
30
Connection to knowledge-based agents
¡CSP can be formulated as logic problems and vice versa
¡CSP search as model checking
¡
¡
¡
¡
¡Local search: WalkSAT with min-conflict heuristic
CSP Search
Model checking (DPLL)
Minimum remaining values
Early Termination
Most constrained value
Unit Clause
Least constraining value
Pure Symbol