Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Joohyung Lee, Ravi Palla

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

Circumscription and logic programs under the stable model semantics are two wellknown 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 ecient answer set solvers can be applied to compute the situation calculus and the event calculus.

Original languageEnglish (US)
Pages (from-to)571-620
Number of pages50
JournalJournal of Artificial Intelligence Research
Volume43
DOIs
StatePublished - Jan 2012

Fingerprint

Computer programming
Semantics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

@article{9b11eb3519944959afd5d1d9aed697c2,
title = "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 wellknown 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 ecient answer set solvers can be applied to compute the situation calculus and the event calculus.",
author = "Joohyung Lee and Ravi Palla",
year = "2012",
month = "1",
doi = "10.1613/jair.3489",
language = "English (US)",
volume = "43",
pages = "571--620",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

AU - Lee, Joohyung

AU - Palla, Ravi

PY - 2012/1

Y1 - 2012/1

N2 - Circumscription and logic programs under the stable model semantics are two wellknown 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 ecient answer set solvers can be applied to compute the situation calculus and the event calculus.

AB - Circumscription and logic programs under the stable model semantics are two wellknown 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 ecient answer set solvers can be applied to compute the situation calculus and the event calculus.

UR - http://www.scopus.com/inward/record.url?scp=84862657787&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862657787&partnerID=8YFLogxK

U2 - 10.1613/jair.3489

DO - 10.1613/jair.3489

M3 - Article

AN - SCOPUS:84862657787

VL - 43

SP - 571

EP - 620

JO - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -