IASCAR: Incremental Answer Set Counting by Anytime Refinement

Johannes Klaus FichteJohannes Klaus Fichte, Sarah Alice GagglSarah Alice Gaggl, Markus HecherMarkus Hecher, Dominik RusovacDominik Rusovac

Download

Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Theory and Practice of Logic Programming, 1-28, February 2024

Details
Bibtex

KurzfassungAbstract
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.
Weitere Informationen unter:Further Information: Link
Projekt:Project: NAVAS
Forschungsgruppe:Research Group: Logische Programmierung und ArgumentationLogic Programming and Argumentation

@article{FGHR2024,
  author    = {Johannes Klaus Fichte and Sarah Alice Gaggl and Markus Hecher and
               Dominik Rusovac},
  title     = {IASCAR: Incremental Answer Set Counting by Anytime Refinement},
  journal   = {Theory and Practice of Logic Programming},
  publisher = {Cambridge University Press},
  year      = {2024},
  month     = {February},
  pages     = {1-28}
}