Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming

Abstract

Circumscription and logic programs under the stable model semantics are two well-known nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the discovery that circumscription and the stable model semantics coincide on a class of canonical formulas, we reformulate the situation calculus and the event calculus in the general theory of stable models. We also present a translation that turns the reformulations further into answer set programs, so that efficient answer set solvers can be applied to compute the situation calculus and the event calculus.

References in corpus (1)

• Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems

Cited by in corpus (5)

• An Event Calculus Production Rule System for Reasoning in Dynamic and Uncertain Domains
• Module Theorem for The General Theory of Stable Models
• Practical Reasoning with Norms for Autonomous Software Agents (Full Edition)
• Combining Event Calculus and Description Logic Reasoning via Logic Programming
• Two New Definitions of Stable Models of Logic Programs with Generalized Quantifiers