Property Persistence in the Situation Calculus
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1948-1952.
Abstract
We develop an algorithm for reducing universally quantified situation calculus queries to a form more amenable to automated reasoning. Universal quantification in the situation calculus requires a second-order induction axiom, making automated reasoning difficult for such queries. We show how to reduce queries about property persistence, a common family of universally-quantified query, to an equivalent form that does not quantify over situations. The algorithm for doing so utilizes only first-order reasoning. We give several examples of important reasoning tasks that are facilitated by our approach, including checking for goal impossibility and reasoning about knowledge with partial observability of actions.
@inproceedings{ijcai2007p314,
title = {Property Persistence in the Situation Calculus},
author = {Kelly, Ryan F. and Pearce, Adrian R.},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1948--1952},
year = {2007},
url = {https://ijcai.org/proceedings/2007/314},
}
TY - CPAPER TI - Property Persistence in the Situation Calculus AU - Kelly, Ryan F. AU - Pearce, Adrian R. T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1948 EP - 1952 UR - https://ijcai.org/proceedings/2007/314 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
