The description logic SHI extends the basic description logic ALC with transitive roles, role hierarchies and inverse roles. The known tableau-based decision procedure [9] for SHI exhibit (at least) NEXP-TIME behaviour even though SHI is known to be EXPTIME-complete. The automata-based algorithms for SHI often yield optimal worst-case complexity results, but do not behave well in practice since good optimisations for them have yet to be found. We extend our method for global caching in ALC to SHI by adding analytic cut rules, thereby giving the first EXPTIME tableau-based decision procedure for SHI, and showing one way to incorporate global caching and inverse roles. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Goré, R., & Nguyen, L. A. (2007). EXPTIME tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4548 LNAI, pp. 133–148). Springer Verlag. https://doi.org/10.1007/978-3-540-73099-6_12
Mendeley helps you to discover research relevant for your work.