3-SAT on CUDA: Towards a massively parallel SAT solver.
Quirin MeyerFabian SchönfeldMarc StammingerRolf WankaPublished in: HPCS (2010)
Keyphrases
- massively parallel
- sat solvers
- parallel computing
- parallel programming
- propositional satisfiability
- boolean satisfiability
- orders of magnitude
- sat solving
- sat problem
- sat instances
- constraint satisfaction
- max sat
- search strategies
- fine grained
- search space
- parallel implementation
- high performance computing
- search tree
- computing systems
- shared memory
- sat encodings
- parallel machines
- maximum satisfiability
- clause learning
- boolean formula
- answer sets
- search algorithm
- objective function