We deal with the problem of computing efficiently the closure of a set of independencies, compatible with a coherent conditional probability, under cs-independence. For this aim we provide two inferential rules, winch allow to build a basis for the closure.
Inferential rules for weak graphoid / Busanello, Giuseppe; Vantaggi, Barbara. - STAMPA. - 77(2010), pp. 57-64. ((Intervento presentato al convegno 5th International Conference on Soft Methods in Probability and Statistics tenutosi a Oviedo and Mieres, SPAIN nel SEP 28-OCT 01, 2010. - ADVANCES IN INTELLIGENT AND SOFT COMPUTING. [10.1007/978-3-642-14746-3_8].
Inferential rules for weak graphoid
BUSANELLO, GIUSEPPE;VANTAGGI, Barbara
2010
Abstract
We deal with the problem of computing efficiently the closure of a set of independencies, compatible with a coherent conditional probability, under cs-independence. For this aim we provide two inferential rules, winch allow to build a basis for the closure.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
