arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.5436cs.AIcs.LO
收藏

逻辑程序稳定模型的特征化和计算:非分层情况

Characterizing and computing stable models of logic programs: The non-stratified case

Università di Milano(米兰大学);Università di L’Aquila(拉奎拉大学)

Gianpaolo Brignoli, Stefania Costantini, Ottavio D'Antona, Alessandro Provetti

摘要:

稳定逻辑程序设计(Stable Logic Programming,SLP)是一种新兴的、可替代的逻辑程序设计风格:问题的每个解决方案都由一个演绎数据库/无函数逻辑程序的稳定模型来表示,该模型对问题本身进行编码。现在有几种实现稳定的逻辑编程,它们的性能正在迅速提高。为了使SLP普遍适用,应该可以检查一致性(即,稳定模型的存在)。在文献中,只有相当强的充分条件已提出的一致性,例如,分层本文在几个方向上推广了这些结果。首先,程序的句法特征,即循环负依赖,影响稳定模型的存在的特点,并讨论了它们的相关性。其次,介绍了一种新的逻辑程序的图表示方法--扩展依赖图(EDG),它能为稳定模型的推理提供足够的信息(而传统的依赖图不能)。最后,我们表明,稳定模型的存在性问题可以重新制定的染色的EDG。

英文摘要:

Stable Logic Programming (SLP) is an emergent, alternative style of logic programming: each solution to a problem is represented by a stable model of a deductive database/function-free logic program encoding the problem itself. Several implementations now exist for stable logic programming, and their performance is rapidly improving. To make SLP generally applicable, it should be possible to check for consistency (i.e., existence of stable models) of the input program before attempting to answer queries. In the literature, only rather strong sufficient conditions have been proposed for consistency, e.g., stratification. This paper extends these results in several directions. First, the syntactic features of programs, viz. cyclic negative dependencies, affecting the existence of stable models are characterized, and their relevance is discussed. Next, a new graph representation of logic programs, the Extended Dependency Graph (EDG), is introduced, which conveys enough information for reasoning about stable models (while the traditional Dependency Graph does not). Finally, we show that the problem of the existence of stable models can be reformulated in terms of coloring of the EDG.

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

↑