sharpSAT

swMATH16713MaRDI QIDQ28582FDOQ28582

Author name not available (Why is that?)

Cited In (31)

• Not all FPRASs are equal: demystifying FPRASs for DNF-counting
• Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
• Counting minimal unsatisfiable subsets
• Quantifying software reliability via model-counting
• On preprocessing techniques and their impact on propositional model counting
• Model counting with error-correcting codes
• Optimal symmetry breaking for graph problems
• Sudoku colorings of a 16-cell pre-fractal
• Computing scores of forwarding schemes in switched networks with probabilistic faults
• Lifted Reasoning for Combinatorial Counting
• Taming high treewidth with abstraction, nested dynamic programming, and database technology
• Solving projected model counting by utilizing treewidth and its limits
• Parameterized compilation lower bounds for restricted CNF-formulas
• Computing maximum unavoidable subgraphs using SAT solvers
• The geometry of gaussoids
• A finite state intersection approach to propositional satisfiability
• Construction methods for gaussoids.
• Feasibility analysis for robustness quantification by symbolic model checking
• Improving MCS enumeration via caching
• Lower bounds on the degree of block ciphers
• Definability for model counting
• Constructing SAT filters with a quantum annealer
• Variable and clause ordering in an FSA approach to propositional satisfiability
• Approximate model counting via extension rule
• Title not available (Why is that?)
• \(\#{\exists}\mathrm{SAT}\): projected model counting
• Two approximate algorithms for model counting
• Dualization of Boolean functions using ternary decision diagrams
• MathCheck: a math assistant via a combination of computer algebra systems and SAT solvers
• A study of symmetry breaking predicates and model counting
• Laissez-faire caching for parallel \#SAT solving

This page was built for software: sharpSAT