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

一阶稳定模型语义与一阶回路公式

First-Order Stable Model Semantics and First-Order Loop Formulas

Arizona State University(亚利桑那州立大学)

Joohyung Lee, Yunsong Meng

摘要:

Lin和Zhaos关于循环公式的定理指出,在命题情况下,逻辑程序的稳定模型语义可以完全由命题循环公式表征,但这一结果不能完全推广到一阶情况。我们调查一阶稳定模型语义和一阶循环公式之间的精确关系,并研究前者可以由后者表示的条件。为了便于比较,我们扩展了一阶循环公式的定义,这是仅限于一个非析取程序,一个析取程序和一个任意的一阶理论。基于所研究的关系,我们扩展了显式量词的逻辑程序的语法,这使得我们可以使用一阶推理机进行涉及非Herbrand稳定模型的推理。这类程序在稳定模型语义下可以看作是一类特殊的一阶理论,由于其语法的限制,它比一般语言产生更简洁的循环公式。

英文摘要:

Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case. We investigate the precise relationship between the first-order stable model semantics and first-order loop formulas, and study conditions under which the former can be represented by the latter. In order to facilitate the comparison, we extend the definition of a first-order loop formula which was limited to a nondisjunctive program, to a disjunctive program and to an arbitrary first-order theory. Based on the studied relationship we extend the syntax of a logic program with explicit quantifiers, which allows us to do reasoning involving non-Herbrand stable models using first-order reasoners. Such programs can be viewed as a special class of first-order theories under the stable model semantics, which yields more succinct loop formulas than the general language due to their restricted syntax.

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

↑