The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)

DOI10.1007/978-3-030-29007-8_10zbMath1435.68309OpenAlexW2969297814MaRDI QIDQ2180224

Andreas Ecke, Gabriele Kern-Isberner, Marco Wilhelm, Franz Baader

Publication date: 13 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-29007-8_10

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A reconstruction of multipreference closure

This page was built for publication: The complexity of the consistency problem in the probabilistic description logic \(\mathcal{ALC}^\mathsf{ME}\)