Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Tableau Algorithms for Description Logics
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Concept Language Extended with Different Kinds of Transitive Roles
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Journal of Artificial Intelligence Research
What's in an aggregate: foundations for description logics with tuples and sets
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
| Hi-index | 0.00 |
This paper investigates a Description Logic, namely $\mathcal{SHI}_+$, which extends $\mathcal{SHI}$ by adding transitive closure of roles. The resulting logic $\mathcal{SHI}_+$ allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. We show that $\mathcal{SHI}_+$ is decidable by devising a terminating, sound and complete algorithm for deciding satisfiability of concepts in $\mathcal{SHI}_+$ with respect to a set of concept and role inclusion axioms.