Abstract
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.
Chapter PDF
References
Angelsmark, O., Jonsson, P.: Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 81–95. Springer, Heidelberg (2003)
Dahllöf, V., Jonsonn, P., Wahlström, M.: Counting models for 2SAT and 3SAT formulae. J. Theoretical Computer Sciences 332(1-3), 265–291 (2005)
Darwiche, A.: On the Tractability of Counting Theory Models and its Application to Belief Revision and Truth Maintenance. J. of Applied Non-classical Logics 11(1-2), 11–34 (2001)
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)
De Ita, G., Bello, P., Contreras, M.: New Polynomial Classes for #2SAT Established via Graph-Topological Structure. Engineering Letters 15(2), 250–258 (2007)
Dubois, O.: Counting the number of solutions for instances of satisfiability. J. Theoretical Computer Sciences 81(1), 49–64 (1991)
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)
Littman, M.L., Pitassi, T., Impagliazzo, R.: On the Complexity of counting satisfying assignments. Technical Report Unpublished manuscript
Roth, D.: On the hardness of approximate reasoning. J. Artificial Intelligence 82, 273–302 (1996)
Russ, B.: Randomized Algorithms: Approximation, Generation, and Counting, Distingished dissertations. Springer (2001)
Zhang, W.: Number of models and satisfiability of set of clauses. J. Theoretical Computer Sciences 155(1), 277–288 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Ita, G., Bello, P., Contreras, M. (2013). Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT. In: Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Rodríguez, J.S., di Baja, G.S. (eds) Pattern Recognition. MCPR 2013. Lecture Notes in Computer Science, vol 7914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38989-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-38989-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38988-7
Online ISBN: 978-3-642-38989-4
eBook Packages: Computer ScienceComputer Science (R0)