IASCAR:通过任意时刻细化进行增量答案集计数
IASCAR: Incremental Answer Set Counting by Anytime Refinement
AI总结:
本文提出IASCAR,一种基于知识编译和包含-排除原理的任意时刻增量计数方法,用于在文字假设下高效计数ASP答案集,初步实验显示有前景的结果。
摘要:
答案集编程(ASP)是一种流行的声明式编程范式,具有多种应用。程序可能很容易拥有许多在实践中无法枚举的答案集,但计数仍然可以量化解空间。如果在文字假设下进行计数,就可以获得一种理解解空间部分内容的工具,即所谓的答案集导航。然而,在解空间的部分区域中导航需要多次计数,这在理论上是昂贵的。知识编译将实例编译为可在多项式时间内计数的表示形式。然而,这些技术仅适用于CNF公式,将ASP程序编译为CNF公式可能会引入指数级开销。本文介绍了一种技术,用于在编码支持模型的CNF知识编译上,在假设下迭代地计数答案集。我们的任意时刻技术利用包含-排除原理,通过系统地过度计数和不足计数来改进界限。在初步的实证分析中,我们展示了有希望的结果。在编译输入(离线阶段)之后,我们的方法可以快速(重新)计数。
英文摘要:
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 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。