Complexity of the Description Logic ALCM
Martinez, Monica (Universidad de la República) | Roher, Edelweis (Universidad de la República) | Severi, Paula (University of Leicester)
In this paper we show that the problem of deciding the 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 ALC by Nguyen and Szalas.
Apr-19-2016
- Country:
- Europe
- Germany > North Rhine-Westphalia
- Cologne Region > Aachen (0.04)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Leicestershire > Leicester (0.05)
- Germany > North Rhine-Westphalia
- South America > Uruguay (0.04)
- Europe
- Technology: