Cited in
(53)- On preprocessing techniques and their impact on propositional model counting
- Parameterized compilation lower bounds for restricted CNF-formulas
- Computing maximum unavoidable subgraphs using SAT solvers
- Constructing SAT filters with a quantum annealer
- GANAK
- Counting minimal unsatisfiable subsets
- Quantifying software reliability via model-counting
- Construction methods for gaussoids.
- Lifted Reasoning for Combinatorial Counting
- Improving MCS enumeration via caching
- Sudoku colorings of a 16-cell pre-fractal
- Definability for model counting
- Variable and clause ordering in an FSA approach to propositional satisfiability
- Computing scores of forwarding schemes in switched networks with probabilistic faults
- The geometry of gaussoids
- MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- A finite state intersection approach to propositional satisfiability
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- SBSAT
- CPGraph
- FORCE
- RunLim
- dynASP
- AMUSE
- MUSer2
- Lynx
- MathCheck
- BEACON
- Coprocessor
- PLASMA
- MayBMS
- FeatureIDE
- SageSAT
- htd
- Shatter
- FatTire
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- Hailfinder
- countAntom
- Solving projected model counting by utilizing treewidth and its limits
- Dsharp
- Approximate model counting via extension rule
- Two approximate algorithms for model counting
- Feasibility analysis for robustness quantification by symbolic model checking
- Dualization of Boolean functions using ternary decision diagrams
- Model counting with error-correcting codes
- Optimal symmetry breaking for graph problems
- A study of symmetry breaking predicates and model counting
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Lower bounds on the degree of block ciphers
- scientific article; zbMATH DE number 7378698 (Why is no real title available?)
- Laissez-faire caching for parallel \#SAT solving
This page was built for software: sharpSAT
