An extensible SAT-solver. MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT. It is released under the MIT licence, and is currently used in a number of projects (see ”Links”). On this page you will find binaries, sources, documentation and projects related to MiniSat, including the Pseudo-boolean solver MiniSat+ and the CNF minimizer/preprocessor SatELite. Together with SatELite, MiniSat was recently awarded in the three industrial categories and one of the ”crafted” categories of the SAT 2005 competition.

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

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

1 2 3 ... 24 25 26 next

  1. Abd El-Maksoud, Munira A.; Abdalla, Areeg: A novel SAT solver for the Van der Waerden numbers (2019)
  2. Banbara, Mutsunori; Inoue, Katsumi; Kaufmann, Benjamin; Okimoto, Tenda; Schaub, Torsten; Soh, Takehide; Tamura, Naoyuki; Wanko, Philipp: teaspoon: solving the curriculum-based course timetabling problems with answer set programming (2019)
  3. Breik, Keenan; Thachuk, Chris; Heule, Marijn; Soloveichik, David: Computing properties of stable configurations of thermodynamic binding networks (2019)
  4. Däubel, Karl; Jäger, Sven; Mütze, Torsten; Scheucher, Manfred: On orthogonal symmetric chain decompositions (2019)
  5. de Uña, Diego; Gange, Graeme; Schachte, Peter; Stuckey, Peter J.: Compiling CP subproblems to MDDs and d-DNNFs (2019)
  6. Fichte, Johannes K.; Kronegger, Martin; Woltran, Stefan: A multiparametric view on answer set programming (2019)
  7. Hodžić, S.; Pasalic, E.; Chattopadhyay, A.: An iterative method for linear decomposition of index generating functions (2019)
  8. Jančík, Pavel; Kofroň, Jan; Alt, Leonardo; Fedyukovich, Grigory; Hyvärinen, Antti E. J.; Sharygina, Natasha: Exploiting partial variable assignment in interpolation-based model checking (2019)
  9. Karpiński, Michał; Piotrów, Marek: Encoding cardinality constraints using multiway merge selection networks (2019)
  10. Li, Jianwen; Zhu, Shufang; Pu, Geguang; Zhang, Lijun; Vardi, Moshe Y.: SAT-based explicit LTL reasoning and its application to satisfiability checking (2019)
  11. Wang, Wenxi; Søndergaard, Harald; Stuckey, Peter J.: Wombit: a portfolio bit-vector solver using word-level propagation (2019)
  12. Zha, Aolong; Koshimura, Miyuki; Fujita, Hiroshi: (N)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (2019)
  13. Alviano, Mario; Dodaro, Carmine; Maratea, Marco: Shared aggregate sets in answer set programming (2018)
  14. Bendík, Jaroslav; Černá, Ivana: Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets (2018)
  15. Biere, Armin; Kröning, Daniel: SAT-based model checking (2018)
  16. Blanchette, Jasmin Christian; Fleury, Mathias; Lammich, Peter; Weidenbach, Christoph: A verified SAT solver framework with learn, forget, restart, and incrementality (2018)
  17. Cerutti, Federico; Vallati, Mauro; Giacomin, Massimiliano: On the impact of configuration on abstract argumentation automated reasoning (2018)
  18. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  19. de Nivelle, Hans: Subsumption algorithms for three-valued geometric resolution (2018)
  20. Echenim, Mnacho; Peltier, Nicolas; Sellami, Yanis: A generic framework for implicate generation modulo theories (2018)

1 2 3 ... 24 25 26 next

Further publications can be found at: