Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.
Stefan S. DantchevFlorent R. MadelainePublished in: CSR (2006)
Keyphrases
- constraint satisfaction problems
- combinatorial problems
- np complete
- computational problems
- constraint satisfaction
- constraint problems
- pseudo boolean optimization
- solving constraint satisfaction problems
- finite domain
- constraint propagation
- soft constraints
- backtracking search
- search space
- constraint programming
- partial constraint satisfaction
- decomposition methods
- finding optimal solutions
- arc consistency
- non binary
- constraint solving
- combinatorial optimization
- optimization problems
- difficult problems
- ordering heuristics
- forward checking
- bounded treewidth
- np hard