Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids.

Sven Schulz Wolfgang Blochinger

Published in: HPCS (2010)

Keyphrases

sat solving
peer to peer
boolean optimization
sat solvers
boolean satisfiability
grid computing
sat problem
sat encodings
search tree
digital libraries
planning problems
search strategies
search algorithm
sat instances
symmetry breaking
probabilistic planning
constraint satisfaction
special case