A new tractable class of constraint satisfaction problems.
Víctor DalmauPublished in: Ann. Math. Artif. Intell. (2005)
Keyphrases
- constraint satisfaction problems
- tractable classes
- np complete
- constraint satisfaction
- computational problems
- constraint programming
- np hard
- constraint propagation
- search space
- reasoning problems
- arc consistency
- non binary
- constraint solving
- combinatorial problems
- constraint optimization
- forward checking
- finite domain
- solving constraint satisfaction problems
- constraint networks
- finding optimal solutions
- decomposition methods
- global constraints
- bounded treewidth
- product configuration
- backtracking search
- temporal constraints
- temporal reasoning
- dynamic constraint satisfaction problems
- pseudo boolean optimization
- constraint problems
- computational complexity
- soft constraints
- arc consistency algorithm
- partial constraint satisfaction