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
• Approximate Model Counting via Extension Rule
• Construction methods for gaussoids
• On preprocessing techniques and their impact on propositional model counting
• $$\#\exists $$ SAT: Projected Model Counting
• Model counting with error-correcting codes
• Optimal symmetry breaking for graph problems
• Parameterized Compilation Lower Bounds for Restricted CNF-Formulas
• MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers
• 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
• Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability
• Laissez-Faire Caching for Parallel #SAT Solving
• The geometry of gaussoids
• A finite state intersection approach to propositional satisfiability
• Feasibility analysis for robustness quantification by symbolic model checking
• Improving MCS enumeration via caching
• Sudoku Colorings of a 16-Cell Pre-fractal
• Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults
• Computing Maximum Unavoidable Subgraphs Using SAT Solvers
• Lower bounds on the degree of block ciphers
• A Study of Symmetry Breaking Predicates and Model Counting
• Definability for model counting
• Title not available (Why is that?)
• Two approximate algorithms for model counting
• Dualization of Boolean functions using ternary decision diagrams
• Constructing SAT Filters with a Quantum Annealer

This page was built for software: sharpSAT