DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently.
Stephen M. MajercikByron BootsPublished in: AAAI (2005)
Keyphrases
- satisfiability problem
- davis putnam logemann loveland
- solving hard
- stochastic local search
- np complete
- sat instances
- finite domain
- temporal logic
- sat problem
- search algorithm
- graph coloring problems
- phase transition
- boolean satisfiability
- pspace complete
- scheduling problem
- model checking
- constraint programming
- constraint satisfaction problems
- stochastic local search algorithms
- random sat
- dc programming
- max sat
- first order logic
- orders of magnitude
- objective function
- davis putnam
- modal logic
- mazurkiewicz traces
- combinatorial optimization