Abstract
We present a tense logic, ZK, for representing changes within knowledge based systems. ZK has tense operators for the future and for the past, and a modal operator for describing consistency. A knowledge based system consists of a set K of general laws (described by first order formulae) and of a set of states, each described by a first order formula (called descriptive formula). Changes are represented by pairs of formulae (P,R) (precondition, result). A change can occur within a state whenever the preconditions are true. The descriptive formula of the resulting new state is the conjunction of R with the maximal subformula of the descriptive formula of the old state which is consistent with K and R. Generally, a change will yield more than one new state (multiple extensions).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bossu G. and Siegel P., Saturation, Non-Monotonic Reasoning and the Closed-World Assumption. Artificial Intelligence 25,1,1985, pp. 13–63.
Brown F. M., A Modal Logic for the Representation of Knowledge. In: The Frame Problem in Artificial Intelligence. Proceedings of the 1987 Workshop, F. M. Brown (ed.), Morgan Kaufmann Publishers, Inc. 1987.
Hanks S. and McDermott D., Nonmonotonic Logic and Temporal Projection. In: Artificial Intelligence 33 (1987), pp. 379–412.
Henkin L., The Completeness of the First-Order Functional Calculus. Journal of Symbolic Logic 14, pp. 159–166,1949.
Rripke S.A., Semantical Analysis of Modal Logic I, Normal Propositional Calculi. In: Zeitschrift f Mathematische Logik u. Grundlagen d. Mathematik 9, pp. 67–96, 1963a.
Lafon E. and Schwind C. B., A Theorem Prover for Action Performance. Proceedings of the European Conference on Artificial Intelligence (ECAI-88), München, August 1988.
McCarthy J. and Hayes P., Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: B. Meltzer and D. Michie (eds.): Machine Intelligence 4, Edinburgh University Press, Edinburgh, 1969.
McDermott D., Non Monotonie Logic II: Non Monotonie Modal Theories. In: JACM, vol. 20, n_o 1,1982.
Rescher N., Urquhart A., Temporal Logic. Berlin, Heidelberg, New York, Wien: Springer, 1971.
Schwind C. B., Representing Actions by State Logic. In: Proceedings of the AISB/GI Conference on Artificial Intelligence, pp. 304–308, Hamburg, 1978a.
Schwind C. B., Un Démonstrateur de Théorèmes pour des Logiques Modales et Temporelles en PROLOG. In: 5ème Congrès Reconnaissance des Formes et Intelligence Artificielle, Grenoble 27–29 Novembre 1985. (English version: A PROLOG Theorem Prover for Temporal and Modal Logic. Research Report LISH/386/Janv. 1984, Marseille).
Schwind C. B., A Tense Logic Based Theory of Actions. Report GRTC/208,1987.
Smullyan R. M., First Order Logic. Springer Verlag 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Schwind, C.B. (1990). Knowledge Revision and Multiple Extensions. In: Brazdil, P.B., Konolige, K. (eds) Machine Learning, Meta-Reasoning and Logics. The Kluwer International Series in Engineering and Computer Science, vol 82. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1641-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1641-1_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8906-7
Online ISBN: 978-1-4613-1641-1
eBook Packages: Springer Book Archive