Recently, Bayesian extensions of Description Logics, and in particular the logic BEL, were introduced as a means of representing certain knowledge that depends on an uncertain context. In this paper we introduce a novel structure, called proof structure, that encodes the contextual information required to deduce subsumption relations from a BEL knowledge base. Using this structure, we show that probabilistic reasoning in BEL can be reduced in polynomial time to standard Bayesian network inferences, thus obtaining tight complexity bounds for reasoning in BEL.
CITATION STYLE
Ceylan, İ. İ., & Peñaloza, R. (2014). Tight complexity bounds for reasoning in the description logic BEL. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8761, 77–91. https://doi.org/10.1007/978-3-319-11558-0_6
Mendeley helps you to discover research relevant for your work.