Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A closer look at the probabilistic description logic prob-EL

Gutierrez Basulto, Victor ORCID:, Jung, Jean Christoph, Lutz, Carsten and Schroder, Lutz 2011. A closer look at the probabilistic description logic prob-EL. Presented at: Twenty-Fifth {AAAI} Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011.

Full text not available from this repository.


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.

Item Type: Conference or Workshop Item (Paper)
Status: Published
Schools: Computer Science & Informatics
Date of First Compliant Deposit: 5 June 2018
Last Modified: 23 Oct 2022 13:52

Citation Data

Cited 11 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item