Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$

DOI10.1007/978-3-319-11558-0_6zbMath1432.68434OpenAlexW170626393MaRDI QIDQ2938485

Rafael Peñaloza, İsmail İlkan Ceylan

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)

Related Items (2)

The Bayesian ontology language \(\mathcal {BEL}\) ⋮ The Probabilistic Description Logic

This page was built for publication: Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$