@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{PMY25,
  title={Towards Real-Time Approximate Counting},
  booktitle=AAAI,
  author={Pote, Yash and Meel, Kuldeep S. and Yang, JIong},
  abstract={
    Model counting is the task of counting the number of satisfying assignments
    of a Boolean formula. Since counting is intractable in general, most
    applications use $(\varepsilon, \delta)$-approximations, where the output is
    within a $(1+\varepsilon)$-factor of the count with probability at least
    $1-\delta$. Many demanding applications make thousands of counting queries,
    and the state-of-the-art approximate counter, \textsc{ApproxMC}, makes
    hundreds of calls to SAT solvers to answer a single approximate counting
    query. The sheer number of SAT calls, poses a significant challenge to the
    existing approaches. In this work, we propose an approximation scheme,
    \textsc{ApproxMC7}, that is tailored to such demanding applications with low
    time limits. Compared to \textsc{ApproxMC}, \textsc{ApproxMC7} makes
    $14\times$ fewer SAT calls while providing the same guarantees as
    \textsc{ApproxMC} in the constant-factor regime. In an evaluation over 2,247
    instances, \textsc{ApproxMC7} solved 271 more and achieved a $2\times$
    speedup against \textsc{ApproxMC}.
  },
  year={2025},
  month=feb,
  bib2html_rescat={Counting},
  bib2html_pubtype={Refereed Conference},
  bib2html_dl_pdf={https://ojs.aaai.org/index.php/AAAI/article/view/33231},
  nameorder={random},
}