Approximate counting for complex-weighted Boolean constraint satisfaction problems.
Tomoyuki YamakamiPublished in: Inf. Comput. (2012)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- search space
- constraint propagation
- arc consistency
- np complete
- non binary
- combinatorial problems
- constraint solving
- soft constraints
- constraint networks
- boolean functions
- computational problems
- forward checking
- constraint solver
- constraint problems
- np hard
- sat problem
- path consistency
- global constraints
- constraint graph
- backtracking search
- solving constraint satisfaction problems
- disjunctive temporal
- pseudo boolean optimization