Using transfinite ordinal conditional functions

5Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Konieczny, S. (2009). Using transfinite ordinal conditional functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 396–407). https://doi.org/10.1007/978-3-642-02906-6_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free