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

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

1 2 3 ... 28 29 30 next

  1. Linsbichler, Thomas; Maratea, Marco; Niskanen, Andreas; Wallner, Johannes P.; Woltran, Stefan: Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (2022)
  2. Ansótegui, Carlos; Ojeda, Jesús; Pacheco, Antonio; Pon, Josep; Salvia, Josep M.; Torres, Eduard: OptiLog: a framework for SAT-based systems (2021)
  3. 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)
  4. Bjørner, Nikolaj; Levatich, Maxwell; Lopes, Nuno P.; Rybalchenko, Andrey; Vuppalapati, Chandrasekar: Supercharging plant configurations using Z3 (2021)
  5. Bonet, Maria Luisa; Buss, Sam; Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: Propositional proof systems based on maximum satisfiability (2021)
  6. Cai, Shaowei; Zhang, Xindi: Deep cooperation of CDCL and local search for SAT (2021)
  7. Cao, Henrik: Hash-based preprocessing and inprocessing techniques in SAT solvers (2021)
  8. Cárdenas-Barrón, Leopoldo E.; Melo, Rafael A.; Santos, Marcio C.: Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (2021)
  9. Darwiche, Adnan; Marquis, Pierre: On quantifying literals in Boolean logic and its applications to explainable AI (2021)
  10. 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)
  11. Fleury, Mathias; Biere, Armin: Efficient all-UIP learned clause minimization (2021)
  12. Giráldez-Cru, Jesús; Levy, Jordi: Popularity-similarity random SAT formulas (2021)
  13. Griggio, Alberto; Roveri, Marco; Tonetta, Stefano: Certifying proofs for SAT-based model checking (2021)
  14. Hossain, Akash; Laroussinie, François: (\mathsfQCTL) model-checking with (\mathsfQBF) solvers (2021)
  15. Kochemazov, Stepan; Ignatiev, Alexey; Marques-Silva, Joao: Assessing progress in SAT solvers through the Lens of incremental SAT (2021)
  16. Kyrillidis, Anastasios; Shrivastava, Anshumali; Vardi, Moshe Y.; Zhang, Zhiwei: Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (2021)
  17. Le Berre, Daniel; Wallon, Romain: On dedicated CDCL strategies for PB solvers (2021)
  18. Li, Chunxiao; Chung, Jonathan; Mukherjee, Soham; Vinyals, Marc; Fleming, Noah; Kolokolova, Antonina; Mu, Alice; Ganesh, Vijay: On the hierarchical community structure of practical Boolean formulas (2021)
  19. Luteberget, Bjørnar; Claessen, Koen; Johansen, Christian; Steffen, Martin: SAT modulo discrete event simulation applied to railway design capacity analysis (2021)
  20. Luteberget, Bjørnar; Johansen, Christian: Drawing with SAT: four methods and a tool for producing railway infrastructure schematics (2021)

1 2 3 ... 28 29 30 next


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