JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check.
Daniel SingerAnthony MonnetPublished in: PPAM (2007)
Keyphrases
- satisfiability problem
- solving hard
- sat problem
- sat solvers
- weighted max sat
- boolean satisfiability
- np complete
- temporal logic
- phase transition
- stochastic local search
- max sat
- graph coloring problems
- search algorithm
- stochastic local search algorithms
- sat instances
- answer set programming
- propositional satisfiability
- conjunctive normal form
- query processing
- search space
- search strategies
- combinatorial problems
- constraint satisfaction
- model checking
- orders of magnitude
- logic programs
- computational complexity