Grid-based SAT solving with iterative partitioning and clause learning

  • Authors:

  • Antti E. J. Hyvärinen;Tommi Junttila;Ilkka Niemelä

  • Affiliations:

  • Aalto University, Department of Information and Computer Science, AALTO, Finland;Aalto University, Department of Information and Computer Science, AALTO, Finland;Aalto University, Department of Information and Computer Science, AALTO, Finland

  • Venue:
  • CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work studies the solving of challenging SAT problem instances in distributed computing environments that have massive amounts of parallel resources but place limits on individual computations. We present an abstract framework which extends a previously presented iterative partitioning approach with clause learning, a key technique applied in modern SAT solvers. In addition we present two techniques that alter the clause learning of modern SAT solvers to fit the framework. An implementation of the proposed framework is then analyzed experimentally using a well-known set of benchmark instances. The results are very encouraging. For example, the implementation is able to solve challenging SAT instances not solvable in reasonable time by state-of-the-art sequential and parallel SAT solvers.