Skip to main content

Constructive Models for Contraction with Intransitive Plausibility Indifference

  • Conference paper
Logics in Artificial Intelligence (JELIA 2014)

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

Included in the following conference series:

  • 1126 Accesses

Abstract

Plausibility rankings play a central role in modeling Belief Change, and they take different forms depending on the type of belief change under consideration: preorders on possible worlds, epistemic entrenchments, etc. A common feature of all these structures is that plausibility indifference is assumed to be transitive. In a previous article, [7], we argued that this is not always the case, and we introduced new sets of postulates for revision and contraction (weaker variants of the classical AGM postulates), that are liberated from the indifference transitivity assumption. Herein we complete the task by making the necessary adjustments to the epistemic entrenchment and the partial meet models. In particular we lift the indifference transitivity assumption from both these two models, and we establish representation results connecting the weaker models with the weaker postulates for contraction introduced in [7].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchourron, C., Gardenfors, P., Makinson, D.: On the logic of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gardenfors, P.: Knowledge in Flux. MIT Press (1988)

    Google Scholar 

  3. Gardenfors, P., Makinson, D.: Revisions of knowledge systems using epistemic entrenchment. In: Proceedings of Theoretical Aspects of Reasoning about Knowledge, pp. 83–95. Morgan-Kaufmann (1988)

    Google Scholar 

  4. Katsuno, H., Mendelzon, A.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52(3), 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  5. Luce, R.D.: Semiorders and a theory of utility discrimination. Econometrica 24(2), 178–191 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  6. Peppas, P.: Belief revision. In: Handbook of Knowledge Representation, pp. 317–359. Elsevier Science (2008)

    Google Scholar 

  7. Peppas, P., Williams, M.A.: Belief change and semiorders. In: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014 (2014)

    Google Scholar 

  8. Rabinovitch, I.: The Scott-Suppes theorem on semiorders. Journal of Mathematical Psychology 1 (1977)

    Google Scholar 

  9. Rott, H.: Three floors for the theory of theory change. In: The Logica Yearbook 2013 (2014)

    Google Scholar 

  10. Scott, D., Suppes, P.: Foundational aspects of theories of measurement. Journal of Symbolic Logic 23(2) (1958)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Peppas, P., Williams, MA. (2014). Constructive Models for Contraction with Intransitive Plausibility Indifference. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11558-0_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11557-3

  • Online ISBN: 978-3-319-11558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics