Reasoning about action and change using Dijkstra's semantics for programming languages: preliminary report
Witold Łukaszewicz, Ewa Madaliriska-Bugaj · International Joint Conference on Artificial Intelligence · 1995
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.