Abstract
Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from the set of worlds to the set of ordinals. But in subsequent paper by Spohn and others, OCFs are just used as functions from the set of worlds to natural numbers (plus eventually + ∞). The use of transfinite ordinals in this framework has never been studied. This paper opens this way. We study generalisations of transmutations operators to transfinite ordinals. Using transfinite ordinals allows to represent different “levels of beliefs”, that naturally appear in real applications. This can be viewed as a generalisation of the usual “two levels of beliefs” framework: knowledge versus beliefs; or rules base versus facts base, issued from expert systems works.
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 contraction and revision functions. Journal of Symbolic Logic 50, 510–530 (1985)
Boutilier, C.: Iterated revision and minimal change of conditional beliefs. Journal of Philosophical Logic 25(3), 262–305 (1996)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artificial Intelligence 89, 1–29 (1997)
Dubois, D.: Three scenarios for the revision of epistemic states. Journal of Logic and Computation 18(5), 721–738 (2008)
Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)
Friedman, N., Halpern, J.Y.: Belief revision: a critique. In: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 421–431 (1996)
Gärdenfors, P.: Knowledge in flux. MIT Press, Cambridge (1988)
Herzig, A., Rifi, O.: Update operations: a review. In: Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI 1998), pp. 13–17 (1998)
Lang, J., Delgrande, J.P., Dubois, D.: Iterated revision as prioritized merging. In: Proceedings of the tenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 210–220 (2006)
Jin, Y., Thielscher, M.: Iterated belief revision, revised. Artificial Intelligence 171, 1–18 (2007)
Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In: Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 387–394 (1991)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52, 263–294 (1991)
Meyer, T.: On the semantics of combination operations. Journal of Applied Non Classical Logics 11(1/2), 59–84 (2001)
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, pp. 105–134. Kluwer, Dordrecht (1988)
Spohn, W.: Ranking Functions, AGM Style. Internet Festschrift for Peter Gärdenfors, Lund (1999)
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
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konieczny, S. (2009). Using Transfinite Ordinal Conditional Functions. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-02906-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02905-9
Online ISBN: 978-3-642-02906-6
eBook Packages: Computer ScienceComputer Science (R0)