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

arXiv: https://arxiv.org/abs/1401.4607 · HTML: https://mlsanity.com/paper/1401.4607/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Jan 2014.

## Built on by (most cited first, 3 of 3)

- [Coupling Large Language Models with Logic Programming for Robust and General Reasoning from Text](https://mlsanity.com/paper/2307.07696/) (2023)
- [Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming](https://mlsanity.com/paper/2106.14566/) (2021)
- [Toward A Logical Theory Of Fairness and Bias](https://mlsanity.com/paper/2306.13659/) (2023)

## Abstract (arXiv)

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.