On the declarative and procedural semantics of logic programs
On the declarative and procedural semantics of logic programs
复制标题
论逻辑程序的声明性和过程性语义
DOI：
10.1007/bf00243002
复制
发表时间：
1989
期刊：
影响因子：
--
通讯作者：
Teodor C. Przymusinski
中科院分区：
文献类型：
--
作者：
Teodor C. Przymusinski
逻辑程序设计中最重要也是最困难的问题之一是为逻辑程序寻找合适的声明或意图语义。这个问题的重要性源于逻辑编程的声明性，而其困难在很大程度上归因于逻辑程序中使用的否定运算符的非单调性。因此，这个问题可以被看作是一个问题，找到一个合适的形式化的类型的非单调推理中使用的logic programming.In本文中，我们介绍了一个语义的逻辑程序的基础上的类PERF（P）的所有，不一定Herbrand，完美modelsof一个程序P，我们表明，提出的语义不仅是自然的，但它也结合了许多可取的功能，以前的方法，同时消除了它们的一些缺点。对于正规划P，完美模型类PERF（P）与P的所有极小模型类MIN（P）重合.完美模型语义等价于McCarthy的限制语义，也等价于人工智能中非单调推理的其余三种主要形式化-Reiter的封闭世界假设，摩尔的自认知逻辑和Reiter的缺省理论，从而在逻辑程序设计和非单调推理领域之间建立了更紧密的联系。并证明了在完备模型语义下SLS-归结是可靠的和完备的。
One of the most important and difficult problems in logic programming is the problem of finding a suitabledeclarativeorintendedsemantics for logic programs. The importance of this problem stems from the declarative character of logic programming, whereas its difficulty can be largely attributed to the non-monotonic character of the negation operator used in logic programs. The problem can therefore be viewed as the problem of finding a suitable formalization of the type ofnon-monotonic reasoningused in logic programming.In this paper we introduce a semantics of logic programs based on the class PERF(P) of all, not necessarily Herbrand,perfect modelsof a programPand we show that the proposed semantics is not only natural but it also combines many of the desirable features of previous approaches, at the same time eliminating some of their drawbacks. For a positive programP, the class PERF(P) of perfect models coincides with the class MIN(P) of allminimal modelsofP.The perfect model semantics is shown to be equivalent to the semantics of McCarthy'scircumscriptionand is also equivalent to the remaining three major formalizations of non-monotonic reasoning in artificial intelligence-Reiter's closed world assumption, Moore's autoepistemic logic and Reiter's default theorythus establishing a closer link between the areas of logic programming and non-monotonic reasoning.We also define a generalization of SLD-resolution, calledSLS-resolutionand we prove that SLS-resolution is sound and complete with respect to the perfect model semantics.