Stable models and circumscription

被引：90
作者：
Ferraris, Paolo [2 ]
Lee, Joohyung [3 ]
Lifschitz, Vladimir [1 ]
机构：
[1] Univ Texas Austin, Dept Comp Sci, Austin, TX 78712 USA
[2] Google Inc, Mountain View, CA 94043 USA
[3] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85281 USA
来源：
ARTIFICIAL INTELLIGENCE | 2011年 / 175卷 / 01期
基金：
美国国家科学基金会;
关键词：
Answer set programming; Circumscription; Nonmonotonic reasoning; Program completion; Stable models; LOGIC; SEMANTICS; TIGHT;
D O I：
10.1016/j.artint.2010.04.011
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based on a syntactic transformation similar to parallel circumscription. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：236 / 263
页数：28
相关论文
共 36 条
[1]  
[Anonymous], 1985, Proceedings of the 9th international joint conference on Artificial intelligence-Volume
[2]  
Clark K. L., 1978, Logic and data bases, P293
[3]   Tight logic programs [J].
Erdem, E ;
Lifschitz, V .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2003, 3 (4-5) :499-518
[4]  
Faber W., 2004, P EUR C LOG ART INT
[5]  
FAGES F, 1994, J METHODS LOGIC COMP, V1, P51
[6]   Answer sets for propositional theories [J].
Ferraris, P .
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 2005, 3662 :119-131
[7]  
Ferraris P, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P797
[8]  
Ferraris P, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P372
[9]  
Gelfond M., 1991, New Generation Computing, V9, P365, DOI 10.1007/BF03037169
[10]  
Gelfound M., 1988, Logic Programming: Proceedings of the Fifth International Conference and Symposium, P1070
1234