Partitioning SAT Instances for Distributed Solving.
Antti Eero Johannes HyvärinenTommi A. JunttilaIlkka NiemeläPublished in: LPAR (Yogyakarta) (2010)
Keyphrases
- sat instances
- satisfiability problem
- sat solvers
- randomly generated
- stochastic local search
- sat problem
- random sat instances
- computational properties
- phase transition
- np complete
- boolean satisfiability
- propositional satisfiability
- systematic search algorithms
- constraint satisfaction problems
- search space
- search algorithm
- special case
- evolutionary algorithm
- objective function