Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this chapter
Cite this chapter
Miguel, I. (2004). The Constraint Satisfaction Problem. In: Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-0-85729-378-7_2
Download citation
DOI: https://doi.org/10.1007/978-0-85729-378-7_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1048-4
Online ISBN: 978-0-85729-378-7
eBook Packages: Springer Book Archive