Abstract
In this paper, we investigate an extension of the description logic \(\mathcal{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 \(\mathcal{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.
Chapter PDF
Similar content being viewed by others
References
Patel-Schneider, P., Hayes, P., Horrocks, I.: Owl web ontology language semantics and abstract syntax. In: W3C Recommendation (2004)
Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. Journal of Artificial Intelligence Research 12, 199–217 (2000)
Le Duc, C.: Decidability of \(\mathcal{SHI}\) with transitive closure of roles. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. LNCS, vol. 5554, pp. 368–383. Springer, Heidelberg (2009)
Le Duc, C., Lamolle, M.: Decidability of description logics with transitive closure of roles. In: Proceedings of the 23rd International Workshop on Description Logics (DL 2010), CEUR-WS.org (2010)
De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics. In: Proceedings of the 12th National Conference on Artificial Intelligence, pp. 205–212. The MIT Press, Cambridge (1994)
De Giacomo, G., Lenzerini, M.: What’s in an aggregate: Foundations for description logics with tuples and sets. In: Proceedings of the Fourteenth International Joint Conference On Intelligence Artificial 1995, IJCAI 1995 (1995)
Horrocks, I., Sattler, U.: Decidability of \(\mathcal{SHIQ}\) with complex role inclusion axioms. Artificial Intelligence 160, 79–104 (2004)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning. Springer, Heidelberg (2006)
Ortiz, M.: An automata-based algorithm for description logics around \(\mathcal{SRIQ}\). In: Proceedings of the fourth Latin American Workshop on Non-Monotonic Reasoning 2008, CEUR-WS.org (2008)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS, vol. 1705. Springer, Heidelberg (1999)
Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal{SHOIQ}\). Journal Of Automated Reasoning 39(3), 249–276 (2007)
Baader, F.: Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (1991)
Le Duc, C., Lamolle, M., Curé, O.: A tableaux-based algorithm for \(\mathcal{SHIQ}\) with transitive closure of roles in concept and role inclusion axioms. In: Technical Report (2010), http://www.iut.univ-paris8.fr/files/webfm/recherche/linc/RR201012A.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Duc, C., Lamolle, M., Curé, O. (2011). A Tableaux-Based Algorithm for \(\mathcal{SHIQ}\) with Transitive Closure of Roles in Concept and Role Inclusion Axioms. In: Antoniou, G., et al. The Semantic Web: Research and Applications. ESWC 2011. Lecture Notes in Computer Science, vol 6643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21034-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-21034-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21033-4
Online ISBN: 978-3-642-21034-1
eBook Packages: Computer ScienceComputer Science (R0)