Complexity of the Description Logic ALCM
Logic in Computer Science
2015-11-13 v1 Artificial Intelligence
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.
Keywords
Cite
@article{arxiv.1511.03749,
title = {Complexity of the Description Logic ALCM},
author = {Monica Martinez and Edelweis Rohrer and Paula Severi},
journal= {arXiv preprint arXiv:1511.03749},
year = {2015}
}
Comments
Long version of a submitted paper, 43 pages