Search results for "g-coherence"
showing 10 items of 12 documents
Coherent conditional probabilities and proper scoring rules
2011
In this paper we study the relationship between the notion of coherence for conditional probability assessments on a family of conditional events and the notion of admissibility with respect to scoring rules. By extending a recent result given in literature for unconditional events, we prove, for any given strictly proper scoring rule s, the equivalence between the coherence of a conditional probability assessment and its admissibility with respect to s. In this paper we focus our analysis on the case of continuous bounded scoring rules. In this context a key role is also played by Bregman divergence and by a related theoretical aspect. Finally, we briefly illustrate a possible way of defin…
Square of Opposition Under Coherence
2016
Various semantics for studying the square of opposition have been proposed recently. So far, only (Gilio et al., 2016) studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized qu…
Some results on generalized coherence of conditional probability bounds
2003
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional probability bounds. Our notion of g-coherence is equivalent to the 'avoiding uniform loss' property for lower and upper probabilities (a la Walley). Moreover, given a g-coherent imprecise assessment by our algorithms we can correct it obtaining the associated coherent assessment (in the sense of Walley and Williams). As is well known, the problems of checking g-coherence and propagating tight g-coherent intervals are NP and FP^NP complete, respectively, and thus NP-hard. Two notions which may be helpful to reduce co…
Logical Conditions for Coherent Qualitative and Numerical Probability Assessments
2003
Coherence Checking and Propagation of Lower Probability Bounds
2003
In this paper we use imprecise probabilities, based on a concept of generalized coherence (g-coherence), for the management of uncertain knowledge and vague information. We face the problem of reducing the computational difficulties in g-coherence checking and propagation of lower conditional probability bounds. We examine a procedure, based on linear systems with a reduced number of unknowns, for the checking of g-coherence. We propose an iterative algorithm to determine the reduced linear systems. Based on the same ideas, we give an algorithm for the propagation of lower probability bounds. We also give some theoretical results that allow, by suitably modifying our algorithms, the g-coher…
Probabilistic Logic under Coherence: Complexity and Algorithms
2005
In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…
Imprecise probability assessments and the Square of Opposition
There is a long history of investigations on the square of opposition spanning over two millenia. A square of opposition represents logical relations among basic sentence types in a diagrammatic way. The basic sentence types, traditionally denoted by A (universal affirmative: ''Every S is P''), E (universal negative: ''No S is P''), I (particular affirmative: ''Some S are P''), and O (particular negative: ''Some S are not P''), constitute the corners of the square, and the logical relations--contradiction, contrarity, subalternation, and sub-contrarity--form the diagonals and the sides of the square. We investigate the square of opposition from a probabilistic point of view. To manage impre…
Probabilistic Logic under Coherence‚ Model−Theoretic Probabilistic Logic‚ and Default Reasoning in System P
2016
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System P. In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System P. That is, we provide a new probabilistic semantics for System P, which neither uses infinitesimal probabilities nor atomic bound (or bi…
Generalized coherence and connection property of imprecise conditional previsions.
2008
In this paper we consider imprecise conditional prevision assessments on random quantities with finite set of possible values. We use a notion of generalized coherence which is based on the coherence principle of de Finetti. We consider the checking of g-coherence, by extending some previous results obtained for imprecise conditional probability assessments. Then, we study a connection property of interval-valued gcoherent prevision assessments, by extending a result given in a previous paper for precise assessments.
Algorithms for coherence checking and propagation of conditional probability bounds
2001
In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of va…