Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
Kazuo IwamaDaisuke KawaiShuichi MiyazakiYasuo OkabeJun UmemotoPublished in: ACM J. Exp. Algorithmics (2002)
Keyphrases
- satisfiability testing
- model counting
- stochastic local search
- sat solving
- propositional satisfiability
- cnf formula
- conjunctive normal form
- satisfiability problem
- clause learning
- propositional logic
- sat problem
- sat solvers
- sat instances
- search algorithm
- random sat instances
- boolean formula
- np complete
- phase transition
- quantified boolean formulas
- line segments
- line drawings
- global search
- search space
- max sat
- virtual machine
- genetic algorithm
- automated reasoning
- tabu search
- randomly generated
- boolean functions
- search procedures
- simulated annealing
- computational complexity
- distributed memory machines
- particle swarm optimization
- parallel algorithm
- normal form
- parallel processing
- search strategies