sharpSAT
From MaRDI portal
Software:28582
No author found.
Related Items (31)
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ On preprocessing techniques and their impact on propositional model counting ⋮ A Study of Symmetry Breaking Predicates and Model Counting ⋮ Quantifying software reliability via model-counting ⋮ Counting minimal unsatisfiable subsets ⋮ Approximate Model Counting via Extension Rule ⋮ Laissez-Faire Caching for Parallel #SAT Solving ⋮ Constructing SAT Filters with a Quantum Annealer ⋮ $$\#\exists $$ SAT: Projected Model Counting ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ Taming high treewidth with abstraction, nested dynamic programming, and database technology ⋮ Improving MCS enumeration via caching ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Sudoku Colorings of a 16-Cell Pre-fractal ⋮ Lower bounds on the degree of block ciphers ⋮ Unnamed Item ⋮ A finite state intersection approach to propositional satisfiability ⋮ Feasibility analysis for robustness quantification by symbolic model checking ⋮ Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults ⋮ Two approximate algorithms for model counting ⋮ Dualization of Boolean functions using ternary decision diagrams ⋮ Model counting with error-correcting codes ⋮ Not all FPRASs are equal: demystifying FPRASs for DNF-counting ⋮ Optimal symmetry breaking for graph problems ⋮ Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability ⋮ Definability for model counting ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas ⋮ Computing Maximum Unavoidable Subgraphs Using SAT Solvers ⋮ The geometry of gaussoids ⋮ Construction methods for gaussoids ⋮ Lifted Reasoning for Combinatorial Counting
This page was built for software: sharpSAT
