Solving projected model counting by utilizing treewidth and its limits
From MaRDI portal
Publication:2680775
Recommendations
- Exploiting treewidth for projected model counting and its limits
- Treewidth and counting projected answer sets
- A faster algorithm for propositional model counting parameterized by incidence treewidth
- Model counting for CNF formulas of bounded modular treewidth
- Model counting for CNF formulas of bounded modular treewidth
- Counting and Enumeration Problems with Bounded Treewidth
- Theory and Applications of Satisfiability Testing
- Model counting: a new stategy for obtaining good bounds
- Algorithms for Propositional Model Counting
- Algorithms for propositional model counting
Cites work
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A trichotomy in the complexity of counting answers to conjunctive queries
- Algorithms for propositional model counting
- An Experimental Study of the Treewidth of Real-World Graph Data
- Answer set solving with bounded treewidth revisited
- Bayesian Networks
- Clingo
- Combining treewidth and backdoors for CSP
- Counting and Enumeration Problems with Bounded Treewidth
- Counting Answers to Existential Questions
- Detecting inconsistencies in large biological networks with answer set programming
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Even faster integer multiplication
- Exploiting treewidth for projected model counting and its limits
- Fundamentals of parameterized complexity
- Graph theory
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1249705 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2021556 (Why is no real title available?)
- scientific article; zbMATH DE number 1470716 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3247139 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Implementing efficient All solutions SAT solvers
- Introduction to Information Retrieval
- Laissez-faire caching for parallel \#SAT solving
- Lower Bounds for QBFs of Bounded Treewidth
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Multi-shot ASP solving with clingo
- On the hardness of approximate reasoning
- Parameterized algorithms
- Parametrized complexity theory.
- Positive-instance driven dynamic programming for treewidth
- Practical access to dynamic programming on tree decompositions
- Probabilistic planning via heuristic forward search and weighted model counting
- ProCount: weighted projected model counting with graded project-join trees
- sharpSAT
- Solution Enumeration for Projected Boolean Search Problems
- Solving #SAT and MAXSAT by Dynamic Programming
- Subtractive reductions and complete problems for counting complexity classes
- Taming high treewidth with abstraction, nested dynamic programming, and database technology
- The Complexity of Enumeration and Reliability Problems
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Tractable QBF by knowledge compilation
- Treewidth and counting projected answer sets
- Treewidth with a quantifier alternation revisited
- Which problems have strongly exponential complexity?
Cited in
(9)- ProCount: weighted projected model counting with graded project-join trees
- New perspectives on semiring applications to dynamic programming
- Dynamic blocked clause elimination for projected model counting
- Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
- Reducing treewidth for SAT-related problems using simple liftings
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
- Structure-guided automated reasoning
- The relative strength of \#SAT proof systems
- Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
This page was built for publication: Solving projected model counting by utilizing treewidth and its limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680775)
