Skip to main content
SpringerLink
Log in

Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics

  • Conference paper
  • First Online:
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2514))

Abstract

Description Logics knowledge bases are traditionally divided into a terminological part (Tbox), and an assertional part (Abox). However, most of recent results on practical algorithms are confined to terminological reasoning only. Due to the applications of Description Logics for databases and the so-called “Semantic Web’, there is a growing interest for practical algorithms for Abox reasoning. In this paper we present an algorithm for deciding knowledge base satisfiability based on the idea of separating terminological and assertional reasoning. This modularity allows to build complete Description Logics systems, by reusing available terminological reasoners.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McGuinness, D.L., Wright, J.R.: An industrial strength description logic-based configuration platform. IEEE Intelligent Systems (1998) 69–77

    Google Scholar 

  2. Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS-98. (1998) 149–158

    Google Scholar 

  3. Brachman, R.J., Schmolze, J.G.: An overview of the KL-ONE knowledge representation system. Cognitive Science 9 (1985) 171–216

    Article  Google Scholar 

  4. Berners-Lee, T.: Weaving the Web. Harpur, San Francisco (1999)

    Google Scholar 

  5. Horrocks, I., Patel-Schneider, P.: The generation of DAML+OIL. In: Proc. of DL 2002, CEUR Workshop Proceedings (2001) 30–35

    Google Scholar 

  6. Donini, F.M., Lenzerini, M., Nardi, D., Nutt, W.: The complexity of concept languages. Information and Computation 134 (1997) 1–58

    Article  MATH  MathSciNet  Google Scholar 

  7. Broekstra, J., Kampman, A., van Harmelen, F.: Sesame: An architecture for storing and querying RDF data and schema information. In D. Fensel, J. Hendler, H.L., Wahlster, W., eds.: Semantics for the WWW. MIT Press (2001)

    Google Scholar 

  8. Haarslev, V., Möller, R.: RACER system description. In: Proc. of IJCAR-01. (2001)

    Google Scholar 

  9. Horrocks, I., Sattler, U., Tobies, S.: Reasoning with individuals for the description logic SHIQ. In MacAllester, D., ed.: Proc. of CADE-2000. Number 1831 in LNCS, Springer-Verlag (2000) 482–496

    Google Scholar 

  10. Hollunder, B.: Algorithmic Foundations of Terminological Knowledge Representation Systems. PhD thesis, Universität des Saarlandes (1994)

    Google Scholar 

  11. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: Deduction in concept languages: From subsumption to instance checking. J. of Logic and Computation 4 (1994) 423–452

    Article  MATH  MathSciNet  Google Scholar 

  12. Tessaris, S., Horrocks, I., Gough, G.: Evaluating a modular abox algorithm. In: Proc. of KR-02. (2002)

    Google Scholar 

  13. Tessaris, S.: Questions and answers: reasoning and querying in Description Logic. PhD thesis, University of Manchester (2001)

    Google Scholar 

  14. Schmidt-Schauβ, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48 (1991) 1–26

    Article  MATH  MathSciNet  Google Scholar 

  15. Haarslev, V., Möller, R.: An empirical evaluation of optimization strategies for abox reasoning in expressive description logics. In: Proc. of DL’99. (1999) 115–119

    Google Scholar 

  16. Horrocks, I., Patel-Schneider, P.F.: Optimising description logic subsumption. Journal of Logic and Computation 9 (1999) 267–293

    Article  MATH  MathSciNet  Google Scholar 

  17. Horrocks, I., Patel-Schneider, P.F.: DL system comparison. In: Proc. of DL’98. (1998)

    Google Scholar 

  18. Horrocks, I.: Daml+oil: a reason-able web ontology language. In: Proc. of EDBT 2002. (2002)

    Google Scholar 

  19. Horrocks, I.: Using an expressive description logic: FaCT or fiction? In: Proc. of KR-98. (1998) 636–647

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computation UMIST, Manchester, UK

    Sergio Tessaris

  2. Department of Computer Science, University of Manchester, Manchester, UK

    Ian Horrocks

Authors
  1. Sergio Tessaris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian Horrocks
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Abteilung für Theoretische Informatik, Institut für Algebra und Diskrete Mathematik, Wiedner Hauptstr. 8-10, 1040, Wien, Austria

    Matthias Baaz

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, Manchester, M13, 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tessaris, S., Horrocks, I. (2002). Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-36078-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00010-5

  • Online ISBN: 978-3-540-36078-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation