The complexity of constraint satisfaction problems for small relation algebras.
Matteo CristaniRobin HirschPublished in: Artif. Intell. (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint programming
- constraint propagation
- arc consistency
- combinatorial problems
- np complete
- constraint solving
- computational problems
- sat problem
- non binary
- pseudo boolean optimization
- partial constraint satisfaction
- worst case
- np hard
- global constraints
- constraint problems
- forward checking
- constraint networks
- space complexity
- decomposition methods
- configuration problems
- constraint optimization
- dynamic constraint satisfaction problems
- computational complexity
- backtracking search
- disjunctive constraints
- lower bound
- disjunctive temporal