Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Complexity of generalized satisfiability counting problems
Information and Computation
On the hardness of approximate reasoning
Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Constraint Processing
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Solving #SAT using vertex covers
Acta Informatica
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Finding Branch-Decompositions and Rank-Decompositions
SIAM Journal on Computing
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
D-flat: Declarative problem solving using tree decompositions and answer-set programming
Theory and Practice of Logic Programming
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
We present algorithms for the propositional model counting problem #SAT. The algorithms utilize tree decompositions of certain graphs associated with the given CNF formula; in particular we consider primal, dual, and incidence graphs. We describe the algorithms coherently for a direct comparison and with sufficient detail for making an actual implementation reasonably easy. We discuss several aspects of the algorithms including worst-case time and space requirements.