Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra

Model counting is the #P problem of counting the number of satisfying solutions of a given propositional formula. Here we focus on a restricted variant of this problem, where the input formula is monotone i.e., there are no negations. A monotone conjunctive normal formCNF formula is sufficient for modeling various graph problems, e.g., the vertex covers of a graph. Even for this restricted case, there is no known efficient approximation scheme. We show that the classical Spectra technique that is widely used in network reliability can be adapted for counting monotone CNF formulas. We prove that the proposed algorithm is logarithmically efficient for random monotone 2-CNF instances. Although we do not prove the efficiency of Spectra for k-CNF where k > 2, our experiments show that it is effective in practice for such formulas.

[1]  Reuven Y. Rubinstein,et al.  Fast Sequential Monte Carlo Methods for Counting and Optimization , 2013 .

[2]  Vibhav Gogate,et al.  Approximate Counting by Sampling the Backtrack-free Search Space , 2007, AAAI.

[3]  Yoseph Shpungin,et al.  Network Reliability and Resilience , 2011, Springer Briefs in Electrical and Computer Engineering.

[4]  Yuguo Chen,et al.  Sequential Monte Carlo Methods for Statistical Analysis of Tables , 2005 .

[5]  Lin Lin,et al.  A Self-controlled Genetic Algorithm for Reliable Communication Network Design , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[6]  F. Sibel Salman,et al.  Assessing the reliability and the expected performance of a network under disaster risk , 2011, OR Spectr..

[7]  Dirk P. Kroese,et al.  Handbook of Monte Carlo Methods , 2011 .

[8]  Reuven Y. Rubinstein,et al.  The Splitting Method for Decision Making , 2012, Commun. Stat. Simul. Comput..

[9]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[10]  Ilya Gertsbakh,et al.  Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo , 2009 .

[11]  Bart Selman,et al.  A New Approach to Model Counting , 2005, SAT.

[12]  Gerardo Rubino,et al.  Rare Event Simulation using Monte Carlo Methods , 2009 .

[13]  Vibhav Gogate,et al.  A New Algorithm for Sampling CSP Solutions Uniformly at Random , 2006, CP.

[14]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[15]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[16]  Dirk P. Kroese,et al.  Efficient Monte Carlo simulation via the generalized splitting method , 2012, Stat. Comput..

[17]  Luca Podofillini,et al.  Optimal design of reliable network systems in presence of uncertainty , 2005, IEEE Transactions on Reliability.

[18]  Peter W. Glynn,et al.  Stochastic Simulation: Algorithms and Analysis , 2007 .

[19]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[20]  Lars Elistrup Rasmussen.  Approximately counting cliques , 1997 .

[21]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[22]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.

[23]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[24]  Jose Emmanuel Ramirez-Marquez,et al.  Two-terminal reliability analyses for a mobile ad hoc wireless network , 2007, Reliab. Eng. Syst. Saf..

[25]  Martin E. Dyer,et al.  On counting independent sets in sparse graphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[26]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[27]  Daniel Rudoy,et al.  Rare Event Simulation and Counting Problems , 2009, Rare Event Simulation using Monte Carlo Methods.

[28]  R. Rubinstein.  The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling , 2009 .

[29]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics) , 1981 .

[30]  Martin E. Dyer,et al.  Approximate counting by dynamic programming , 2003, STOC '03.

[31]  Béla Bollobás,et al.  Random Graphs , 1985 .

[32]  R. Rubinstein.  Stochastic Enumeration Method for Counting NP-Hard Problems , 2013 .

[33]  Salil P. Vadhan,et al.  The Complexity of Counting in Sparse, Regular, and Planar Graphs , 2002, SIAM J. Comput..

[34]  Philip Heidelberger,et al.  Fast simulation of rare events in queueing and reliability models , 1993, TOMC.

[35]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[36]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..