The Satisfiability Problem Regarded as a Constraint Satisfaction Problem.
Hachemi BennaceurPublished in: ECAI (1996)
Keyphrases
- constraint satisfaction problems
- satisfiability problem
- np complete
- constraint satisfaction
- sat problem
- phase transition
- finite domain
- constraint propagation
- constraint programming
- randomly generated
- search algorithm
- stochastic local search algorithms
- temporal logic
- np hard
- graph coloring problems
- solving hard
- search space
- stochastic local search
- non binary
- davis putnam
- arc consistency
- combinatorial problems
- sat instances
- computational complexity
- constraint solving
- decision procedures
- max sat
- soft constraints
- propositional satisfiability
- symmetry breaking
- bounded treewidth
- random instances
- search problems
- heuristic search
- partial constraint satisfaction