Abstract
The inclusion-exclusion principle is a well-known mathematical principle used to count the number of elements in the union of a collection of sets in terms of intersections of sub-collections.We present an algorithm for counting the number of solutions of a given k-SAT formula using the inclusion-exclusion principle. The key contribution of our work consists of a novel subsumption pruning technique. Subsumption pruning exploits the alternating structure of the terms involved in the inclusion-exclusion principle to discover term cancellations that can account for the individual contributions of a large number of terms in a single step.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bennett, H., Sankaranarayanan, S.: Model counting using the inclusion-exclusion principle, Draft (available upon request) (2011)
Gomes, C.P., Sabharwal, A., Selman, B.: Model counting. In: Handbook of Satisfiability, ch. 20. IOS Press, Amsterdam (2008)
Iwama, K.: CNF-satisfiability test by counting and polynomial average time. SIAM Journal on Computing 18(2), 385–391 (1989)
Lozinskii, E.L.: Counting propositional models. Information Processing Letters 41, 327–332 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bennett, H., Sankaranarayanan, S. (2011). Model Counting Using the Inclusion-Exclusion Principle. In: Sakallah, K.A., Simon, L. (eds) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011. Lecture Notes in Computer Science, vol 6695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21581-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-21581-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21580-3
Online ISBN: 978-3-642-21581-0
eBook Packages: Computer ScienceComputer Science (R0)