Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation

18Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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 CS 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. © 2012 Elsevier Inc. All.

Cite

CITATION STYLE

APA

Gilio, A., & Sanfilippo, G. (2013). Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation. International Journal of Approximate Reasoning, 54(4), 513–525. https://doi.org/10.1016/j.ijar.2012.11.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free