MiniSat

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 521 articles , 1 standard article )

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

1 2 3 ... 25 26 27 next

  1. Gaggl, Sarah A.; Linsbichler, Thomas; Maratea, Marco; Woltran, Stefan: Design and results of the second international competition on computational models of argumentation (2020)
  2. Lagniez, Jean-Marie; Lonca, Emmanuel; Marquis, Pierre: Definability for model counting (2020)
  3. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  4. Sebastiani, Roberto; Trentin, Patrick: \textscOptiMathSAT: a tool for optimization modulo theories (2020)
  5. Semenov, Alexander; Otpuschennikov, Ilya; Gribanova, Irina; Zaikin, Oleg; Kochemazov, Stepan: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems (2020)
  6. Abd El-Maksoud, Munira A.; Abdalla, Areeg: A novel SAT solver for the Van der Waerden numbers (2019)
  7. Alviano, Mario; Dodaro, Carmine; Fichte, Johannes K.; Hecher, Markus; Philipp, Tobias; Rath, Jakob: Inconsistency proofs for ASP: the ASP-DRUPE format (2019)
  8. Banbara, Mutsunori; Inoue, Katsumi; Kaufmann, Benjamin; Okimoto, Tenda; Schaub, Torsten; Soh, Takehide; Tamura, Naoyuki; Wanko, Philipp: \textitteaspoon: solving the curriculum-based course timetabling problems with answer set programming (2019)
  9. Breik, Keenan; Thachuk, Chris; Heule, Marijn; Soloveichik, David: Computing properties of stable configurations of thermodynamic binding networks (2019)
  10. Cassano, Valentin; Fervari, Raul; Hoffmann, Guillaume; Areces, Carlos; Castro, Pablo F.: A tableaux calculus for default intuitionistic logic (2019)
  11. Cerutti, Federico; Giacomin, Massimiliano; Vallati, Mauro: How we designed winning algorithms for abstract argumentation and which insight we attained (2019)
  12. Däubel, Karl; Jäger, Sven; Mütze, Torsten; Scheucher, Manfred: On orthogonal symmetric chain decompositions (2019)
  13. Fichte, Johannes K.; Kronegger, Martin; Woltran, Stefan: A multiparametric view on answer set programming (2019)
  14. Hodžić, S.; Pasalic, E.; Chattopadhyay, A.: An iterative method for linear decomposition of index generating functions (2019)
  15. 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)
  16. Karpiński, Michał; Piotrów, Marek: Encoding cardinality constraints using multiway merge selection networks (2019)
  17. Li, Jianwen; Zhu, Shufang; Pu, Geguang; Zhang, Lijun; Vardi, Moshe Y.: SAT-based explicit LTL reasoning and its application to satisfiability checking (2019)
  18. Reger, Giles; Riener, Martin; Suda, Martin: Symmetry avoidance in MACE-style finite model finding (2019)
  19. Wang, Wenxi; Søndergaard, Harald; Stuckey, Peter J.: Wombit: a portfolio bit-vector solver using word-level propagation (2019)
  20. Zha, Aolong; Koshimura, Miyuki; Fujita, Hiroshi: (N)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (2019)

1 2 3 ... 25 26 27 next


Further publications can be found at: http://minisat.se/Papers.html