Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns.
Martin C. CooperGuillaume EscamocherPublished in: Discret. Appl. Math. (2015)
Keyphrases
- constraint satisfaction problems
- constraint solving
- constraint satisfaction
- disjunctive temporal
- finite domain
- soft constraints
- constraint networks
- constraint propagation
- global constraints
- hard constraints
- constraint programming
- constraint problems
- search space
- constraint graph
- constraint solvers
- constraint solver
- combinatorial problems
- arc consistency
- np complete
- computational problems
- binary constraints
- non binary
- disjunctive constraints
- partial constraint satisfaction
- computational complexity
- pattern mining
- backtracking algorithm
- np hard
- pseudo boolean optimization
- solving constraint satisfaction problems
- optimal solution
- reasoning problems
- sat problem
- phase transition
- sequential patterns
- forward checking
- linear constraints
- backtracking search
- finding optimal solutions
- decision problems
- heuristic search
- symmetry breaking constraints
- frequent patterns