Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
Benoît LarosePascal TessonPublished in: ICALP (2007)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- np hard
- random instances
- phase transition
- constraint programming
- constraint propagation
- combinatorial problems
- constraint solving
- arc consistency
- search space
- data model
- relational algebra
- computational complexity
- worst case
- constraint networks
- non binary
- interval algebra
- temporal constraints
- soft constraints
- reasoning problems
- decomposition methods
- randomly generated
- constraint optimization
- graph coloring
- sat problem
- query language
- global constraints
- constraint problems
- computational problems
- finite domain
- forward checking
- backtracking search
- dynamic constraint satisfaction problems
- pseudo boolean optimization