A Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

A Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms

Résumé

In this paper, we investigate an extension of the description logic SHIQ -a knowledge representation formalism used for the Semantic Web-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.
Fichier principal
Vignette du fichier
eswc2011Final.pdf (332.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00738380 , version 1 (11-03-2013)

Identifiants

Citer

Chan Le Duc, Myriam Lamolle, Olivier Curé. A Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms. 8th Extended Semantic Web Conference (ESWC 2011), May 2011, Heraklion, Crete, Greece. pp.367-381, ⟨10.1007/978-3-642-21034-1_25⟩. ⟨hal-00738380⟩
144 Consultations
205 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More