Tight complexity bounds for reasoning in the description logic BEL

DOI10.1007/978-3-319-11558-0_6MaRDI QIDQ2938485zbMATH OpenOpenAlexFDO

Authors İsmail İlkan Ceylan, Rafael Peñaloza

Publication date 14 January 2015

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11558-0_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The Bayesian ontology language \(\mathcal {BEL}\)
• The Bayesian description logic \({\mathcal{BEL}}\)
• Probabilistic description logics for subjective uncertainty
• Probabilistic reasoning in the description logic \(\mathcal {ALCP}\) with the principle of maximum entropy
• The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)

Cited in

(5)

• A Bayesian extension of the description logic \(\mathcal{ALC}\)
• The Bayesian ontology language \(\mathcal {BEL}\)
• The descriptive complexity of Bayesian network specifications
• The Bayesian description logic \({\mathcal{BEL}}\)
• The Probabilistic Description Logic

This page was built for publication: Tight complexity bounds for reasoning in the description logic \(\mathcal{BEL}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938485)