Probabilistic Query Answering in the Bayesian Description Logic BEL
Probabilistic Query Answering in the Bayesian Description Logic BEL
复制标题
贝叶斯描述逻辑 BEL 中的概率查询应答
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
R. Peñaloza
中科院分区：
文献类型：
--
作者：
I. Ceylan;R. Peñaloza
\（\ Mathcal {Be {} l} \）是一个概率描述逻辑（DL），扩展了轻质重量DL \（\ Mathcal {e {e {} l} \），并在公理上具有共同的概率分布贝叶斯网络（BN）的帮助。在最近的工作中，已经证明\（\ Mathcal {Be {} l} \）中标准逻辑推理的复杂性与BN上执行概率推断相同。
\(\mathcal {BE{}L}\) is a probabilistic description logic (DL) that extends the light-weight DL \(\mathcal {E{}L}\) with a joint probability distribution over the axioms, expressed with the help of a Bayesian network (BN). In recent work it has been shown that the complexity of standard logical reasoning in \(\mathcal {BE{}L}\) is the same as performing probabilistic inferences over the BN.