Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems.
Albert AtseriasMark WeyerPublished in: CSL (2009)
Keyphrases
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- constraint problems
- global constraints
- weighted constraint satisfaction
- path consistency
- constraint propagation
- tractable subclasses
- constraint programming
- consistency checking
- search space
- disjunctive constraints
- maintaining arc consistency
- constraint solvers
- non binary
- arc consistency
- reasoning problems
- constraint solving
- np complete
- np hard
- combinatorial problems
- backtracking search
- binary constraints
- pseudo boolean optimization
- constraint solver
- computational problems
- sat problem
- first order logic
- constraint graph
- forward checking
- symmetry breaking
- solving constraint satisfaction problems
- partial constraint satisfaction
- computational properties
- soft constraints