Abstract
We analyze the complexity of finite model reasoning in the description logic ALCQI, i.e. ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Cite
CITATION STYLE
Lutz, C., Sattler, U., & Tendera, L. (2003). The complexity of finite model reasoning in description logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 60–74). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
