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

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

1 2 3 ... 23 24 25 next

  1. 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)
  2. Bendík, Jaroslav; Černá, Ivana: Evaluation of domain agnostic approaches for enumeration of minimal unsatisfiable subsets (2018)
  3. Biere, Armin; Kröning, Daniel: SAT-based model checking (2018)
  4. Blanchette, Jasmin Christian; Fleury, Mathias; Lammich, Peter; Weidenbach, Christoph: A verified SAT solver framework with learn, forget, restart, and incrementality (2018)
  5. Cerutti, Federico; Vallati, Mauro; Giacomin, Massimiliano: On the impact of configuration on abstract argumentation automated reasoning (2018)
  6. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  7. de Nivelle, Hans: Subsumption algorithms for three-valued geometric resolution (2018)
  8. Echenim, Mnacho; Peltier, Nicolas; Sellami, Yanis: A generic framework for implicate generation modulo theories (2018)
  9. Eggensperger, Katharina; Lindauer, Marius; Hoos, Holger H.; Hutter, Frank; Leyton-Brown, Kevin: Efficient benchmarking of algorithm configurators via model-based surrogates (2018)
  10. Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: PySAT: A Python toolkit for prototyping with SAT oracles (2018)
  11. Kiesl, Benjamin; Seidl, Martina; Tompits, Hans; Biere, Armin: Local redundancy in SAT: generalizations of blocked clauses (2018)
  12. Lagniez, Jean-Marie; Le Berre, Daniel; de Lima, Tiago; Montmirail, Valentin: An assumption-based approach for solving the Minimal S5-Satisfiability problem (2018)
  13. Marques-Silva, Joao; Malik, Sharad: Propositional SAT solving (2018)
  14. Montanaro, Ashley: Quantum-walk speedup of backtracking algorithms (2018)
  15. Omori, Hitoshi; Alama, Jesse: Axiomatizing Jaśkowski’s discussive logic (\mathbfD_2) (2018)
  16. Zese, Riccardo; Bellodi, Elena; Riguzzi, Fabrizio; Cota, Giuseppe; Lamma, Evelina: Tableau reasoning for description logics and its extension to probabilities (2018)
  17. Abramé, André; Habet, Djamal; Toumi, Donia: Improving configuration checking for satisfiable random (k)-SAT instances (2017)
  18. Al-Saedi, Balasim; Fourdrinoy, Olivier; Grégoire, Éric; Mazure, Bertrand; Saïs, Lakhdar: About some UP-based polynomial fragments of SAT (2017)
  19. Audemard, Gilles; Lagniez, Jean-Marie; Szczepanski, Nicolas; Tabary, Sébastien: A distributed version of Syrup (2017)
  20. Berg, Jeremias; Järvisalo, Matti: Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (2017)

1 2 3 ... 23 24 25 next


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