Computing Ramifications by Postprocessing
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. Pages 1994-1999.
Abstract
A solution to the ramification problem caused by underlying domain constraints in STRIPSlike approaches is presented. We introduce the notion of causal relationships which are used in a post-processing step after having applied an action description. Moreover, we show how the information needed for these post-computations can be automatically extracted from the domain constraints plus general knowledge of which fluents can possibly affect each other. We illustrate the necessity of causal relationships by an example that shows the limitedness of a common method to avoid unintended ramifications, namely, the distinction between so-called frame and non-frame fluents. Finally, we integrate our solution into a recently developed, STRIPS-like yet purely deductive approach to reasoning about actions based on Equational Logic Programming.
@inproceedings{ijcai1995p256,
title = {Computing Ramifications by Postprocessing},
author = {Thielscher, Michael},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1994--1999},
year = {1995},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1995/256},
}
TY - CPAPER TI - Computing Ramifications by Postprocessing AU - Thielscher, Michael T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1994 EP - 1999 UR - https://ijcai.org/proceedings/1995/256 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
