Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas (2312.15877v1)

Published 26 Dec 2023 in cs.AI and cs.LO

Abstract: In Weighted Model Counting (WMC), we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its literals. The current WMC solvers work on Conjunctive Normal Form (CNF) formulas. However, CNF is not a natural representation for human-being in many applications. Motivated by the stronger expressive power of pseudo-Boolean (PB) formulas than CNF, we propose to perform WMC on PB formulas. Based on a recent dynamic programming algorithm framework called ADDMC for WMC, we implement a weighted PB counting tool PBCounter. We compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD, ExactMC, D4, and ADDMC, where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF formula. The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Quantitative verification of neural networks and its security applications. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pages 1249–1264, 2019.
  2. Counting-based reliability estimation for power-transmission grids. In Proc. of AAAI, 2 2017.
  3. SharpTNI: Counting and sampling parsimonious transmission networks under a weak bottleneck. In Proc. of RECOMB Comparative Genomics, 2019.
  4. Dan Roth. On the hardness of approximate reasoning. Artificial Intelligence, 82:273–302, 1996.
  5. Performing bayesian inference by weighted model counting. In Manuela M. Veloso and Subbarao Kambhampati, editors, Proceedings, The Twentieth National Conference on Artificial Intelligence, pages 475–482. AAAI Press / The MIT Press, 2005.
  6. On probabilistic inference by weighted model counting. Artificial Intelligence, 172(6–7):772–799, 2008.
  7. Probabilistic planning via heuristic forward search and weighted model counting. J. Artif. Intell. Res., 30:565–620, 2007.
  8. Guy Van den Broeck and Dan Suciu. Query processing on probabilistic data: A survey. Foundations and Trends in Databases, 7(3-4):197–341, 2017.
  9. Inference and learning in probabilistic logic programs using weighted boolean formulas. TPLP, 15(3):358–401, 2015.
  10. The power of literal equivalence in model counting. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, pages 3851–3859. AAAI Press, 2021.
  11. Combining component caching and clause learning for effective model counting. In SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 2004.
  12. Marc Thurley. sharpsat - counting models with advanced component caching and implicit BCP. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, 9th, volume 4121 of Lecture Notes in Computer Science, pages 424–429. Springer, 2006.
  13. GANAK: A scalable probabilistic exact model counter. In Sarit Kraus, editor, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, pages 1169–1176. ijcai.org, 2019.
  14. An improved decision-dnnf compiler. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pages 667–673. ijcai.org, 2017.
  15. Addmc: weighted model counting with algebraic decision diagrams. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 1468–1476, 2020.
  16. Taming high treewidth with abstraction, nested dynamic programming, and database technology. In Theory and Applications of Satisfiability Testing–SAT 2020: 23rd International Conference, Alghero, Italy, July 3–10, 2020, Proceedings 23, pages 343–360. Springer, 2020.
  17. Uniform solution sampling using a constraint solver as an oracle. In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, pages 255–264, 2012.
  18. A scalable approximate model counter. In Principles and Practice of Constraint Programming: 19th International Conference, CP 2013, pages 200–216. Springer, 2013.
  19. Fast converging anytime model counting. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 4025–4034, 2023.
  20. Pseudo-boolean constraints from a knowledge representation perspective. In Jérôme Lang, editor, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pages 1891–1897, 2018.
  21. Investigations of graph properties in terms of wireless sensor network optimization. In 2018 IEEE International Conference on Future IoT Technologies (Future IoT), pages 1–8. IEEE, 2018.
  22. Generic ILP versus specialized 0-1 ILP: an update. In Lawrence T. Pileggi and Andreas Kuehlmann, editors, Proceedings of the 2002 IEEE/ACM International Conference on Computer-aided Design, ICCAD 2002, pages 450–457. ACM / IEEE Computer Society, 2002.
  23. Efficient local search for pseudo boolean optimization. In Chu-Min Li and Felip Manyà, editors, Theory and Applications of Satisfiability Testing - SAT 2021 - 24th, volume 12831 of Lecture Notes in Computer Science, pages 332–348. Springer, 2021.
  24. Pbs: a backtrack-search pseudo-boolean solver and optimizer. In Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability, pages 346–353, 2002.
  25. Pueblo: A hybrid pseudo-boolean SAT solver. J. Satisf. Boolean Model. Comput., 2(1-4):165–189, 2006.
  26. Divide and conquer: Towards faster pseudo-boolean solving. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, pages 1291–1299, 2018.
  27. Towards more efficient local search for pseudo-boolean optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
  28. Improving local search for pseudo boolean optimization by fragile scoring function and deep optimization. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023.
  29. New perspectives on flexibility in simple temporal planning. In Proceedings of the International Conference on Automated Planning and Scheduling, volume 28, pages 123–131, 2018.
  30. Exact and approximate probabilistic symbolic execution for nondeterministic programs. In Proceedings of the 29th ACM/IEEE international conference on Automated software engineering, pages 575–586, 2014.
  31. Approximating integer solution counting via space quantification for linear constraints. In IJCAI, pages 1697–1703, 2019.
  32. Decomposition strategies to count integer solutions over linear constraints. In IJCAI, pages 1389–1395, 2021.
  33. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci., 61(2):302–332, 2000.
  34. Symbolic techniques in satisfiability solving. J. Autom. Reason., 35(1-3):25–50, 2005.
  35. Translating pseudo-boolean constraints into SAT. J. Satisf. Boolean Model. Comput., 2(1-4):1–26, 2006.
  36. New encoding for translating pseudo-boolean constraints into SAT. In Alan M. Frisch and Peter Gregory, editors, Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, SARA 2013. AAAI, 2013.
  37. SAT encodings for pseudo-boolean constraints together with at-most-one constraints. Artif. Intell., 302:103604, 2022.
  38. Algebraic decision diagrams and their applications. Formal Methods Syst. Des., 10(2/3):171–206, 1997.
  39. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566–579, 1984.
  40. Treewidth: Computational experiments. Electron. Notes Discret. Math., 8:54–57, 2001.
  41. A new look at bdds for pseudo-boolean constraints. J. Artif. Intell. Res., 45:443–480, 2012.
  42. Integrating tree decompositions into decision heuristics of propositional model counters (short paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021.
  43. Definability for model counting. Artif. Intell., 281:103229, 2020.
  44. Preprocessing for propositional model counting. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pages 2688–2694, 2014.
  45. Tom Van Dijk and Jaco Van de Pol. Sylvan: multi-core framework for decision diagrams. International Journal on Software Tools for Technology Transfer, 19(6):675–696, 2017.
  46. Joost P. Warners. A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett., 68(2):63–69, 1998.
  47. A translation of pseudo boolean constraints to SAT. J. Satisf. Boolean Model. Comput., 2(1-4):191–200, 2006.
  48. Counting models in integer domains. In Armin Biere and Carla P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, 9th, volume 4121 of Lecture Notes in Computer Science, pages 410–423. Springer, 2006.
  49. Exact cover via satisfiability: An empirical study. In David Cohen, editor, Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, volume 6308 of Lecture Notes in Computer Science, pages 297–304. Springer, 2010.
  50. Counting integer points in parametric polytopes using barvinok’s rational functions. Algorithmica, 48:37–66, 2007.
  51. Improving model counting by leveraging definability. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pages 751–757, 2016.
  52. Arjun: An efficient independent support computation technique and its applications to counting and sampling. In Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2022, page 71, 2022.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now