Complexity of the Description Logic ALCM
Abstract
In this paper we show that the problem of checking consistency of a knowledge base in the Description Logic ALCM is ExpTime-complete. The M stands for meta-modelling as defined by Motz, Rohrer and Severi. To show our main result, we define an ExpTime Tableau algorithm as an extension of an algorithm for checking consistency of a knowledge base in ALC by Nguyen and Szalas.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2015
- DOI:
- 10.48550/arXiv.1511.03749
- arXiv:
- arXiv:1511.03749
- Bibcode:
- 2015arXiv151103749M
- Keywords:
-
- Computer Science - Logic in Computer Science;
- Computer Science - Artificial Intelligence
- E-Print:
- Long version of a submitted paper, 43 pages