Reading: AIAMA 6.1-6.2
This section is an example of how a richer representation of the problem can lead to improvements in agents, specifically agents whose models use a factored representation. A class of problems that can be solved efficiently in this fashion are the Constraint Satisfaction Problems or CSPs. Section 6.1 defined formally what a CSP is and provides some examples. Section 6.2 defines our first set of inference algorithms, those that operate on CSPs, i.e. arc, node, and path consistency.
Questions you should be able to answer after reading are: