Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 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

Exact ASP Counting with Compact Encodings (2312.11936v1)

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

Abstract: Answer Set Programming (ASP) has emerged as a promising paradigm in knowledge representation and automated reasoning owing to its ability to model hard combinatorial problems from diverse domains in a natural way. Building on advances in propositional SAT solving, the past two decades have witnessed the emergence of well-engineered systems for solving the answer set satisfiability problem, i.e., finding models or answer sets for a given answer set program. In recent years, there has been growing interest in problems beyond satisfiability, such as model counting, in the context of ASP. Akin to the early days of propositional model counting, state-of-the-art exact answer set counters do not scale well beyond small instances. Exact ASP counters struggle with handling larger input formulas. The primary contribution of this paper is a new ASP counting framework, called sharpASP, which counts answer sets avoiding larger input formulas. This relies on an alternative way of defining answer sets that allows for the lifting of key techniques developed in the context of propositional model counting. Our extensive empirical analysis over 1470 benchmarks demonstrates significant performance gain over current state-of-the-art exact answer set counters. Specifically, by using sharpASP, we were able to solve 1062 benchmarks with PAR2 score of 3082 whereas using prior state-of-the-art, we could only solve 895 benchmarks with a PAR2 score of 4205, all other experimental conditions being the same.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Stable model counting and its application in probabilistic logic programming. In AAAI.
  2. Quantitative verification of neural networks and its security applications. In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 1249–1264.
  3. Counting models using connected components. In AAAI/IAAI, 157–162.
  4. Scalable approximation of quantitative information flow in programs. In VMCAI, 71–93. Springer.
  5. Bomanson, J. 2017. lp2normal—A Normalization Tool for Extended Logic Programs. In LPNMR, 222–228.
  6. Diagnosing automatic whitelisting for dynamic remarketing ads using hybrid ASP. In LPNMR, 173–185. Springer.
  7. Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning, 39(4): 471.
  8. Clark, K. L. 1978. Negation as failure. In Logic and data bases, 293–322. Springer.
  9. Darwiche, A. 2002. A compiler for deterministic, decomposable negation normal form. In AAAI/IAAI, 627–634.
  10. Nurse scheduling via answer set programming. In LPNMR, 301–307. Springer.
  11. Treewidth-aware cycle breaking for algebraic answer set counting. In KR, volume 18, 269–279.
  12. Fages, F. 1994. Consistency of Clark’s completion and existence of stable models. Journal of Methods of logic in computer science, 1(1): 51–60.
  13. Treewidth and counting projected answer sets. In LPNMR, 105–119. Springer.
  14. Answer Set Solving with Bounded Treewidth Revisited. In LPNMR, 132–145.
  15. Conflict-driven Answer Set Enumeration. In LPNMR, volume 4483, 136–148.
  16. The stable model semantics for logic programming. In ICLP/SLP, volume 88, 1070–1080.
  17. Answer set programming based on propositional satisfiability. Journal of Automated reasoning, 36(4): 345–377.
  18. Answer-Set Programming with Bounded Treewidth. In IJCAI, volume 9, 816–822.
  19. Janhunen, T. 2004. Representing normal programs with clauses. In ECAI, volume 16, 358.
  20. Janhunen, T. 2006. Some (in) translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1-2): 35–86.
  21. Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses, 111–130.
  22. ApproxASP–a scalable approximate answer set counter. In AAAI, volume 36, 5755–5764.
  23. A Fast and Accurate ASP Counting Based Network Reliability Estimator. In LPAR, volume 94, 270–287.
  24. Integrating tree decompositions into decision heuristics of propositional model counters. In CP.
  25. An Improved Decision-DNNF Compiler. In IJCAI, volume 17, 667–673.
  26. Loop formulas for disjunctive logic programs. In ICLP, 451–465. Springer.
  27. Lifschitz, V. 2010. Thirteen definitions of a stable model. Fields of logic and computation, 488–503.
  28. Why are there so many loop formulas? ACM Transactions on Computational Logic (TOCL), 7(2): 261–268.
  29. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157(1): 115 – 137.
  30. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm, 375–398. Springer.
  31. Experimental evaluation of hybrid conditional planning for service robotics. In International Symposium on Experimental Robotics, 692–702. Springer.
  32. Algorithms for propositional model counting. In LPAR, 484–498. Springer.
  33. GANAK: A Scalable Probabilistic Exact Model Counter. In IJCAI, volume 19, 1169–1176.
  34. Thurley, M. 2006. sharpSAT–counting models with advanced component caching and implicit BCP. In SAT, 424–429. Springer.
  35. A practical tool for mass-customising configurable products. In ICED.
  36. Valiant, L. G. 1979. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3): 410–421.
Citations (3)
View on Semantic Scholar

Summary

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

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