The complexity of finite model reasoning in description logics

    Information & Computation, Volume 199, Issue 1-2, 2005, Pages 132-171.

    Cited by: 60|Bibtex|Views5|Links
    EI
    Keywords:
    03b70number restrictiongeneral tboxesstandard reasoningnumber restrictionsMore(11+)

    Abstract:

    We analyze the complexity of finite model reasoning in the description logic ALC QI\mathcal{ALC QI}, i.e. ALC\mathcal{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 ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments