Circumscriptive Event Calculus as Answer Set Programming
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 823-828.
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.Tae-Won Kim, Joohyung Lee, Ravi Palla
@inproceedings{ijcai2009p141,
title = {Circumscriptive Event Calculus as Answer Set Programming},
author = {Kim, Tae-Won and Lee, Joohyung and Palla, Ravi},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {823--828},
year = {2009},
url = {https://ijcai.org/proceedings/2009/141},
}
TY - CPAPER TI - Circumscriptive Event Calculus as Answer Set Programming AU - Kim, Tae-Won AU - Lee, Joohyung AU - Palla, Ravi T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 823 EP - 828 UR - https://ijcai.org/proceedings/2009/141 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
