We introduce the new probabilistic description logic (DL) BEL, which extends the light-weight DL EL with the possibility of expressing uncertainty about the validity of some knowledge. Contrary to other probabilistic DLs, BEL is designed to represent classical knowledge that depends on an uncertain context; that is, some of the knowledge may hold or not depending on the current situation. The probability distribution of these contexts is expressed by a Bayesian network (BN). We study different reasoning problems in BEL, providing tight complexity bounds for all of them. One particularly interesting property of our framework is that reasoning can be decoupled between the logical (i.e., EL), and the probabilistic (i.e., the BN) components. We later generalize all the notions presented to introduce Bayesian extensions of arbitrary ontology languages. Using the decoupling property, we are able to provide tight complexity bounds for reasoning in the Bayesian extensions of many other DLs. We provide a detailed analysis of our formalism w.r.t. the assumptions made and compare it with the existing approaches
Ceylan, I., Peñaloza, R. (2017). The Bayesian Ontology Language BEL. JOURNAL OF AUTOMATED REASONING, 58(1), 67-95 [10.1007/s10817-016-9386-0].
The Bayesian Ontology Language BEL
Peñaloza, R
2017
Abstract
We introduce the new probabilistic description logic (DL) BEL, which extends the light-weight DL EL with the possibility of expressing uncertainty about the validity of some knowledge. Contrary to other probabilistic DLs, BEL is designed to represent classical knowledge that depends on an uncertain context; that is, some of the knowledge may hold or not depending on the current situation. The probability distribution of these contexts is expressed by a Bayesian network (BN). We study different reasoning problems in BEL, providing tight complexity bounds for all of them. One particularly interesting property of our framework is that reasoning can be decoupled between the logical (i.e., EL), and the probabilistic (i.e., the BN) components. We later generalize all the notions presented to introduce Bayesian extensions of arbitrary ontology languages. Using the decoupling property, we are able to provide tight complexity bounds for reasoning in the Bayesian extensions of many other DLs. We provide a detailed analysis of our formalism w.r.t. the assumptions made and compare it with the existing approachesFile | Dimensione | Formato | |
---|---|---|---|
Ceylan-2017-J Autom Reasoning-AAM.pdf
accesso aperto
Descrizione: Article
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Licenza:
Altro
Dimensione
468.18 kB
Formato
Adobe PDF
|
468.18 kB | Adobe PDF | Visualizza/Apri |
Ceylan-2017-J Autom Reasoning-VoR.pdf
Solo gestori archivio
Descrizione: Article
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Licenza:
Tutti i diritti riservati
Dimensione
802.71 kB
Formato
Adobe PDF
|
802.71 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.