Abstract
We introduce a novel approach to revision and updating where two semantics are used for the same class of theories. One semantics, the intended semantics, is used to give a theory its intended meaning, while the other, the back-up semantics, is used as a fall back whenever the intended semantics fails to provide a meaning to the theory.
Almost nothing will be assumed about the exact properties of both the intended and the back-up semantics, except for the following relations between them: (i) the entailment relation based on the intended semantics is stronger than the entailment relation based on the back-up semantics and (ii) the back-up semantics is defined for a broader class of theories than the intended semantics.
If, for some theory T, the intended semantics is not defined, revision of the theory is asked for. Like in the framework of classical theory revision, we apply revision by transforming the current theory T to another theory T′ such that the intended semantics is defined for T′. In that case, the back-up semantics is used to guarantee that as far as this latter semantics concerns, there is no loss in inferential power in transforming T to T′. Using this framework we develop some fairly intuitive postulates for (nonmonotonic) belief revision and updating. Together with some well-known abstract properties of entailment relations we then investigate which theory transformations are suitable for doing revision and updating of (nonmonotonic) theories. The main conclusions of this paper are:
-
1.
In general, for revision, retraction is not suitable and, in many cases, minimal revision can only be achieved by applying revision by expansion.
-
2.
When dealing with updating, retraction is not suitable for most nonmonotonic semantics. Even for nontrivial deletions, retracting information will not suffice if the back-up semantics satisfies some additional abstract properties.
We conclude by showing that this framework offers a possibility for refining some existing approaches to revision of nonmonotonic theories.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
P. Gärdenfors, Belief Revision, Cambridge University Press, 1992.
N. Bidoit, Negation in rule-based database languages: a survey, Theoretical Computer Science, 78, (1991), 3–83.
J. Doyle, A Truth Maintenance System, Artificial Intelligence, vol. 12, pp. 231–272, 1979.
J. Dietrich and H. Herre, Outline of a nonmonotonic model theory. Technical Report NTZ-5:94, Universitaet Leipzig, Institut fuer Informatik, Leipzig, 1994.
K. Inoue, C. Sakama, Abductive Framework for Nonmonotonic Theory Change. Proceedings IJCAI'95, 1995.
D. Makinson, General Patterns in Nonmonotonic Reasoning, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (eds) Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic Reasoning, Oxford Science Publications, Oxford, 1994.
V. Marek and M. Truszczyński, Nonmonotonic Logic, Springer Verlag, Heidelberg, 1993.
Morris, P., Stable Closures, Defeasible Logic and Contradiction Tolerant Reasoning, Proceedings of the 7th National Conference on Artificial Intelligence, 1988.
L. M. Pereira, J. J. Alferes and J. N. Aparicio. Contradiction Removal within wellfounded semantics. In: A. Nerode, W. Marek and V. S. Subrahmanian, (eds.), First International Workshop on Logic Programming and Non-monotonic Reasoning, MIT Press, 1991.
C. Witteveen and W. van der Hoek, Revision by Communication. In: V. Marek, A. Nerode and M. Truszczyński, editors, Logic Programming and Non-Monotonic Reasoning, LNAI 928, pp. 189–202, Springer Verlag, 1995.
C. Witteveen and W. van der Hoek, Some Postulates for Nonmonotonic Theory Revision Applied to Logic Programming. In: R. Dyckhoff, H. Herre and P. Schroeder-Heister, editors, Extensions of Logic Programming, LNAI 1050, pp. 303–318, Springer Verlag, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witteveen, C., van der Hoek, W. (1996). Revising and updating using a back-up semantics. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-61630-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61630-6
Online ISBN: 978-3-540-70643-4
eBook Packages: Springer Book Archive