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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Devlin, K.: The Joy of Sets. Springer (1993)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial Intelligence 89(1-2), 1–29 (1997)
Kern-Isberner, G.: Postulates for conditional belief revision. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 186–191 (1999)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52(2), 263–294 (1992)
Konieczny, S.: Using transfinite ordinal conditional functions. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 396–407. Springer, Heidelberg (2009)
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)
Lewis, D.: Counterfactuals. Harvard University Press (1973)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)