arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.1287cs.AI
收藏

广义原子应答集程序设计的语义与编译

Semantics and Compilation of Answer Set Programming with Generalized Atoms

University of Calabria(卡拉布里亚大学);University of Huddersfield(哈德斯菲尔德大学)

Mario Alviano, Wolfgang Faber

摘要:

答案集编程(ASP)是在稳定模型或答案集语义下的逻辑编程。在过去的十年中,这个范例已经看到了一些扩展,通过推广这些程序中使用的原子的概念。其中,有聚合原子,HEX原子,广义量词和抽象约束。在本文中,我们把这些结构统称为广义原子。所有这些构造的共同思想是,它们的满足取决于一组(非广义)原子的真值,而不是单个(非广义)原子的真值。出于几个例子,我们认为,对于一些更复杂的广义原子,以前建议的语义提供不直观的结果,并提供了一种替代的语义,我们称之为绝对稳定或SFLP答案集。我们表明,它是等价的主要先前提出的语义凸广义原子的程序,它在一般情况下承认更多的预期模型比其他语义在非凸广义原子的存在。我们表明,复杂的非稳定模型是在第二层次的多项式,类似于以前的建议和稳定的模型的析取逻辑程序。鉴于这些复杂性的结果,我们提供了一个编译方法,competencytransforms的程序与广义原子的析取范式的程序没有广义原子。变体给出了新的稳定的和现有的FLP语义,类似的编译技术还没有被称为迄今为止。

英文摘要:

Answer Set Programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing the notion of atom used in these programs. Among these, there are aggregate atoms, HEX atoms, generalized quantifiers, and abstract constraints. In this paper we refer to these constructs collectively as generalized atoms. The idea common to all of these constructs is that their satisfaction depends on the truth values of a set of (non-generalized) atoms, rather than the truth value of a single (non-generalized) atom. Motivated by several examples, we argue that for some of the more intricate generalized atoms, the previously suggested semantics provide unintuitive results and provide an alternative semantics, which we call supportedly stable or SFLP answer sets. We show that it is equivalent to the major previously proposed semantics for programs with convex generalized atoms, and that it in general admits more intended models than other semantics in the presence of non-convex generalized atoms. We show that the complexity of supportedly stable models is on the second level of the polynomial hierarchy, similar to previous proposals and to stable models of disjunctive logic programs. Given these complexity results, we provide a compilation method that compactly transforms programs with generalized atoms in disjunctive normal form to programs without generalized atoms. Variants are given for the new supportedly stable and the existing FLP semantics, for which a similar compilation technique has not been known so far.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑