Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Local Consistency.
Dejan DelicPublished in: CoRR (2017)
Keyphrases
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- constraint problems
- path consistency
- global constraints
- disjunctive constraints
- weighted constraint satisfaction
- tractable subclasses
- constraint propagation
- consistency checking
- constraint programming
- np complete
- arc consistency
- search space
- constraint solving
- np hard
- non binary
- binary constraints
- constraint graph
- product configuration
- theorem proving
- max csp
- decomposition methods
- global consistency
- forward checking
- finite domain
- pseudo boolean optimization
- temporal constraints
- constraint solver
- temporal reasoning
- hard constraints
- soft constraints
- backtracking algorithm
- finding optimal solutions
- partial constraint satisfaction
- theorem prover
- cost function
- search algorithm