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

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

1 2 3 ... 16 17 18 next

  1. Abramé, André; Habet, Djamal; Toumi, Donia: Improving configuration checking for satisfiable random $k$-SAT instances (2017)
  2. Al-Saedi, Balasim; Fourdrinoy, Olivier; Grégoire, Éric; Mazure, Bertrand; Saïs, Lakhdar: About some UP-based polynomial fragments of SAT (2017)
  3. Bhattacharyya, Anirban; Mokhov, Andrey; Pierce, Ken: An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (2017)
  4. Cabodi, G.; Camurati, P.E.; Mishchenko, A.; Palena, M.; Pasini, P.: SAT solver management strategies in IC3: an experimental approach (2017)
  5. Chakraborty, Supratik; Khasidashvili, Zurab; Seger, Carl-Johan H.; Gajavelly, Rajkumar; Haldankar, Tanmay; Chhatani, Dinesh; Mistry, Rakesh: Symbolic trajectory evaluation for word-level verification: theory and implementation (2017)
  6. Deza, Michel-Marie; Sikirić, Mathieu Dutour: Lego-like spheres and tori (2017)
  7. Ehlers, Thorsten: Merging almost sorted sequences yields a 24-sorter (2017)
  8. Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René: Analyzing program termination and complexity automatically with \ssfAProVE (2017)
  9. Lagniez, Jean-Marie; Marquis, Pierre: On preprocessing techniques and their impact on propositional model counting (2017)
  10. Zulkoski, Edward; Bright, Curtis; Heinle, Albert; Kotsireas, Ilias; Czarnecki, Krzysztof; Ganesh, Vijay: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (2017)
  11. Balyo, Tomáš; Biere, Armin; Iser, Markus; Sinz, Carsten: SAT race 2015 (2016)
  12. Brafman, Ronen I.; Shani, Guy: Online belief tracking using regression for contingent planning (2016)
  13. Calimeri, Francesco; Gebser, Martin; Maratea, Marco; Ricca, Francesco: Design and results of the Fifth Answer Set Programming Competition (2016)
  14. Cooper, Martin C.; Duchein, Aymeric; El Mouelhi, Achref; Escamocher, Guillaume; Terrioux, Cyril; Zanuttini, Bruno: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (2016)
  15. Dolev, Danny; Heljanko, Keijo; Järvisalo, Matti; Korhonen, Janne H.; Lenzen, Christoph; Rybicki, Joel; Suomela, Jukka; Wieringa, Siert: Synchronous counting and computational algorithm design (2016)
  16. Giráldez-Cru, Jesús; Levy, Jordi: Generating SAT instances with community structure (2016)
  17. Hamadi, Youssef; Jabbour, Saïd; Saïs, Lakhdar: What we can learn from conflicts in propositional satisfiability (2016)
  18. Ignatiev, Alexey; Janota, Mikoláš; Marques-Silva, Joao: Quantified maximum satisfiability (2016)
  19. Jäger, Gerold; Climer, Sharlee; Zhang, Weixiong: The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (2016)
  20. Janota, Mikoláš; Klieber, William; Marques-Silva, Joao; Clarke, Edmund: Solving QBF with counterexample guided refinement (2016)

1 2 3 ... 16 17 18 next


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