Publication type: |
Article in Proceedings |
Author: |
Victor Gutierrez-Basulto, Jean Christoph Jung, Carsten Lutz, Lutz Schröder |
Editor: |
Wolfram Burgard, Dan Roth |
Title: |
A Closer Look at the Probabilistic Description Logic Prob-EL |
Book / Collection title: |
Proc. 25th Conference on Artificial Intelligence (AAAI-11) |
Page(s): |
197 – 202 |
Year published: |
2011 |
Publisher: |
AAAI Press |
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 2ExpTime and there were
reasons to believe in completeness for this class.
|
Keywords: |
Probabilistic description logic EL complexity convexity |
Status: |
Reviewed |
Last updated: |
13. 09. 2011 |