| Full text | |
| Author(s): |
Cozman, Fabio Gagliardi
Total Authors: 1
|
| Document type: | Journal article |
| Source: | INTERNATIONAL JOURNAL OF APPROXIMATE REASONING; v. 103, p. 124-138, DEC 2018. |
| Web of Science Citations: | 0 |
| Abstract | |
An evenly convex credal set is a set of probability measures that is evenly convex; that is, a set that is an arbitrary intersection of open halfspaces. An evenly convex credal set can for instance encode preference judgments through strict and non-strict inequalities such as P(A) > 1/2 and P(A) <= 2/3. This paper presents an axiomatization of evenly convex sets from preferences, where we introduce a new (and very weak) Archimedean condition. We examine the duality between preference orderings and credal sets; we also consider assessments of almost preference and natural extensions. We then discuss regular conditioning, a concept that is closely related to evenly convex sets. (C) 2018 Elsevier Inc. All rights reserved. (AU) | |
| FAPESP's process: | 16/18841-0 - Inference and learning algorithms for probabilistic logic programming |
| Grantee: | Fabio Gagliardi Cozman |
| Support Opportunities: | Research Grants - Research Partnership for Technological Innovation - PITE |
| FAPESP's process: | 15/21880-4 - PROVERBS -- PRobabilistic OVERconstrained Boolean Systems: reasoning tools and applications |
| Grantee: | Marcelo Finger |
| Support Opportunities: | Regular Research Grants |