Abstract
The problem of Theory Revision is to “add” a formula to a theory, while preserving consistency and making only minimal changes to the original theory. A natural way to uniquely determine the process is by imposing an order of “epistemic entrenchment” on the formulae, as done by Gärdenfors and Makinson. We improve their results as follows: We define orders which generate unique revision processes too, but in addition, 1) have nice logical properties, 2) are independent of the theory considered, and thus well suited for iterated revision and computational purposes, 3) have a natural probabilistic construction. Next, we show that the completeness problems of Theory Revision carry over to a certain extent to an approach based on revising axiom systems. In the last section, we consider a more general situation: First, we will have only a partial order (on axioms) at our disposal. Second, the underlying logic will be non-monotonic. Ideas taken from defeasible inheritance will help us solve the problem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
C. Alchourron, P. Gärdenfors, D. Makinson: On the Logic of Theory Change, Journal of Symbolic Logic 50, 1985, p. 510–530
C. Alchourron, D. Makinson: On the Logic of Theory Change: Contraction functions and their associated revision functions; Theoria 48 (1982) p.14–37
R. Fagin, J.D. Ullmann, M.Y. Vardi: On the Semantics of Updates in Databases, Proc. Second ACM SIGACT-SIGMOD, 1983, p. 352–365
P. Gärdenfors: Knowledge in Flux, MIT Press 1988
P. Gärdenfors, D. Makinson: Revisions of Knowledge Systems Using Epistemic Entrenchment; in: Theoretical Aspects of Reasoning about Knowledge, M.Y. Vardi ed., Morgan Kaufmann, Los Altos, Cal., 1988, p.83–95
J.Horty, R.Thomason, D.Touretzky: A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks, CMU Report CMU-CS-87-175
D. Makinson: How to give it up: A Survey of Some Formal Aspects of the Logic of Theory Change; Synthese 62 (1985), 347–363
K.Schlechta: Reasoning with and about defaults (Unpublished)
W. Spohn: “Ordinal conditional functions: A dynamic theory of epistemic states” in Causation in Decision, Belief Change, and Statistics, W.L.Harper and B.Skyrms, eds. Dordrecht 1988, Reidel, vol. 2, 105–134
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schlechta, K. (1991). Some results on theory revision. In: Fuhrmann, A., Morreau, M. (eds) The Logic of Theory Change. Lecture Notes in Computer Science, vol 465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018417
Download citation
DOI: https://doi.org/10.1007/BFb0018417
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53567-6
Online ISBN: 978-3-540-46817-2
eBook Packages: Springer Book Archive