A tableaux-based algorithm for SHIQ with transitive closure of roles in concept and role inclusion axioms

Authors:
Chan Le Duc;Myriam Lamolle;Olivier Curé
Affiliations:
LIASD Université Paris, France;LIASD Université Paris, France;LIGM Université Paris-Est, France
Venue:
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Year:
2011

Citing 8
Cited 0

Boosting the correspondence between description logics and propositional dynamic logics

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Practical Reasoning for Expressive Description Logics

LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
A Tableau Decision Procedure for $\mathcal{SHOIQ}$

Journal of Automated Reasoning
Decidability of $\mathcal{SHI}$ with Transitive Closure of Roles

ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
The complexity of reasoning with cardinality restrictions and nominals in expressive description logics

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
Decidability of SHIQ with complex role inclusion axioms

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate an extension of the description logic SHIQ--a knowledge representation formalism used for the SemanticWeb--with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. It was proved that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. We have identified a kind of role inclusion axioms that is responsible for this undecidability and we propose a restriction on these axioms to obtain decidability. Next, we present a tableaux-based algorithm that decides satisfiability of concepts in the new logic.