ProCount: weighted projected model counting with graded project-join trees
From MaRDI portal
Publication:2118296
DOI10.1007/978-3-030-80223-3_11OpenAlexW3184163263MaRDI QIDQ2118296FDOQ2118296
Authors: Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_11
Recommendations
- Exploiting treewidth for projected model counting and its limits
- Projected model counting: beyond independent support
- Solving projected model counting by utilizing treewidth and its limits
- Exploiting structure in weighted model counting approaches to probabilistic inference
- On probabilistic inference by weighted model counting
- Fast and flexible probabilistic model counting
- scientific article; zbMATH DE number 7378698
- A new probabilistic algorithm for approximate model counting
- Treewidth and counting projected answer sets
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Machine learning. A probabilistic perspective
- Graph-Based Algorithms for Boolean Function Manipulation
- Graph minors. X: Obstructions to tree-decomposition
- Random generation of combinatorial structures from a uniform distribution
- Which problems have strongly exponential complexity?
- Algorithms for propositional model counting
- SATzilla: portfolio-based algorithm selection for SAT
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Title not available (Why is that?)
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Treewidth: computational experiments
- Solving \#SAT and Bayesian inference with backtracking search
- Bucket elimination: A unifying framework for reasoning
- DYNAMIC PROGRAMMING AND A NEW FORMALISM IN THE THEORY OF INTEGRAL EQUATIONS
- Symbolic techniques in satisfiability solving
- Title not available (Why is that?)
- Exploiting structure in quantified formulas
- Ordered Binary Decision Diagrams and the Davis-Putnam procedure
- Exploiting treewidth for projected model counting and its limits
- Positive-instance driven dynamic programming for treewidth
- Graph bisection with Pareto optimization
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- Expansion-based QBF solving on tree decompositions
Cited In (3)
Uses Software
This page was built for publication: ProCount: weighted projected model counting with graded project-join trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118296)
