Constraint satisfaction problems
GPTKB entity
Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
resource allocation
puzzle solving vehicle routing timetabling |
| gptkbp:complexity |
NP-complete
|
| gptkbp:component |
variables
domains constraints |
| gptkbp:defines |
A problem composed of variables, domains, and constraints that must be satisfied.
|
| gptkbp:example |
gptkb:Sudoku
Scheduling Map coloring N-queens problem |
| gptkbp:field |
gptkb:artificial_intelligence
computer science operations research |
| gptkbp:generalizes |
Boolean satisfiability problem
|
| gptkbp:hasType |
distributed CSP
dynamic CSP soft CSP weighted CSP binary CSP non-binary CSP over-constrained CSP valued CSP |
| https://www.w3.org/2000/01/rdf-schema#label |
Constraint satisfaction problems
|
| gptkbp:notableFor |
gptkb:MAC
gptkb:AC-3 Backjumping Forward Checking Maintaining Arc Consistency Min-conflicts |
| gptkbp:relatedTo |
mathematical optimization
graph coloring Boolean satisfiability problem |
| gptkbp:solvedBy |
backtracking
local search constraint propagation arc consistency algorithms |
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:game_AI
robotics bioinformatics network design AI planning constraint programming prolog |
| gptkbp:bfsParent |
gptkb:Constraint_Processing_(book)
gptkb:Satisfiability |
| gptkbp:bfsLayer |
7
|