Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems.
Steffen ReithHeribert VollmerPublished in: MFCS (2000)
Keyphrases
- constraint satisfaction problems
- np complete
- reasoning problems
- constraint satisfaction
- sat problem
- constraint programming
- constraint propagation
- propositional logic
- qualitative spatial and temporal reasoning
- np hard
- arc consistency
- combinatorial problems
- symmetry breaking
- search space
- backtracking search
- constraint solving
- satisfiability testing
- optimal solution
- computational complexity
- global constraints
- constraint problems
- worst case
- satisfiability problem
- cnf formula
- computational problems
- phase transition
- non binary
- sat instances
- soft constraints
- constraint networks
- tractable classes
- first order logic
- solving constraint satisfaction problems
- temporal reasoning
- temporal constraints
- forward checking
- finding optimal solutions
- partial constraint satisfaction
- lower bound
- pseudo boolean optimization