The Constraint Satisfaction Problem
This chapter presents a formal description of the classical constraint satisfaction problem, the methods used to represent and reason with such problems, and the solution techniques used to solve them. Appendix A contains more detailed pseudo-code descriptions of some of these fundamental approaches for completeness. The reader is directed to these descriptions as appropriate.
KeywordsTree Search Constraint Satisfaction Problem Constraint Graph Partial Assignment Domain Element
Unable to display preview. Download preview PDF.