Ranking Functions and Rankings on Languages

Artificial Intelligence 170 (4-5):462-471 (2006)
  Copy   BIBTEX

Abstract

The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W —defined on a field of propositions A over W. This research note shows under which conditions ranking functions on a field of propositions A over W and rankings on a language L are induced by pointwise ranking functions on W and the set of models for L, ModL, respectively.

Other Versions

No versions found

Analytics

Added to PP
2009-01-28

Downloads
647 (#32,877)

6 months
117 (#53,537)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Franz Huber
University of Toronto, St. George Campus

Citations of this work

Degrees of belief.Franz Huber & Christoph Schmidt-Petri (eds.) - 2009 - London: Springer.
Belief and Degrees of Belief.Franz Huber - 2009 - In Franz Huber & Christoph Schmidt-Petri (eds.), Degrees of belief. London: Springer.
The Consistency Argument for Ranking Functions.Franz Huber - 2007 - Studia Logica 86 (2):299-329.

View all 20 citations / Add more citations