The Complexity of Finite Model Reasoning in Description Logics

摘要

We analyze the complexity of finite model reasoning in the description logic ALLQT, i.e. ALL 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 ALLQI is not harder than standard reasoning with ALLQI.