Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation
arXiv:1301.0958 · doi:10.1016/j.ijar.2012.11.001
Abstract
In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F. We also illustrate some alternative theorems related with p-consistency and p-entailment. Finally, we deepen the study of the connections between the notions of p-entailment and inclusion relation by introducing for a pair (F,E|H) the (possibly empty) class K of the subsets S of F such that C(S) implies E|H. We show that the class K satisfies many properties; in particular K is additive and has a greatest element which can be determined by applying a suitable algorithm.
References in corpus (2)
Cited by in corpus (13)
- Conditional Random Quantities and Compounds of Conditionals
- Quasi Conjunction, Quasi Disjunction, T-norms and T-conorms: Probabilistic Aspects
- Probabilistic squares and hexagons of opposition under coherence
- Probabilistic inferences from conjoined to iterated conditionals
- Probabilities of conditionals and previsions of iterated conditionals
- Generalized Logical Operations among Conditional Events
- Algebraic aspects and coherence conditions for conjoined and disjoined conditionals
- Probabilistic entailment and iterated conditionals
- Interpreting connexive principles in coherence-based probability logic
- Iterated Conditionals and Characterization of P-entailment
- On Trivalent Logics, Compound Conditionals, and Probabilistic Deduction Theorems
- Transitive reasoning with imprecise probabilities
- A Generalized Probabilistic Version of Modus Ponens