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

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

1 2 3 ... 26 27 28 next

  1. Bhattacharyya, Arnab; Gupta, Ashutosh; Kuppusamy, Lakshmanan; Mani, Somya; Shukla, Ankit; Srivas, Mandayam; Thattai, Mukund: A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (2021)
  2. Bonet, Maria Luisa; Buss, Sam; Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: Propositional proof systems based on maximum satisfiability (2021)
  3. de Azevedo, Guilherme Henrique Ismael; Pessoa, Artur Alves; Subramanian, Anand: A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints (2021)
  4. Giráldez-Cru, Jesús; Levy, Jordi: Popularity-similarity random SAT formulas (2021)
  5. Hossain, Akash; Laroussinie, François: (\mathsfQCTL) model-checking with (\mathsfQBF) solvers (2021)
  6. Kyrillidis, Anastasios; Shrivastava, Anshumali; Vardi, Moshe Y.; Zhang, Zhiwei: Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (2021)
  7. Ponzio, Pablo; Godio, Ariel; Rosner, Nicolás; Arroyo, Marcelo; Aguirre, Nazareno; Frias, Marcelo F.: Efficient bounded model checking of heap-manipulating programs using tight field bounds (2021)
  8. Zavatteri, Matteo; Combi, Carlo; Rizzi, Romeo; Viganò, Luca: Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (2021)
  9. Alviano, Mario; Dodaro, Carmine: Unsatisfiable core analysis and aggregates for optimum stable model search (2020)
  10. Bian, Zhengbing; Chudak, Fabian; Macready, William; Roy, Aidan; Sebastiani, Roberto; Varotti, Stefano: Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (2020)
  11. Brewka, Gerhard; Diller, Martin; Heissenberger, Georg; Linsbichler, Thomas; Woltran, Stefan: Solving advanced argumentation problems with answer set programming (2020)
  12. Chen, Qian Matteo; Finzi, Alberto; Mancini, Toni; Melatti, Igor; Tronci, Enrico: MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks (2020)
  13. Derbez, Patrick; Perrin, Léo: Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE (2020)
  14. Dodaro, Carmine; Ricca, Francesco: The external interface for extending WASP (2020)
  15. Drechsler, Rolf (ed.); Soeken, Mathias (ed.): Advanced Boolean techniques. Selected papers from the 13th international workshop on Boolean problems, Bremen, Germany, September 19--21, 2018 (2020)
  16. Gaggl, Sarah A.; Linsbichler, Thomas; Maratea, Marco; Woltran, Stefan: Design and results of the second international competition on computational models of argumentation (2020)
  17. Kaufmann, Daniela; Biere, Armin; Kauers, Manuel: Incremental column-wise verification of arithmetic circuits using computer algebra (2020)
  18. Lagniez, Jean-Marie; Lonca, Emmanuel; Marquis, Pierre: Definability for model counting (2020)
  19. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  20. Li, Jianwen; Pu, Geguang; Zhang, Yueling; Vardi, Moshe Y.; Rozier, Kristin Y.: SAT-based explicit (\mathsfLTL_f) satisfiability checking (2020)

1 2 3 ... 26 27 28 next

Further publications can be found at: