Paper Info
Title
Circumscriptive event calculus as answer set programming
Abstract
Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, which is, how to turn circumscription into the general stable model semantics, and based on this, how to turn circumscriptive event calculus into answer set programs. The reformulation of the event calculus in answer set programming allows answer set solvers to be applied to event calculus reasoning, handling more expressive reasoning tasks than the current SAT-based approach. Our experiments also show clear computational advantages of the answer set programming approach.
Year
Venue
Keywords
2009
IJCAI
general definition,answer set program,circumscriptive event,general stable model semantics,event calculus reasoning,answer set programming,event calculus,circumscriptive event calculus,current sat-based approach,expressive reasoning task,answer set programming approach
Field
DocType
Citations 
Discrete mathematics,Event calculus,Computer science,Circumscription,Stable model semantics,Answer set programming,Frame problem
Conference
23
PageRank 
References 
Authors
1.27
20
3
Name
Order
Citations
PageRank
Taewon Kim1334.60
Joohyung Lee2102464.91
ravi kiran reddy palla31448.32