Skip to main content

Belief Revision Revisited

  • Conference paper
  • 1444 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3789))

Abstract

In this paper, we propose a new belief revision operator, together with a method of its calculation. Our formalization differs from most of the traditional approaches in two respects. Firstly, we formally distinguish between defeasible observations and indefeasible knowledge about the considered world. In particular, our operator is differently specified depending on whether an input formula is an observation or a piece of knowledge. Secondly, we assume that a new observation, but not a new piece of knowledge, describes exactly what a reasoning agent knows at the moment about the aspect of the world the observation concerns.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Katsuno, H., Mendelzon, A.O.: On the Difference between Updating a Knowledge Base and Revising It. In: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pp. 387–394 (1991)

    Google Scholar 

  3. Delgrande, J.P., Schaub, T.: A consistency-based approach for belief change. Artificial Intelligence Journal 151, 1–41 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Delgrande, J.P., Nayak, A.C., Pagnucco, M.: Gricean belief change. Studia Logica (2004), (To appear). Electronic version can be found at http://www.cs.sfu.ca/jim/publications.html

  5. Brown, F.M.: Boolean Reasoning. Kluwer Academic Publishers, Dordrecht (1990)

    MATH  Google Scholar 

  6. Quine, W.: A way to simplify truth functions. American Mathematical Monthly 62, 627–631 (1955)

    Article  MATH  MathSciNet  Google Scholar 

  7. Grove, A.: Two modellings for theory change. Journal of Philosophical Logic 17, 157–170 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Doherty, P., Łukaszewicz, W., Madalinska-Bugaj, E.: The PMA and Relativizing Minimal Change for Action Update. Fundamenta Informaticae 44, 95–131 (2000)

    MATH  MathSciNet  Google Scholar 

  9. Darwiche, A., Pearl, J.: On the logic of iterated revision. Artificial Intelligence Journal 89, 1–29 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madalińska-Bugaj, E., Łukaszewicz, W. (2005). Belief Revision Revisited. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_4

Download citation

  • DOI: https://doi.org/10.1007/11579427_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29896-0

  • Online ISBN: 978-3-540-31653-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics