Abstract
In this paper we analyze the complexity of revising a knowledge base when an iteration of this process is necessary. The analysis concerns both the classical problems of belief revision (inference, model checking, computation of the new base) and new issues, related to the problem of “committing” the changes.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. E. Alchourrón, P. Gärdenfors, and D. Makinson. On the logic of theory change: Partial meet contraction and revision functions. J. of Symbolic Logic, 50:510–530, 1985.
Boutilier. Revision sequences and nested conditionals. In Proc. of IJCAI-93, pages 519–525, 1993.
M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. The size of a revised knowledge base. In Proc. of PODS-95, pages 151–162, 1995.
M. Dalal. Investigations into a theory of knowledge base revision: Preliminary report. In Proc. of AAAI-88, pages 475–479, 1988.
T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. AIJ, 57:227–270, 1992.
T. Eiter and G. Gottlob. The complexity of nested counterfactuals and iterated knowledge base revisions. In Proc. of IJCAI-93, pages 526–531, 1993.
N. Friedman and J. Y. Halpern. A knowledge-based framework for belief change: Part II: Revision and update. In Proc. of KR-94, pages 190–200, 1994.
G. Grahne and A. O. Mendelzon. Updates and subjunctive queries. Information and Computation, 2(116):241–252, 1995.
D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier, 1990.
H. Katsuno and A. O. Mendelzon. Propositional knowledge base revision and minimal change. AIJ, 52:263–294, 1991.
M. V. Krentel. The complexity of optimization problems. J. of Computer and System Sciences, 36:490–509, 1988.
D. Lehmann. Belief revision, revised. In Proc. of IJCAI-95, pages 1534–1540, 1995.
P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proc. of IJCAI-95, pages 1557–1563, 1995.
P. Liberatore and M. Schaerf. The complexity of model checking for belief revision and update. In Proc. of A A A I-96, pages 556–561, 1996.
B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In Proc. of KR-91, pages 417–428, 1991.
B. Nebel. Base revision operations and schemes: Semantics, representation and complexity. In Proc. of ECAI-94, pages 341–345, 1994.
M. Williams. Transmutations of knowledge systems. In Proc. of KR-94, pages 619–629, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liberatore, P. (1996). The complexity of iterated belief revision. In: Afrati, F., Kolaitis, P. (eds) Database Theory — ICDT '97. ICDT 1997. Lecture Notes in Computer Science, vol 1186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62222-5_51
Download citation
DOI: https://doi.org/10.1007/3-540-62222-5_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62222-2
Online ISBN: 978-3-540-49682-3
eBook Packages: Springer Book Archive