Abstract
This paper investigates a Description Logic, namely SHI + which extends SHI by adding transitive closure of roles. The resulting logic SHI + allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. We show that SHI + is decidable by devising a terminating, sound and complete algorithm for deciding satisfiability of concepts in SHI + with respect to a set of concept and role inclusion axioms. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Le Duc, C. (2009). Decidability of SHI with transitive closure of roles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5554 LNCS, pp. 368–383). https://doi.org/10.1007/978-3-642-02121-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
