Foundations of CSP
Khaled Ghédira, Bernard Dubuisson · 2013
Various real-life problems, considered as problems within artificial intelligence (AI) and operational research (OR), are solved via the constraint satisfaction problem (CSP) formalism that provides a tool for modeling and handling knowledge, and is simple, general, expressive and efficient in the sense that it is able to represent multiple and various types of knowledge. The chapter begins by refining the definition of these CSPs as well as the associated basic notions. Then, it presents the application areas of CSPs illustrated with examples prior to exposing the variants and extensions of the CSP formalism.