Advertisement

Decidability of \(\mathcal{SHI}\) with Transitive Closure of Roles

  • Chan Le Duc
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5554)

Abstract

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.

Keywords

OWL Description Logics Tableaux Decidability 

References

  1. 1.
    Aho, A.V., Ullman, J.D.: Universality of data retrieval languages. In: Proceedings of the 6th of ACM on Principles of Programming Language (1979)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Baader, F., Sattler, U.: Tableau algorithms for description logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS(LNAI), vol. 1847, p. 118. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  4. 4.
    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 (1994)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    de Giacomo, G., Massacci, F.: Combining deduction and model checking into tableaux and algorithms for converse-PDL. Information and Computation (1) (1998)Google Scholar
  7. 7.
    Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal{SHOIQ}\). Journal Of Automated Reasoning 39(3), 249–276 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    ISO. Standard ISO 8807: LOTOS, a formal description technique based on temporal ordering of observational behaviour (1988)Google Scholar
  10. 10.
    Patel-Schneider, P., Hayes, P., Horrocks, I.: OWL web ontology language semantics and abstract syntax. W3C Recommendation (2004)Google Scholar
  11. 11.
    Sattler, U.: A concept language extended with different kinds of transitive roles. In: Proceedings of the 20th German Annual Conf. on Artificial Intelligence (KI 2001), vol. 1137, pp. 199–204. Springer, Heidelberg (2001)Google Scholar
  12. 12.
    Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. Journal of Artificial Intelligence Research 12, 199–217 (2000)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Chan Le Duc
    • 1
  1. 1.INRIA Grenoble Rhône-Alpes - LIGFrance

Personalised recommendations