SAT-Based versus CSP-Based Constraint Weighting for Satisfiability.
Duc Nghia PhamJohn ThorntonAbdul SattarAbdelraouf IshtaiwiPublished in: AAAI (2005)
Keyphrases
- sat encodings
- constraint solver
- constraint satisfaction problems
- constraint networks
- constraint solving
- sat solvers
- constraint programming
- combinatorial problems
- sat problem
- bounded model checking
- graph coloring
- constraint propagation
- np complete
- disjunctive temporal
- constraint graph
- linear constraints
- boolean satisfiability
- constraint satisfaction
- global constraints
- finite domain
- symmetry breaking
- arc consistency
- propositional satisfiability
- planning problems
- orders of magnitude
- satisfiability problem
- decomposition methods
- soft constraints
- weighting scheme
- phase transition
- unit propagation
- tree decomposition
- binary constraints
- temporal reasoning