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.

Author's Profile

Franz Huber
University of Toronto, St. George Campus

Analytics

Added to PP
2009-01-28

Downloads
679 (#33,326)

6 months
92 (#61,270)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?