The complexity of iterated belief revision

  • Paolo Liberatore
Contributed Papers Session 5: Logic and Databases II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1186)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AGM85]
    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.Google Scholar
  2. [Bou93]
    Boutilier. Revision sequences and nested conditionals. In Proc. of IJCAI-93, pages 519–525, 1993.Google Scholar
  3. [CDLS95]
    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.Google Scholar
  4. [Dal88]
    M. Dalal. Investigations into a theory of knowledge base revision: Preliminary report. In Proc. of AAAI-88, pages 475–479, 1988.Google Scholar
  5. [EG92]
    T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. AIJ, 57:227–270, 1992.Google Scholar
  6. [EG93]
    T. Eiter and G. Gottlob. The complexity of nested counterfactuals and iterated knowledge base revisions. In Proc. of IJCAI-93, pages 526–531, 1993.Google Scholar
  7. [FH94]
    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.Google Scholar
  8. [GM95]
    G. Grahne and A. O. Mendelzon. Updates and subjunctive queries. Information and Computation, 2(116):241–252, 1995.Google Scholar
  9. [Joh90]
    D. S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier, 1990.Google Scholar
  10. [KM91]
    H. Katsuno and A. O. Mendelzon. Propositional knowledge base revision and minimal change. AIJ, 52:263–294, 1991.Google Scholar
  11. [Kre88]
    M. V. Krentel. The complexity of optimization problems. J. of Computer and System Sciences, 36:490–509, 1988.Google Scholar
  12. [Leh95]
    D. Lehmann. Belief revision, revised. In Proc. of IJCAI-95, pages 1534–1540, 1995.Google Scholar
  13. [LS95]
    P. Liberatore and M. Schaerf. Relating belief revision and circumscription. In Proc. of IJCAI-95, pages 1557–1563, 1995.Google Scholar
  14. [LS96]
    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.Google Scholar
  15. [Neb91]
    B. Nebel. Belief revision and default reasoning: Syntax-based approaches. In Proc. of KR-91, pages 417–428, 1991.Google Scholar
  16. [Neb94]
    B. Nebel. Base revision operations and schemes: Semantics, representation and complexity. In Proc. of ECAI-94, pages 341–345, 1994.Google Scholar
  17. [Wil94]
    M. Williams. Transmutations of knowledge systems. In Proc. of KR-94, pages 619–629, 1994.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Paolo Liberatore
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomeItaly

Personalised recommendations