Exact ASP Counting with Compact Encodings
Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel

TL;DR
This paper introduces sharpASP, a novel framework for exact answer set counting that leverages alternative definitions to improve scalability and performance over existing methods in ASP.
Contribution
It presents a new ASP counting approach that avoids large formulas and adapts propositional model counting techniques, significantly enhancing performance.
Findings
Solved 167 more benchmarks than previous methods.
Achieved a PAR2 score reduction from 4205 to 3082.
Demonstrated scalability on large benchmark sets.
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…
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.
Code & Models
Videos
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Natural Language Processing Techniques
MethodsSparse Evolutionary Training
