Heuristics for fast exact model counting
From MaRDI portal
Recommendations
Cited in
(19)- New width parameters for model counting
- On probabilistic inference by weighted model counting
- Solving projected model counting by utilizing treewidth and its limits
- Laissez-faire caching for parallel \#SAT solving
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Logical Compilation of Bayesian Networks with Discrete Variables
- Weighted model counting on the GPU by exploiting small treewidth
- Solving and sampling with many solutions: satisfiability and other hard problems
- Robust planning with incomplete domain models
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- On the power of clause-learning SAT solvers as resolution engines
- SampleSearch: importance sampling in presence of determinism
- Leveraging belief propagation, backtrack search, and statistics for model counting
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- On approximability of propositional model counting
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- A new probabilistic constraint logic programming language based on a generalised distribution semantics
This page was built for publication: Heuristics for fast exact model counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713713)