Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems.
Tomoyuki YamakamiPublished in: WAOA (2010)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- search space
- constraint programming
- np complete
- computational problems
- arc consistency
- non binary
- combinatorial problems
- pseudo boolean optimization
- global constraints
- constraint solving
- np hard
- boolean functions
- decomposition methods
- constraint optimization
- constraint networks
- temporal constraints
- soft constraints
- constraint problems
- forward checking
- solving constraint satisfaction problems
- partial constraint satisfaction
- disjunctive temporal