Reasoning About Persistence: A Theory of Actions
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 718-722.
Abstract
Winslett proposed a method for reasoning about action called the pos .~'ible models approach (PMA) . The PMA successfully removed the major difficulty manifested by Ginsberg and Smith's possible worlds approach (PWA). In this paper, we show that Winslett's PMA fails to solve the frame and ramification problems for some actions, as does the PWA. From this observation , we classify actions as definite and indefinite, and find that, in general, the PMA is not appropriate for both definite and indefinite actions. We propose a new approach to formalize actions based on persistence. We compare our approach with the PMA in detail, and show that our new formalization can avoid the problems in the PMA and PWA in most cases, and give more intuitive results for reasoning about action, regardless of whether the action is definite or indefinite.
@inproceedings{ijcai1993p101,
title = {Reasoning About Persistence: A Theory of Actions},
author = {Zhang, Yan and Foo, Norman Y.},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {718--722},
year = {1993},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1993/101},
}
TY - CPAPER TI - Reasoning About Persistence: A Theory of Actions AU - Zhang, Yan AU - Foo, Norman Y. T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 718 EP - 722 UR - https://ijcai.org/proceedings/1993/101 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
