Abstract
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence (AI). A typical example of a CSP is a puzzle called n-queens. The objective is to place n chess queens on a board with n x n squares so that these queens do not threaten each other (Fig. 1.1). A problem of this kind is called a constraint satisfaction problem because the objective is to find a configuration that satisfies the given conditions (constraints).
This is a preview of subscription content, log in via an institution to check access.
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
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yokoo, M. (2001). Constraint Satisfaction Problem. In: Distributed Constraint Satisfaction. Springer Series on Agent Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59546-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-59546-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64020-9
Online ISBN: 978-3-642-59546-2
eBook Packages: Springer Book Archive