@COMMENT This file was generated by bib2html.pl <https://sourceforge.net/projects/bib2html/> version 0.94
@COMMENT written by Patrick Riley <http://sourceforge.net/users/patstg/>
@COMMENT This file came from Kuldeep S. Meel's publication pages at
@COMMENT http://www.comp.nus.edu.sg/~meel/publications/
@inproceedings{CMV13b,
	title={A Scalable Approximate Model Counter},
	bib2html_dl_pdf={../Papers/CP2013.pdf},
  code={https://bitbucket.org/kuldeepmeel/approxmc},
  author={Chakraborty, Supratik and Meel, Kuldeep S. and Vardi, Moshe Y.},
	booktitle=CP,
	pages={200--216},
	year={2013},
	month=sep,
    bib2html_rescat={Counting},
	note={Selected for CP 25th Anniversary Volume},
  bib2html_pubtype={Refereed Conference,Award Winner},
abstract={
Propositional model counting (#SAT), i.e., counting the number
of satisfying assignments of a propositional formula, is a problem of
significant theoretical and practical interest. Due to the inherent complexity
of the problem, approximate model counting, which counts the
number of satisfying assignments to within given tolerance and confi-
dence level, was proposed as a practical alternative to exact model counting.
Yet, approximate model counting has been studied essentially only
theoretically. The only reported implementation of approximate model
counting, due to Karp and Luby, worked only for DNF formulas. A few
existing tools for CNF formulas are bounding model counters; they can
handle realistic problem sizes, but fall short of providing counts within
given tolerance and confidence, and, thus, are not approximate model
counters.
We present here a novel algorithm, as well as a reference implementation,
that is the first scalable approximate model counter for CNF formulas.
The algorithm works by issuing a polynomial number of calls to a SAT
solver. Our tool, ApproxMC, scales to formulas with tens of thousands
of variables. Careful experimental comparisons show that ApproxMC reports,
with high confidence, bounds that are close to the exact count,
and also succeeds in reporting bounds with small tolerance and high
confidence in cases that are too large for computing exact model counts.
},
}