|
|||||
|
|
Stable models and circumscription |
|
| Authors: | Paolo Ferraris Joohyung Lee Vladimir Lifschitz |
| Affiliation: | aGoogle, Inc., 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States;bDepartment of Computer Science and Engineering, Arizona State University, 699 South Mill Avenue, Tempe, AZ 85281, United States;cDepartment of Computer Sciences, University of Texas at Austin, 1 University Station C0500, Austin, TX 78712, United States |
| Abstract: | 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. |
| Keywords: | Answer set programming Circumscription Nonmonotonic reasoning Program completion Stable models |
| 本文献已被 ScienceDirect 等数据库收录！ | |