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

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

1 2 3 ... 16 17 18 next

  1. Calimeri, Francesco; Gebser, Martin; Maratea, Marco; Ricca, Francesco: Design and results of the Fifth Answer Set Programming Competition (2016)
  2. 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)
  3. 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)
  4. Hamadi, Youssef; Jabbour, Saïd; Saïs, Lakhdar: What we can learn from conflicts in propositional satisfiability (2016)
  5. Ignatiev, Alexey; Janota, Mikoláš; Marques-Silva, Joao: Quantified maximum satisfiability (2016)
  6. 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)
  7. Janota, Mikoláš; Klieber, William; Marques-Silva, Joao; Clarke, Edmund: Solving QBF with counterexample guided refinement (2016)
  8. KhudaBukhsh, Ashiqur R.; Xu, Lin; Hoos, Holger H.; Leyton-Brown, Kevin: SATenstein: automatically building local search SAT solvers from components (2016)
  9. Liffiton, Mark H.; Previti, Alessandro; Malik, Ammar; Marques-Silva, Joao: Fast, flexible MUS enumeration (2016)
  10. Schlaipfer, Matthias; Weissenbacher, Georg: Labelled interpolation systems for hyper-resolution, clausal, and local proofs (2016)
  11. Semenov, A.A.; Otpuschennikov, I.V.: On one class of decision diagrams (2016)
  12. Balint, Adrian; Belov, Anton; Järvisalo, Matti; Sinz, Carsten: Overview and analysis of the SAT challenge 2012 solver competition (2015)
  13. Balyo, Tomáš; Sanders, Peter; Sinz, Carsten: HordeSat: a massively parallel portfolio SAT solver (2015)
  14. Berger, Ulrich; Lawrence, Andrew; Forsberg, Fredrik Nordvall; Seisenberger, Monika: Extracting verified decision procedures: DPLL and resolution (2015)
  15. Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah A.; Wallner, Johannes P.; Woltran, Stefan: Methods for solving reasoning problems in abstract argumentation -- a survey (2015)
  16. Dau, Son Hoang; Chee, Yeow Meng: Polynomial time algorithm for min-ranks of graphs with simple tree structures (2015)
  17. Finger, Marcelo; De Bona, Glauber: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (2015)
  18. Heule, Marijn J.H.; Hunt, Warren A.jun.; Wetzler, Nathan: Expressing symmetry breaking in DRAT proofs (2015)
  19. Jäger, Gerold; Arnold, Florian: SAT and IP based algorithms for magic labeling including a complete search for total magic labelings (2015)
  20. Klimoš, Miroslav; Kučera, Antonín: Cobra: a tool for solving general deductive games (2015)

1 2 3 ... 16 17 18 next


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