Abstract
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degree of belief and reasoning in Bayesian networks, are computationally equivalent to model counting. It has been shown that model counting in even the most restrictive logics, such as Horn logic, monotone CNF and 2CNF, is intractable in the worst-case. Moreover, even approximate model counting remains a worst-case intractable problem. So far, most practical model counting algorithms are based on backtrack style algorithms such as the DPLL procedure. These algorithms typically yield exact counts but are limited to relatively small formulas. Our ApproxCount algorithm is based on SampleSat, a new algorithm that samples from the solution space of a propositional logic formula near-uniformly. We provide experimental results for formulas from a variety of domains. The algorithm produces good estimates for formulas much larger than those that can be handled by existing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayardo Jr., R.J., Pehoushek, J.D.: Counting Models Using Connected Components. In: Proc. AAAI 2000 (2000)
Birnbaum, E., Lozinskii, E.L.: The Good Old Davis-Putnam Procedure Helps Counting Models. Journal of Artificial Intelligence Research 10, 457–477 (1999)
Darwiche, A.: A Compiler for Deterministic, Decomposable Negation Normal Form. In: Proc. AAAI 2002 (2002)
Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Communications of the ACM 5, 394–397 (1962)
Hoos, H.H., Stützle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I.P., von Maaren, H., Walsh, T. (eds.) SAT 2000, pp. 283–292. IOS Press, Amsterdam (2000), SATLIB is available online at www.satlib.org
Huang, J., Darwiche, A.: Using DPLL for Efficient OBDD Construction. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 157–172. Springer, Heidelberg (2005)
Jerrum, M.R., Valiant, L.G., Vazirani, V.V.: Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43, 169–188 (1986)
Kautz, H., Selman, B.: Planning as Satisfiability. In: Proceedings ECAI 1992 (1992)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Engineering a Highly Efficient SAT Solver. In: 38th Design Autom. Conference, DAC 2001 (2001)
Papadimitriou, C.H.: On Selecting a Satisfying Truth Assignment. In: Proceedings of the Conference on the Foundations of Computer Science, pp. 163–169 (1991)
Roth, D.: On the Hardness of Approximate Reasoning. Artificial Intelligence 82, 273–302 (1996)
Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining Component Caching and Clause Learning for Effective Model Counting. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
Selman, B., Kautz, H., Cohen, B.: Local Search Strategies for Satisfiability Testing. In: 2nd DIMACS Challenge on Cliques, Coloring and Satisfiability (1994)
Toba, S.: PP is as Hard as the Polynomial-Time Hierarchy. SIAM Journal on Computing 20(5), 865–877 (1991)
Valiant, L.G.: The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8(3), 410–421 (1979)
Velev, M.N., Bryant, R.E.: Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. Journal of Symbolic Computation 35(2), 73–106 (2003)
Wei, W., Erenrich, J., Selman, B.: Towards Efficient Sampling: Exploiting Random Walk Strategies. In: Proc. AAAI 2004 (2004)
Wei, W., Selman, B.: Accelerating Random Walks. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 216. Springer, Heidelberg (2002)
SAT Competition, http://www.satcompetition.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, W., Selman, B. (2005). A New Approach to Model Counting. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_24
Download citation
DOI: https://doi.org/10.1007/11499107_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26276-3
Online ISBN: 978-3-540-31679-4
eBook Packages: Computer ScienceComputer Science (R0)