PSATO: a Distributed/parallel Prover for propositional satisfiability (SAT) for networks of workstations. PSATO is based on the sequential SAT prover SATO, which is an efficient implementation of the Davis-Putnam algorithm. The master-slave model is used for communication. A simple and affective workload balancing method distributes the workload among workstations. A key property of our method is that the current processes explore disjoint portions of the search space. In this way, we use parallelism without introducing redundant search.

References in zbMATH (referenced in 40 articles , 1 standard article )

Showing results 1 to 20 of 40.
Sorted by year (citations)

1 2 next

  1. Ngoko, Yanik; Cérin, Christophe; Trystram, Denis: Solving SAT in a distributed cloud: a portfolio approach (2019)
  2. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  3. Le Frioux, Ludovic; Baarir, Souheib; Sopena, Julien; Kordon, Fabrice: Painless: a framework for parallel SAT solving (2017)
  4. Balyo, Tomáš; Lonsing, Florian: Hordeqbf: A modular and massively parallel QBF solver (2016)
  5. Hyvärinen, Antti E. J.; Marescotti, Matteo; Sharygina, Natasha: Search-space partitioning for parallelizing SMT solvers (2015)
  6. Ahmed, Tanbir; Kullmann, Oliver; Snevily, Hunter: On the van der Waerden numbers (\mathrmw(2; 3, t)) (2014)
  7. Kinyon, Michael; Veroff, Robert; Vojtěchovský, Petr: Loops with abelian inner mapping groups: an application of automated deduction (2013)
  8. Martins, Ruben; Manquinho, Vasco; Lynce, Inês: An overview of parallel SAT solving (2012)
  9. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)
  10. Hyvärinen, Antti E. J.; Junttila, Tommi; Niemelä, Ilkka: Partitioning search spaces of a randomized search (2011)
  11. Hyvärinen, Antti E. J.; Junttila, Tommi; Niemelä, Ilkka: Partitioning SAT instances for distributed solving (2010)
  12. Schulz, Sven; Blochinger, Wolfgang: Parallel SAT solving on peer-to-peer desktop grids (2010) ioport
  13. Delgrande, James; Schaub, Torsten; Tompits, Hans; Woltran, Stefan: Merging logic programs under answer set semantics (2009)
  14. Eggers, Andreas; Kalinnik, Natalia; Kupferschmid, Stefan; Teige, Tino: Challenges in constraint-based analysis of hybrid systems (2009)
  15. Hyvärinen, Antti E. J.; Junttila, Tommi; Niemelä, Ilkka: Incorporating clause learning in grid-based randomized SAT solving (2009)
  16. Schubert, Tobias; Lewis, Matthew; Becker, Bernd: PaMiraXT: parallel SAT solving with threads and message passing (2009)
  17. Vander-Swalmen, Pascal; Dequen, Gilles; Krajecki, Michaël: A collaborative approach for multi-threaded SAT solving (2009)
  18. Heule, Marijn J. H.; van Maaren, Hans: Parallel SAT solving using bit-level operations (2008)
  19. Hyvärinen, Antti E. J.; Junttila, Tommi; Niemelä, Ilkka: Strategies for solving SAT in grids by randomized search (2008)
  20. Ganai, Malay K.; Gupta, Aarti; Yang, Zijiang; Ashar, Pranav: Efficient distributed SAT and sAT-based distributed bounded model checking (2006) ioport

1 2 next