Counting Answer Sets of Disjunctive Answer Set Programs
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel

TL;DR
This paper introduces SharpASP-SR, a new framework for efficiently counting answer sets in disjunctive logic programs by reducing the problem to projected propositional model counting, significantly improving performance.
Contribution
The paper presents a novel reduction-based framework, SharpASP-SR, enabling efficient answer set counting for disjunctive programs and combines it with enumeration techniques for optimal results.
Findings
SharpASP-SR outperforms existing counters on large instances.
The approach maintains polynomial size intermediate representations.
Hybrid methods achieve state-of-the-art performance.
Abstract
Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computational problem with applications in probabilistic reasoning, network reliability analysis, and other domains. This has motivated significant research into designing efficient ASP counters. While substantial progress has been made for normal logic programs, the development of practical counters for disjunctive logic programs remains challenging. We present SharpASP-SR, a novel framework for counting answer sets of disjunctive logic programs based on subtractive reduction to projected propositional model counting. Our approach introduces an alternative characterization of answer sets that enables efficient reduction while ensuring that intermediate representations remain of polynomial size. This allows…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Topic Modeling · Multi-Agent Systems and Negotiation
