Anzeige
Erschienen in:
2001 | OriginalPaper | Buchkapitel
Constraint Satisfaction Problem
verfasst von : Makoto Yokoo
Erschienen in: Distributed Constraint Satisfaction
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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).