Circumscriptive Event Calculus as Answer Set Programming

On the other hand, the Recently, Ferraris, Lee and Lifschitz presented a solution provided by answer set programming (ASP), that is general definition of a stable model that is similar carried over to high level action language A [Gelfond and to the definition of circumscription, and can even Lifschitz, 1998] and many of its descendants that are based be characterized in terms of circumscription. In on ASP, uses both default negation (not) and strong negation this paper, we show the opposite direction, which ()--the idea of which is closely related to Reiter's default is, how to turn circumscription into the general stable logic solution [Reiter, 1980]. Interestingly, the development model semantics, and based on this, how to turn of the event calculus has spanned over both classical circumscriptive event calculus into answer set programs.