Document Open Access Logo

On Hashing-Based Approaches to Approximate DNF-Counting

Authors Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi

PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2017.41.pdf
  • Filesize: 0.59 MB
  • 14 pages

Document Identifiers

Author Details

Kuldeep S. Meel
Aditya A. Shrotri
Moshe Y. Vardi

Cite As Get BibTex

Kuldeep S. Meel, Aditya A. Shrotri, and Moshe Y. Vardi. On Hashing-Based Approaches to Approximate DNF-Counting. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 93, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.FSTTCS.2017.41

Abstract

Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncertainty, and
probabilistic databases. Consequently, the problem is of theoretical as well as practical interest. When the constraints are expressed as DNF formulas, Monte Carlo-based techniques have been shown to provide a fully polynomial randomized approximation scheme (FPRAS). For CNF constraints, hashing-based approximation techniques have been demonstrated to be highly successful. Furthermore, it was shown that hashing-based techniques also yield an FPRAS for DNF counting without usage of Monte Carlo sampling. Our analysis, however, shows that the proposed hashing-based approach to DNF counting provides poor time complexity compared to the Monte Carlo-based DNF counting techniques. Given the success of hashing-based techniques for CNF constraints, it is natural to ask: Can hashing-based techniques provide an efficient FPRAS for DNF counting? In this paper, we provide a positive answer to this question. To this end, we introduce two novel algorithmic techniques: Symbolic Hashing and Stochastic Cell Counting, along
with a new hash family of Row-Echelon hash functions. These innovations allow us to design a hashing-based FPRAS for DNF counting of similar complexity (up to polylog factors) as that
of prior works. Furthermore, we expect these techniques to have potential applications beyond DNF counting.

Subject Classification

Keywords
  • Model Counting
  • Approximation
  • DNF
  • Hash Functions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Fahiem Bacchus, Shannon Dalmao, and Toniann Pitassi. Algorithms and complexity results for #sat and bayesian inference. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 340-351. IEEE Computer Society, 2003. URL: http://dx.doi.org/10.1109/SFCS.2003.1238208.
  2. J Lawrence Carter and Mark N Wegman. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106-112. ACM, 1977. Google Scholar
  3. S. Chakraborty, K. S. Meel, and M. Y. Vardi. A scalable approximate model counter. In Proc. of CP, pages 200-216, 2013. Google Scholar
  4. S. Chakraborty, K. S. Meel, and M. Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Proc. of IJCAI, 2016. Google Scholar
  5. Paul Dagum, Richard Karp, Michael Luby, and Sheldon Ross. An optimal algorithm for monte carlo estimation. SIAM Journal on computing, 29(5):1484-1496, 2000. Google Scholar
  6. Nilesh Dalvi and Dan Suciu. Efficient query evaluation on probabilistic databases. The VLDB Journal—The International Journal on Very Large Data Bases, 16(4):523-544, 2007. Google Scholar
  7. C. Domshlak and J. Hoffmann. Probabilistic planning via heuristic forward search and weighted model counting. Journal of Artificial Intelligence Research, 30(1):565-620, 2007. Google Scholar
  8. Leonardo Duenas-Osorio, Kuldeep S Meel, Roger Paredes, and Moshe Y Vardi. Counting-based reliability estimation for power-transmission grids. In AAAI, pages 4488-4494, 2017. Google Scholar
  9. S. Ermon, C. P. Gomes, A. Sabharwal, and B. Selman. Low-density parity constraints for hashing-based discrete integration. In Proc. of ICML, pages 271-279, 2014. Google Scholar
  10. Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, and Bart Selman. Taming the curse of dimensionality: Discrete integration by hashing and optimization. In Proc. of ICML, pages 334-342, 2013. Google Scholar
  11. V. Gogate and R. Dechter. Approximate counting by sampling the backtrack-free search space. In Proc. of the AAAI, volume 22, page 198, 2007. Google Scholar
  12. C. P. Gomes, J. Hoffmann, A. Sabharwal, and B. Selman. Short XORs for Model Counting; From Theory to Practice. In SAT, pages 100-106, 2007. Google Scholar
  13. C. P. Gomes, A. Sabharwal, and B. Selman. Model counting: A new strategy for obtaining good bounds. In Proc. of AAAI, volume 21, pages 54-61, 2006. Google Scholar
  14. Frank Gray. Pulse code communication, 17 1953. US Patent 2,632,058. Google Scholar
  15. Alexander Ivrii, Sharad Malik, Kuldeep S. Meel, and Moshe Y. Vardi. On computing minimal independent support and its applications to sampling and counting. Constraints, 21(1):41-58, 2016. URL: http://dx.doi.org/10.1007/s10601-015-9204-z.
  16. M.R. Jerrum, L.G. Valiant, and V.V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43(2-3):169-188, 1986. URL: http://portal.acm.org/citation.cfm?id=11534.11537.
  17. R.M. Karp and M. Luby. Monte-carlo algorithms for enumeration and reliability problems. Proc. of FOCS, 1983. Google Scholar
  18. R.M. Karp, M. Luby, and N. Madras. Monte-Carlo approximation algorithms for enumeration problems. Journal of Algorithms, 10(3):429-448, 1989. Google Scholar
  19. Donald E Knuth. Generating all n-tuples. The Art of Computer Programming, 4, 2004. Google Scholar
  20. James D Park and Adnan Darwiche. Complexity results and approximation strategies for map explanations. Journal of Artificial Intelligence Research, pages 101-133, 2006. Google Scholar
  21. Dan Roth. On the hardness of approximate reasoning. Artif. Intell., 82(1-2):273-302, 1996. URL: http://dx.doi.org/10.1016/0004-3702(94)00092-1.
  22. T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi. Combining component caching and clause learning for effective model counting. In Proc. of SAT, 2004. Google Scholar
  23. T. Sang, P. Beame, and H. Kautz. Performing bayesian inference by weighted model counting. In Prof. of AAAI, pages 475-481, 2005. Google Scholar
  24. L. Stockmeyer. The complexity of approximate counting. In Proc. of STOC, pages 118-126, 1983. Google Scholar
  25. Gilbert Strang. Introduction to linear algebra, volume 3. Wellesley-Cambridge Press Wellesley, MA, 1993. Google Scholar
  26. S. Toda. On the computational power of PP and (+)P. In Proc. of FOCS, pages 514-519. IEEE, 1989. Google Scholar
  27. L. Trevisan. Lecture notes on computational complexity. Notes written in Fall, 2002. URL: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.9877&rep=rep1&type=pdf.
  28. L.G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact