A Closer Look at the Probabilistic Description Logic Prob-EL

Authors

  • Víctor Gutiérrez Basulto University of Bremen
  • Jean Christoph Jung University of Bremen
  • Carsten Lutz University of Bremen
  • Lutz Schröder University of Bremen

Abstract

We study probabilistic variants of the description logic EL. For the case where probabilities apply only to concepts, we provide a careful analysis of the borderline between tractability and ExpTime-completeness. One outcome is that any probability value except zero and one leads to intractability in the presence of general TBoxes, while this is not the case for classical TBoxes. For the case where probabilities can also be applied to roles, we show PSpace-completeness. This result is (positively) surprising as the best previously known upper bound was 2-ExpTime and there were reasons to believe in completeness for this class.

Downloads

Published

2011-08-04

How to Cite

Gutiérrez Basulto, V., Jung, J. C., Lutz, C., & Schröder, L. (2011). A Closer Look at the Probabilistic Description Logic Prob-EL. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 197-202. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/7856

Issue

Section

AAAI Technical Track: Knowledge Representation and Reasoning