当前位置: X-MOL 学术Theory Pract. Log. Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The Probabilistic Description Logic
Theory and Practice of Logic Programming ( IF 1.4 ) Pub Date : 2020-12-11 , DOI: 10.1017/s1471068420000460
LEONARD BOTHA , THOMAS MEYER , RAFAEL PEÑALOZA

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty. A probabilistic extension of a light-weight DL was recently proposed for dealing with certain knowledge occurring in uncertain contexts. In this paper, we continue that line of research by introducing the Bayesian extension of the propositionally closed DL . We present a tableau-based procedure for deciding consistency and adapt it to solve other probabilistic, contextual, and general inferences in this logic. We also show that all these problems remain ExpTime-complete, the same as reasoning in the underlying classical .

中文翻译:

概率描述逻辑

描述逻辑(DL)是著名的知识表示形式,专注于术语知识的表示。由于它们的一阶语义,这些语言(以其经典形式)不适合表示和处理不确定性。最近提出了轻量级 DL 的概率扩展,用于处理在不确定环境中发生的某些知识。在本文中,我们通过引入贝叶斯扩展来继续这一研究方向命题封闭的 DL. 我们提出了一个基于表格的程序来确定一致性,并对其进行调整以解决该逻辑中的其他概率、上下文和一般推理。我们还表明,所有这些问题仍然是 ExpTime-complete,与基础经典中的推理相同.
更新日期:2020-12-11
down
wechat
bug