Abstract
In this paper we present a framework of retrospective reasoning to deal with the belief revision problem in knowledge systems. First, a first-order knowledge base is represented by a set of formulas in a first order epistemic belief language that contains objective formulas as well as belief formulas. Secondly, we define the revision operation by applying a form of prioritized circumscription to this representation of the knowledge base.
The retrospective ability is achieved by maintaining the evolutional information of a knowledge system. We compare our approach with previously proposed methods and show this ability is important to belief revision. In particular, we show that the revision semantics defined in this way satisfies the AGM postulates that are reformulated in our belief language.
This research is partially supported by the NSERC grants OGP42193 and OGP9225.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Alchourron, A. Gardenfors, and D. Makinson. On the logic of theory change: Partial meet contradiction and revision functions. The Journal of Symbolic Logic, 50:510–531, 1985.
C. Boutilier A logic for revision and subjunctive queries. In Proc. AAAI-92, 609–615, 1992.
R. Fagin, J. Ullman, and M. Vardi. On the semantics of updates in databases. In Proceedings of the 2nd ACM PODS, pages 352–365, 1983.
G. Grahne, A. Mendelzon, and R. Reiter On the semantics of belief revision systems. In Proceedings of TARK'92, pages 132–142, 1992.
A. Gardenfors and D. Makinson. Revision of knowledge systems using epistemic entrenchment. In Proceedings of the 2nd Workshop on Theoretical Aspects of Reasoning about Knowledge. Morgan Kaufmann, 1988.
Hadley, Fagin, and Halpern. On logical omniscience: A critique with an alternative. In Proceedings of the 6th Canadian Conf. on AI, pages 49–56, 1986.
H. Katsuno and A.O. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52:263–294, 1991.
V. Lifschitz. Computing circumscription. In Proceedings of the 9th Int. Joint Conference on AI, 1986.
J. McCarthy. Circumscription — a form of non-monotonic reasoning. AI, 13:27–39, 1980.
J. McCarthy. Applications of circumscription to formalizing common sense knowledge. AI, 28:89–116, 1986.
R.C. Moore. Semantic considerations on non-monotonic logic. AI, 25:75–94, 1985.
B. Nebel. A knowledge level analysis of belief revision. KR'89, pages 301–311, 1989.
B. Nebel. Belief revision and default reasoning: Syntax-based approaches. KR'91, pages 417–428, 1991.
T. Przyrnusinski. An Algorithm to Compute Circumscription. In Artificial Intelligence, vol 38, pages 47–73, 1989.
L. Willard and L. Yuan. The revised gardenfors postulates and update semantics. In Proceedings of 1990 International Conference on Database Theory, pages 409–421, 1990.
L.Y. Yuan and J.H. You. Semantics of First Order Belief Revision Based on Circumscription. Technical Report TR92-17, Department of Computing Science, University of Alberta, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, L.Y., You, JH. (1993). Knowledge base revision using circumscription. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57530-6
Online ISBN: 978-3-540-48212-3
eBook Packages: Springer Book Archive