SATO: A Solver for Propositional Satisfiability: The Davis-Putnam method is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. In the last decade, we developed a very efficient implementation of the Davis-Putnam method called SATO. The efficiency of our programs allowed us to solve over one hundred open quasigroup problems in design theory. We also experimented SATO on networked workstations by using a master-slave model for communication. A simple and effective workload balancing method distributes the workload among workstations.

References in zbMATH (referenced in 180 articles )

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

1 2 3 ... 7 8 9 next

  1. Hamadi, Youssef; Jabbour, Saïd; Saïs, Lakhdar: What we can learn from conflicts in propositional satisfiability (2016)
  2. Triska, Markus: The Boolean constraint solver of SWI-prolog (system description) (2016)
  3. Zhang, Hantao: An experiment with satisfiability modulo SAT (2016)
  4. Biere, Armin; Fröhlich, Andreas: Evaluating CDCL variable scoring schemes (2015)
  5. Ahmed, Tanbir; Kullmann, Oliver; Snevily, Hunter: On the van der Waerden numbers $\mathrmw(2; 3, t)$ (2014)
  6. Barrett, Clark; Deters, Morgan; de Moura, Leonardo; Oliveras, Albert; Stump, Aaron: 6 years of SMT-COMP (2013) ioport
  7. Hamadi, Youssef; Jabbour, Saïd; Saïs, Lakhdar: Learning from conflicts in propositional satisfiability (2012)
  8. Martins, Ruben; Manquinho, Vasco; Lynce, In^es: An overview of parallel SAT solving (2012)
  9. Triska, Markus; Musliu, Nysret: An improved SAT formulation for the social golfer problem (2012)
  10. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)
  11. González, José A.; Castro, Jordi: A heuristic block coordinate descent approach for controlled tabular adjustment (2011)
  12. Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka: Partitioning search spaces of a randomized search (2011)
  13. Ibaraki, Toshihide; Imamichi, Takashi; Koga, Yuichi; Nagamochi, Hiroshi; Nonobe, Koji; Yagiura, Mutsunori: Efficient branch-and-bound algorithms for weighted MAX-2-SAT (2011)
  14. Marić, Filip; Janičić, Predrag: Formalization of abstract state transition systems for SAT (2011)
  15. Sakallah, Karem A.; Marques-Silva, Joao: Anatomy and empirical evaluation of modern SAT solvers (2011)
  16. Shankar, Natarajan; Vaucher, Marc: The mechanical verification of a DPLL-based satisfiability solver (2011)
  17. Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka: Partitioning SAT instances for distributed solving (2010)
  18. Marić, Filip: Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (2010)
  19. Schulz, Sven; Blochinger, Wolfgang: Parallel SAT solving on peer-to-peer desktop grids (2010) ioport
  20. Claessen, Koen; Een, Niklas; Sheeran, Mary; Sörensson, Niklas; Voronov, Alexey; Åkesson, Knut: SAT-solving in practice, with a tutorial example from supervisory control (2009)

1 2 3 ... 7 8 9 next