Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems.
Tomoyuki YamakamiPublished in: Theory Comput. Syst. (2014)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- binary constraints
- constraint programming
- constraint solving
- non binary
- solving constraint satisfaction problems
- constraint networks
- combinatorial problems
- global constraints
- constraint solver
- constraint propagation
- soft constraints
- constraint problems
- disjunctive temporal
- np complete
- arc consistency algorithm
- arc consistency
- finite domain
- hard constraints
- constraint graph
- disjunctive constraints
- decomposition methods
- dynamic constraint satisfaction problems
- search space
- path consistency
- pairwise
- constraint optimization
- computational problems
- configuration problems
- constraint solvers
- sat problem
- backtracking algorithm
- arithmetic constraints
- maintaining arc consistency
- partial assignment
- symmetry breaking
- tractable classes
- constraint logic programming
- np hard
- frequent pattern mining
- ordering heuristics
- partial constraint satisfaction
- temporal constraints
- metaheuristic
- pseudo boolean optimization