Practical Reasoning for Expressive Description Logics

  • Ian Horrocks
  • Ulrike Sattler
  • Stephan Tobies
Conference paper

DOI: 10.1007/3-540-48242-3_11

Volume 1705 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Horrocks I., Sattler U., Tobies S. (1999) Practical Reasoning for Expressive Description Logics. In: Ganzinger H., McAllester D., Voronkov A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science, vol 1705. Springer, Berlin, Heidelberg

Abstract

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm that decides satisfiability of the DL ALC extended with transitive and inverse roles, role hierarchies, and qualifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ALC extended with just transitive and inverse roles is still in PSpace. Finally, we investigate the limits of decidability for this family of DLs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ian Horrocks
    • 1
  • Ulrike Sattler
    • 2
  • Stephan Tobies
    • 2
  1. 1.Department of Computer ScienceUniversity of ManchesterManchester
  2. 2.LuFG Theoretical Computer ScienceRWTH AachenAachen