Constraint Satisfaction Problems in Non-deterministic Logarithmic Space.
Víctor DalmauPublished in: ICALP (2002)
Keyphrases
- constraint satisfaction problems
- search space
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- non binary
- np hard
- arc consistency
- constraint solving
- computational problems
- constraint networks
- soft constraints
- forward checking
- global constraints
- decomposition methods
- arc consistency algorithm
- disjunctive temporal
- search algorithm
- tractable subclasses
- solving constraint satisfaction problems
- pseudo boolean optimization
- finite domain
- constraint solver
- constraint problems
- combinatorial problems
- tractable classes
- reasoning problems
- product configuration
- lower bound