Algorithms for Propositional Model Counting
From MaRDI portal
Publication:3498488
DOI10.1007/978-3-540-75560-9_35zbMATH Open1137.68623OpenAlexW2069680070MaRDI QIDQ3498488FDOQ3498488
Authors: Marko Samer, Stefan Szeider 
Publication date: 15 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_35
Recommendations
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph minors. X: Obstructions to tree-decomposition
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- The complexity of computing the permanent
- Linear time solvable optimization problems on graphs of bounded clique-width
- Counting truth assignments of formulas of bounded tree-width or clique-width
- Parametrized complexity theory.
- Approximating clique-width and branch-width
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conjunctive-query containment and constraint satisfaction
- Constraint solving via fractional edge covers
- Hypertree decompositions and tractable queries
- Treewidth. Computations and approximations
- On the hardness of approximate reasoning
- Faster integer multiplication
- Title not available (Why is that?)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Treewidth: computational experiments
- SOFSEM 2005: Theory and Practice of Computer Science
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Constraint Satisfaction with Bounded Treewidth Revisited
- Solving #SAT Using Vertex Covers
- Memory requirements for table computations in partial \(k\)-tree algorithms
Cited In (20)
- Hypergraph acyclicity and propositional model counting
- On the expressive power of CNF formulas of bounded tree- and clique-width
- Solving \#SAT using extension rules
- On preprocessing techniques and their impact on propositional model counting
- Volume Computation for Boolean Combination of Linear Arithmetic Constraints
- Constraint satisfaction with bounded treewidth revisited
- Solving projected model counting by utilizing treewidth and its limits
- Solving \#SAT using vertex covers
- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
- Reconstructive algorithm based on extension rule for solving \#SAT incrementally
- Counting propositional models
- Algorithms for propositional model counting
- Counting models for 2SAT and 3SAT formulae
- A bottom-up algorithm for solving \#2SAT
- Counting solutions to CSP using generating polynomials
- An exhaustive DPLL algorithm for model counting
- \#SAT solving algorithms based on extension rule using heuristic strategies
- Complexity and Algorithms for Well-Structured k-SAT Instances
- Two approximate algorithms for model counting
- Leveraging belief propagation, backtrack search, and statistics for model counting
This page was built for publication: Algorithms for Propositional Model Counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498488)
