sharpSAT – counting models with advanced component caching and implicit BCP. We introduce sharpSAT, a new #SAT solver that is based on the well known DPLL algorithm and techniques from SAT and #SAT solvers. Most importantly, we introduce an entirely new approach of coding components, which reduces the cache size by at least one order of magnitude, and a new cache management scheme. Furthermore, we apply a well known look ahead based on BCP in a manner that is well suited for #SAT solving. We show that these techniques are highly beneficial, especially on large structured instances, such that our solver performs significantly better than other #SAT solvers.

References in zbMATH (referenced in 23 articles )

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

1 2 next

  1. Lagniez, Jean-Marie; Lonca, Emmanuel; Marquis, Pierre: Definability for model counting (2020)
  2. Achlioptas, Dimitris; Theodoropoulos, Panos: Model counting with error-correcting codes (2019)
  3. Boege, Tobias; D’Alì, Alessio; Kahle, Thomas; Sturmfels, Bernd: The geometry of gaussoids (2019)
  4. Heule, Marijn J. H.: Optimal symmetry breaking for graph problems (2019)
  5. Meel, Kuldeep S.; Shrotri, Aditya A.; Vardi, Moshe Y.: Not all FPRASs are equal: demystifying FPRASs for DNF-counting (2019)
  6. Avni, Guy; Goel, Shubham; Henzinger, Thomas A.; Rodriguez-Navas, Guillermo: Computing scores of forwarding schemes in switched networks with probabilistic faults (2017)
  7. Lagniez, Jean-Marie; Marquis, Pierre: On preprocessing techniques and their impact on propositional model counting (2017)
  8. Previti, Alessandro; Mencía, Carlos; Järvisalo, Matti; Marques-Silva, Joao: Improving MCS enumeration via caching (2017)
  9. Toda, Takahisa: Dualization of Boolean functions using ternary decision diagrams (2017)
  10. Wang, Jinyan; Yin, Minghao; Wu, Jingli: Two approximate algorithms for model counting (2017)
  11. Zulkoski, Edward; Bright, Curtis; Heinle, Albert; Kotsireas, Ilias; Czarnecki, Krzysztof; Ganesh, Vijay: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (2017)
  12. Cuong, C. K.; Heule, M. J. H.: Computing maximum unavoidable subgraphs using SAT solvers (2016)
  13. Mengel, Stefan: Parameterized compilation lower bounds for restricted CNF-formulas (2016)
  14. Tsuiki, Hideki; Tsukamoto, Yasuyuki: Sudoku colorings of a 16-cell pre-fractal (2016)
  15. Aziz, Rehan Abdul; Chu, Geoffrey; Muise, Christian; Stuckey, Peter: (#\existsSAT): projected model counting (2015)
  16. Burchard, Jan; Schubert, Tobias; Becker, Bernd: Laissez-faire caching for parallel #SAT solving (2015)
  17. Douglass, Adam; King, Andrew D.; Raymond, Jack: Constructing SAT filters with a quantum annealer (2015)
  18. Wang, Jinyan; Yin, Minghao; Wu, Jingli: Approximate model counting via extension rule (2015)
  19. Zulkoski, Edward; Ganesh, Vijay; Czarnecki, Krzysztof: MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers (2015)
  20. Castaño, José M.; Castaño, Rodrigo: A finite state intersection approach to propositional satisfiability (2012)

1 2 next