Abstract
We describe a generalization of the PMA, called the modified PMA (MPMA), which permits an intuitive representation of disjunctive update and update with integrity constraints. An equivalent formulation of the MPMA in terms of Dijkstra’s semantics, based on the use of the weakest precondition and the strongest postcondition formula transformers, is then provided. The Dijkstra formulation is then used as a basis for a syntactic characterization of the MPMA, which is constructed by mapping an MPMA update of a knowledge base into a command in a simple Dijkstra style programming language. This characterization provides a decision procedure for computing entailments of the MPMA and serves as a basis for relating the belief update approach with temporal logic based and more procedurally based approaches for reasoning about action and change.
The author was partially supported by grants from the Wallenberg Foundation and the Swedish Research Council for Engineering Sciences (TFR)
The authors were partially supported by the Wallenberg Foundation and by KBN grant 8 T 11C 035 11
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bjäreland, L. Karlsson. Reasoning by Regression Pre-and Postcondition Operators for Logics of Action and Change. Proc. IJCAI’97, 1997.
G. Brewka, J. Hetrzberg. How to Do Things with Worlds: on Formalizing Actions and Plans. Journal of Logic and Computation. Vol. 3, No. 5, 517–532, 1993.
F. M. Brown. Boolean Reasoning. Kluwer Academic Publishers, 1990.
E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
E. W. Dijkstra, C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1990.
P. Doherty, W. Lukaszewicz, E. Madalińska-Bugaj. The PMA and Relativizing Minimal Change for Action Update. Proceedings of KR-98, 258–169, 1998
A. Hertzig. The PMA Revisited. Proceedings of KR’96, Morgan Kaufmann Publishers, Inc. San Francisco, California, 40–50, 1996.
F. Lin. Embracing Causality in Specifying the Indirect Effects of Actions. Proceedings of IJCAI’95, 1985–1991, 1995.
F. Lin. Embracing Causality in Specificying the Indeterminate Effects of Actions. Proc. AAAI’96, 1996.
E. Madalińska-Bugaj. How to Solve Qualification and Ramification Using Dijkstra’s Semantics for Programming Language. AI*IA-97: Advances in Artificial Intelligence, Springer-Verlag, Lecture Notes in Artificial Intelligence, 1321, 381–392, 1997.
M. Winslett. Reasoning about Action Using a Possible Model Approach. In: Proceedings AAAI-88, St. Paul, MN, 89–93, 1988.
M. Winslett. Updating Logical Databases. Cambridge Tracks in Theoretical Computer Science. Cambridge University Press, 1990.
M. Winslett, Updating Logical Databases. In: D. Gabbay, A. Galton, J. A. Robinson (eds.). Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. 4 (Epistemic and Temporal Reasoning), Oxford University Press, 133–174, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doherty, P., Lukaszewicz, W., Madalińska-Bugaj, E. (1999). Computing MPMA updates using Dijkstra’s semantics. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095113
Download citation
DOI: https://doi.org/10.1007/BFb0095113
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive