License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2017.41
URN: urn:nbn:de:0030-drops-84073
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8407/
Meel, Kuldeep S. ;
Shrotri, Aditya A. ;
Vardi, Moshe Y.
On Hashing-Based Approaches to Approximate DNF-Counting
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.
BibTeX - Entry
@InProceedings{meel_et_al:LIPIcs:2018:8407,
author = {Kuldeep S. Meel and Aditya A. Shrotri and Moshe Y. Vardi},
title = {{On Hashing-Based Approaches to Approximate DNF-Counting}},
booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
year = {2018},
volume = {93},
editor = {Satya Lokam and R. Ramanujam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8407},
URN = {urn:nbn:de:0030-drops-84073},
doi = {10.4230/LIPIcs.FSTTCS.2017.41},
annote = {Keywords: Model Counting, Approximation, DNF, Hash Functions}
}
|
Keywords: |
|
Model Counting, Approximation, DNF, Hash Functions |
|
Collection: |
|
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
12.02.2018 |
