IASCAR: Incremental Answer Set Counting by Anytime Refinement
Research output: Contribution to journal › Conference article › Contributed › peer-review
Contributors
Abstract
Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have many answer sets that cannot be enumerated in practice, but counting still allows quantifying solution spaces. If one counts under assumptions on literals, one obtains a tool to comprehend parts of the solution space, so-called answer set navigation. However, navigating through parts of the solution space requires counting many times, which is expensive in theory. Knowledge compilation compiles instances into representations on which counting works in polynomial time. However, these techniques exist only for conjunctive normal form (CNF) formulas, and compiling ASP programs into CNF formulas can introduce an exponential overhead. This paper introduces a technique to iteratively count answer sets under assumptions on knowledge compilations of CNFs that encode supported models. Our anytime technique uses the inclusion-exclusion principle to improve bounds by over- and undercounting systematically. In a preliminary empirical analysis, we demonstrate promising results. After compiling the input (offline phase), our approach quickly (re)counts.
Details
Original language | English |
---|---|
Pages (from-to) | 505-532 |
Number of pages | 28 |
Journal | Theory and practice of logic programming : TPLP |
Volume | 24 |
Issue number | 3 |
Early online date | 21 Feb 2024 |
Publication status | Published - May 2024 |
Peer-reviewed | Yes |
External IDs
Scopus | 85185785212 |
---|---|
ORCID | /0000-0003-2425-6089/work/173986250 |
Keywords
ASJC Scopus subject areas
Keywords
- ASP, answer set counting, knowledge compilation