scientific article; zbMATH DE number 1315584
From MaRDI portal
Publication:4256519
Recommendations
Cited in
(21)- Counting propositional models
- Enumerating models of DNF faster: breaking the dependency on the formula size
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- Counting for satisfiability by inverting resolution
- Phase transitions of PP-complete satisfiability problems
- On the hardness of approximate reasoning
- Learning to select branching rules in the DPLL procedure for satisfiability
- Approximate model counting via extension rule
- scientific article; zbMATH DE number 4087075 (Why is no real title available?)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- Feasibility analysis for robustness quantification by symbolic model checking
- An exhaustive DPLL algorithm for model counting
- Two approximate algorithms for model counting
- Theory and Applications of Satisfiability Testing
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- Algorithms for four variants of the exact satisfiability problem
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- OuterCount: a first-level solution-counter for quantified Boolean formulas
- On enumerating short projected models
- A graphical \#SAT algorithm for formulae with small clause density
- Counting QBF solutions at level two
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256519)
