Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. Pages 1950-1954.
Abstract
We apply Dijkstra's semantics for programming languages to formalization of reasoning about action and change. The basic idea is to view actions as formula transformers, i .e . functions from formulae into formulae . The major advantage of our proposal is that it is very simple and more effective than most of other approaches. Yet, it deals with a broad class of actions, including those with random and indirect effects. Also, both temporal prediction and postdiction reasoning tasks can be solved without restricting initial nor final states to completely specified.
@inproceedings{ijcai1995p250,
title = {Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report},
author = {Lukaszewicz, Witold and Madalinska-Bugaj, Ewa},
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 = {1950--1954},
year = {1995},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1995/250},
}
TY - CPAPER TI - Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report AU - Lukaszewicz, Witold AU - Madalinska-Bugaj, Ewa T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1950 EP - 1954 UR - https://ijcai.org/proceedings/1995/250 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
