ProCount: weighted projected model counting with graded project-join trees
type: Item
instance of: scholarly article
title: ProCount: weighted projected model counting with graded project-join trees
DOI: 10.1007/978-3-030-80223-3_11
author: Jeffrey M. Dudek
author: Vu H. N. Phan
author: Moshe Y. Vardi
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7495571
describes a project that uses: PMTK
describes a project that uses: DRAT-trim
describes a project that uses: GANAK
describes a project that uses: Sylvan
describes a project that uses: SATzilla
describes a project that uses: htd
MaRDI profile type: Publication
full work available at URL: 978-3-030-80223-3 11
OpenAlex ID: W3184163263
cites work: Q4475626
cites work: $$\#\exists $$ SAT: Projected Model Counting
cites work: Q3624187
cites work: DYNAMIC PROGRAMMING AND A NEW FORMALISM IN THE THEORY OF INTEGRAL EQUATIONS
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Expansion-based QBF Solving on Tree Decompositions*
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Exploiting treewidth for projected model counting and its limits
cites work: Graph Bisection with Pareto Optimization
cites work: Taming high treewidth with abstraction, nested dynamic programming, and database technology
cites work: Which problems have strongly exponential complexity?
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Treewidth: computational experiments
cites work: Machine learning. A probabilistic perspective
cites work: Symbolic techniques in satisfiability solving
cites work: Q5715665
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Algorithms for propositional model counting
cites work: Exploiting structure in quantified formulas
cites work: Positive-instance driven dynamic programming for treewidth
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Ordered Binary Decision Diagrams and the Davis-Putnam procedure
cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
cites work: Q3624141
Recommended article: Exploiting treewidth for projected model counting and its limits
Recommended article: Projected model counting: beyond independent support
Recommended article: Solving projected model counting by utilizing treewidth and its limits
Recommended article: Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Recommended article: On probabilistic inference by weighted model counting
Recommended article: Fast and flexible probabilistic model counting
Recommended article: Q5009587
Recommended article: A new probabilistic algorithm for approximate model counting
Recommended article: Treewidth and counting projected answer sets
description: scientific article; zbMATH DE number 7495571