We study the coherent extensions of a given probability assessment on n conditional events to their quasi conjunction; we also consider special cases of logical dependencies. We examine the probabilistic semantics of QAND rule introduced by Dubois and Prade; then, we deepen some probabilistic aspects on the Adams notion of p-entailment and quasi conjunction.
Gilio, A., Sanfilippo, G. (2010). Quasi conjunction and p-entailment in nonmonotonic reasoning. In C. Borgelt, G.G. Rodríguez, W. Trutschnig, M.A. Lubiano, M.Á. Gil, P. Grzegorzewski, et al. (a cura di), Combining soft computing and statistical methods in data analysis (pp. 321-328). Berlin, Heidelberg : Springer-Verlag [10.1007/978-3-642-14746-3_40].
Quasi conjunction and p-entailment in nonmonotonic reasoning
SANFILIPPO, Giuseppe
2010-01-01
Abstract
We study the coherent extensions of a given probability assessment on n conditional events to their quasi conjunction; we also consider special cases of logical dependencies. We examine the probabilistic semantics of QAND rule introduced by Dubois and Prade; then, we deepen some probabilistic aspects on the Adams notion of p-entailment and quasi conjunction.
| File | Dimensione | Formato | |
|---|---|---|---|
|
smps2010_original.pdf
Solo gestori archvio
Dimensione
361.38 kB
Formato
Adobe PDF
|
361.38 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
