Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
Kazuo IwamaDaisuke KawaiShuichi MiyazakiYasuo OkabeJun UmemotoPublished in: WAE (2000)
Keyphrases
- satisfiability testing
- model counting
- stochastic local search
- sat solving
- cnf formula
- propositional satisfiability
- clause learning
- conjunctive normal form
- satisfiability problem
- propositional logic
- sat problem
- sat solvers
- search algorithm
- sat instances
- np complete
- max sat
- phase transition
- random sat instances
- boolean formula
- virtual machine
- boolean functions
- propositional formulas
- quantified boolean formulas
- line segments
- optimal solution
- line drawings
- computational complexity
- knowledge compilation
- job shop scheduling problem
- global search
- randomly generated
- parallel processing
- tabu search
- genetic algorithm