Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

AI
2011
Springer

favoriteEmaildiscussreport

158views Artificial Intelligence» more AI 2011»

Stable models and circumscription

12 years 11 months ago

Stable models and circumscription

Download peace.eas.asu.edu

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 deﬁnition of that concept, which covers many constructs used in answer set programming and, unlike the original deﬁnition, refers neither to grounding nor to ﬁxpoints. It is based on a syntactic transformation similar to parallel circumscription. Key words: Answer set programming, Circumscription, Nonmonotonic reasoning, Program completion, Stable models

Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Real-time Traffic

AI 2011 | Artificial Intelligence | Declarative Semantics | Programming | Stable Models |

claim paper

Related Content

» Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stabl...

» Implementing Prioritized Circumscription by Computing Disjunctive Stable Models

» A New Perspective on Stable Models

» Circumscription and Projection as Primitives of Logic Programming

» Computing Circumscriptive Databases by Integer Programming Revisited

» On the Complexity of Theory Curbing

» Logical and algorithmic properties of stable conditional independence

» Stable models and an alternative logic programming paradigm

» Computing stable models worstcase performance estimates

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	AI
Authors	Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz

Comments (0)