Local consistency as a reduction between constraint satisfaction problems.
Víctor DalmauJakub OprsalPublished in: LICS (2024)
Keyphrases
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- global constraints
- weighted constraint satisfaction
- constraint problems
- path consistency
- maintaining arc consistency
- tractable subclasses
- constraint propagation
- disjunctive constraints
- constraint programming
- arc consistency
- consistency checking
- binary constraints
- search space
- np hard
- np complete
- combinatorial problems
- qualitative spatial and temporal reasoning
- non binary
- constraint solvers
- constraint solving
- constraint optimization
- forward checking
- constraint graph
- computational problems
- finite domain
- soft constraints
- reducing the search space
- optimal solution
- partial constraint satisfaction
- combinatorial optimization
- solving constraint satisfaction problems
- product configuration
- decomposition methods
- sat problem