Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Steffen ReithHeribert VollmerPublished in: Inf. Comput. (2003)
Keyphrases
- constraint satisfaction problems
- reasoning problems
- np complete
- sat problem
- constraint satisfaction
- constraint programming
- propositional logic
- qualitative spatial and temporal reasoning
- combinatorial problems
- constraint propagation
- search space
- non binary
- satisfiability testing
- constraint solving
- soft constraints
- arc consistency
- symmetry breaking
- backtracking search
- np hard
- solving constraint satisfaction problems
- computational complexity
- computational problems
- satisfiability problem
- optimal solution
- global constraints
- cnf formula
- phase transition
- partial constraint satisfaction
- first order logic
- lower bound
- temporal constraints
- boolean formula
- sat encodings