答案集间穿梭--轻松导航
Rushing and Strolling among Answer Sets -- Navigation Made Easy
摘要:
回答集编程(ASP)是一种流行的声明式编程范式,在人工智能中有着广泛的应用。通常,当用ASP建模AI问题时,特别是当我们感兴趣的不仅仅是简单地搜索最佳解决方案时,实际解决方案,解决方案之间的差异或ASP程序的解决方案数量很重要。例如,当用户的目标是根据她的需要识别特定的答案集,或者需要发散解决方案的总数来理解概率应用,例如医学领域的推理。然后,只有某些特定问题和手工编码技术可用于导航ASP程序的解决方案空间,这通常是不够的。在本文中,我们提出了一个正式的和一般的框架,交互式导航所需的子集的答案集类似于分面浏览。我们的方法使用户能够有意识地放大或缩小在一定的可配置的步伐的解决方案的子空间,探索解决方案空间。我们说明了加权分面导航是计算困难的。最后,我们提供了一个实现我们的方法,证明了我们的框架不可理解的解决方案空间的可行性。
英文摘要:
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with ASP, and in particular when we are interested beyond simple search for optimal solutions, an actual solution, differences between solutions, or number of solutions of the ASP program matter. For example, when a user aims to identify a specific answer set according to her needs, or requires the total number of diverging solutions to comprehend probabilistic applications such as reasoning in medical domains. Then, there are only certain problem specific and handcrafted encoding techniques available to navigate the solution space of ASP programs, which is oftentimes not enough. In this paper, we propose a formal and general framework for interactive navigation towards desired subsets of answer sets analogous to faceted browsing. Our approach enables the user to explore the solution space by consciously zooming in or out of sub-spaces of solutions at a certain configurable pace. We illustrate that weighted faceted navigation is computationally hard. Finally, we provide an implementation of our approach that demonstrates the feasibility of our framework for incomprehensible solution spaces.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。