Algorithms for propositional model counting
From MaRDI portal
Publication:2266937
DOI10.1016/j.jda.2009.06.002zbMath1214.05166MaRDI QIDQ2266937
Publication date: 26 February 2010
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2009.06.002
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming, Satisfiability of acyclic and almost acyclic CNF formulas, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Backdoors to Satisfaction, Satisfiability of Acyclic and almost Acyclic CNF Formulas (II), Community Structure Inspired Algorithms for SAT and #SAT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- Hypertree decompositions and tractable queries
- A unified theory of structural tractability for constraint satisfaction problems
- Graph minors. X: Obstructions to tree-decomposition
- Treewidth. Computations and approximations
- Memory requirements for table computations in partial \(k\)-tree algorithms
- Conjunctive-query containment and constraint satisfaction
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Complexity of generalized satisfiability counting problems
- Linear time solvable optimization problems on graphs of bounded clique-width
- Solving \#SAT using vertex covers
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Parametrized complexity theory.
- Fast multiplication of large numbers
- On the hardness of approximate reasoning
- Algorithms for Propositional Model Counting
- Constraint Satisfaction with Bounded Treewidth Revisited
- Constraint solving via fractional edge covers
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- SOFSEM 2005: Theory and Practice of Computer Science
- Finding Branch-Decompositions and Rank-Decompositions
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
