Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Logic, Rationality and Interaction

LORI 2015: Logic, Rationality, and Interaction pp 416–420Cite as

Infinite Ordinals and Finite Improvement

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9394))

Abstract

Ordinal Conditional Functions assign every state an ordinal value representing its plausibility. In most existing work, plausibility values are restricted to the set of natural numbers; however, the fully general theory allows infinite values as well. In this paper, we explore simple arithmetical approaches to belief revision with ordinal conditional functions that might take infinite plausibility values. We suggest that infinite values need not be seen as a mathematical artifact of the theory; they provide a natural tool for a generalized form of conditional reasoning.

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

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

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 of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic 50(2), 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Devlin, K.: The Joy of Sets. Springer (1993)

    Google Scholar 

  3. Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial Intelligence 89(1-2), 1–29 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kern-Isberner, G.: Postulates for conditional belief revision. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 186–191 (1999)

    Google Scholar 

  5. Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52(2), 263–294 (1992)

    MathSciNet  MATH  Google Scholar 

  6. Konieczny, S.: Using transfinite ordinal conditional functions. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 396–407. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Konieczny, S., Péréz, R.P.: Improvement operators. In: Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 177–186 (2008)

    Google Scholar 

  8. Lewis, D.: Counterfactuals. Harvard University Press (1973)

    Google Scholar 

  9. Spohn, W.: Ordinal conditional functions. A dynamic theory of epistemic states. In: Harper, W.L., Skyrms, B. (eds.) Causation in Decision, Belief Change, and Statistics, vol. II, pp. 105–134. Kluwer Academic Publishers (1988)

    Google Scholar 

  10. Williams, M.A.: Transmutations of knowledge systems. In: Proceedings of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning (KR 1994), pp. 619–629 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. British Columbia Institute of Technology, Burnaby, Canada

    Aaron Hunter

Authors
  1. Aaron Hunter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aaron Hunter .

Editor information

Editors and Affiliations

  1. Dept of Comp Sci, Univ of Liverpool, Liverpool, United Kingdom

    Wiebe van der Hoek

  2. Department of Philosophy, Group in Logic & the Methodology of Sci. University of California, Berkeley, California, USA

    Wesley H. Holliday

  3. Institute of Philosophy of Mind and Cognition, National Yang-Ming University, Taipei, Taiwan

    Wen-fang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hunter, A. (2015). Infinite Ordinals and Finite Improvement. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48561-3_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48560-6

  • Online ISBN: 978-3-662-48561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation