@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{YM24,
  author={Yang, Suwei and Meel, Kuldeep S.},
  title={Engineering an Exact Pseudo-Boolean Model Counter},
  abstract={
    Model counting, a fundamental task in computer science, involves determining
    the number of
    satisfying assignments to a Boolean formula, typically represented in
    conjunctive normal form (CNF).
    While model counting for CNF formulas has received extensive attention with
    a broad range of applications, the study of model counting for
    Pseudo-Boolean (PB) formulas has been relatively overlooked. Pseudo-Boolean
    formulas, being more succinct than propositional Boolean formulas,
    offer greater flexibility in representing real-world problems. Consequently,
    there is a crucial need to investigate efficient techniques for model
    counting for PB formulas. In this work, we propose the first exact
    Pseudo-Boolean model counter, PBCount , that relies on knowledge compilation
    approach via algebraic decision diagrams. Our extensive empirical evaluation
    shows that PBCount can
    compute counts for 1513 instances while the current state-of-the-art
    approach could only handle 1013 instances. Our work opens up several avenues
    for future work in the context of model counting for PB formulas, such as
    the development of preprocessing techniques and exploration of approaches
    other than knowledge compilation.
  },
  year={2024},
  month=jan,
  booktitle=AAAI,
  bib2html_pubtype={Refereed Conference},
  bib2html_rescat={Solver Engineering, Counting},
  bib2html_dl_pdf={https://ojs.aaai.org/index.php/AAAI/article/view/28660},
}