Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT
To count models for two conjunctive forms (#2SAT problem) is a classic #P problem. We determine different structural patterns on the underlying graph of a 2-CF F allowing the efficient computation of #2SAT(F).
We show that if the constrained graph of a formula is acyclic or the cycles on the graph can be arranged as independent and embedded cycles, then the number of models of F can be counted efficiently.
Keywords#SAT Problem Counting models Structural Patterns Graph Topologies
- 4.De Ita, G., Tovar, M.: Applying Counting Models of Boolean Formulas to Propositional Inference. J. Advances in Computer Science and Engineering Researching in Computing Science 19, 159–170 (2006)Google Scholar
- 5.De Ita, G., Bello, P., Contreras, M.: New Polynomial Classes for #2SAT Established via Graph-Topological Structure. Engineering Letters 15(2), 250–258 (2007)Google Scholar
- 7.Fürer, M., Prasad, S.K.: Algorithms for Counting 2-SAT Solutions and Coloring with Applications. Technical Report No. 33, Electronic Colloqium on Comp. Complexity (2005)Google Scholar
- 8.Littman, M.L., Pitassi, T., Impagliazzo, R.: On the Complexity of counting satisfying assignments. Technical Report Unpublished manuscriptGoogle Scholar
- 10.Russ, B.: Randomized Algorithms: Approximation, Generation, and Counting, Distingished dissertations. Springer (2001)Google Scholar