Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Countably Minimitive Ranking Function

Chapter 198
Encyclopedia of Artificial Intelligence
A ranking function ? on a s-field of propositions A is countably minimitive if and only if ?(A1?…?An?) = min{?(A1), …, ?(An), …} for all propositions A1 ? A,… An ? A, …
Published in Chapter:
Ranking Functions
Franz Huber (California Institute of Technology, USA)
Copyright: © 2009 |Pages: 5
DOI: 10.4018/978-1-59904-849-9.ch198
Abstract
Ranking functions have been introduced under the name of ordinal conditional functions in Spohn (1988; 1990). They are representations of epistemic states and their dynamics. The most comprehensive and up to date presentation is Spohn (manuscript).
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR