Key-Based Problem Decomposition for Relational Constraint Satisfaction Problems.
James J. LuSebastien SivaPublished in: ICTAI (2011)
Keyphrases
- constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- constraint propagation
- constraint programming
- tree decomposition
- np complete
- search space
- non binary
- arc consistency
- combinatorial problems
- soft constraints
- global constraints
- constraint solving
- sat problem
- computational problems
- constraint networks
- np hard
- solving constraint satisfaction problems
- product configuration
- pseudo boolean optimization
- relational learning
- data model
- finite domain
- relational databases
- partial constraint satisfaction
- decomposition method
- temporal constraints
- reasoning problems
- backtracking algorithm
- arc consistency algorithm
- finding optimal solutions
- disjunctive temporal
- optimal solution