A Characterisation of First-Order Constraint Satisfaction Problems.
Benoît LaroseCynthia LotenClaude TardifPublished in: LICS (2006)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- decision diagrams
- constraint programming
- np complete
- constraint propagation
- search space
- non binary
- first order logic
- combinatorial problems
- forward checking
- computational problems
- arc consistency
- constraint networks
- constraint solving
- soft constraints
- partial constraint satisfaction
- np hard
- random instances
- solving constraint satisfaction problems
- constraint solver
- global constraints
- backtracking search
- sat problem
- finite domain
- temporal constraints
- polynomial size