Skip to main content
SpringerLink
Log in

A Least Common Subsumer Operation for an Expressive Description Logic

  • Conference paper
  • First Online:
Book cover Intelligent Problem Solving. Methodologies and Approaches (IEA/AIE 2000)

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

  • 5507 Accesses

Abstract

Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service can be used for the approximation of concept disjunctions in description logics, for the “bottom-up” construction of knowledge bases, for learning tasks, and for specific kinds of information retrieval. So far, computing the least common subsumer has been restricted to description logics with rather limited expressivity. In this article, we continue recent research on extending this operation to more complex languages and present a least common subsumer operation for the expressive description logic \( \mathcal{A}\mathcal{L}\mathcal{Q} \) featuring qualified number restrictions.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. F. Baader and R. Küsters. Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic \( \mathcal{A}\mathcal{L}\mathcal{N} \) -Concept Descriptions. In Proc. of the 22nd German Conference on AI, pages 129–140, 1998.

    Google Scholar 

  2. F. Baader, R. Küsters, and R. Molitor. Computing Least Common Subsumer in Description Logics with Existential Restrictions. In Proc. of the IJCAI, pages 96–101, 1999.

    Google Scholar 

  3. W. W. Cohen, A. Borgida, and H. Hirsh. Computing Least Common Subsumers in Description Logics. In Proc. of the Int. Conf. on Fifth Generation Computer Systems, pages 1036–1043, Japan, 1992. Ass. for Computing Machinery.

    Google Scholar 

  4. W.W. Cohen and H. Hirsh. The Learnability of Description Logics with Equality Constraints. Machine Learning, 17:169–199, 1994.

    MATH  Google Scholar 

  5. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Principles of Knowledge Representation, chapter Reasoning in Description Logics, pages 191–236. 1996.

    Google Scholar 

  6. B. Hollunder and F. Baader. Qualifying Number Restrictions in Concept Languages. In Proc. of the KR, pages 335–346, San Mateo, CA, USA, April 1991.

    Google Scholar 

  7. T. Mantay. Computing Least Common Subsumers in Expressive Description Logics. Technical Report FBI-HH-M-286/99, Department of Computer Science, University of Hamburg, 1999.

    Google Scholar 

  8. R. Möller, V. Haarslev, and B. Neumann. Semantics-Based Information Retrieval. In Int. Conf. on Information Technology and Knowledge Systems, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Labor für Künstliche Intelligenz, Universität Hamburg, Vogt-Kölln-Straße 30, D-22527, Hamburg

    Mantay Thomas

Authors
  1. Mantay Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Center for Advanced Computer Studies, University of Lousiana, 2 Rex Street, Lafayette, LA, 70504-4330, USA

    Rasiah Logananthara

  2. Department of Neural Information Processing, University of Ulm, Oberer Eselsberg, 89069, Ulm, Germany

    Günther Palm

  3. Department of Computer Science, Southwest Texas State University, 601 University Drive, San Marcos, TX, 78666-4616, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, M. (2000). A Least Common Subsumer Operation for an Expressive Description Logic. In: Logananthara, R., Palm, G., Ali, M. (eds) Intelligent Problem Solving. Methodologies and Approaches. IEA/AIE 2000. Lecture Notes in Computer Science(), vol 1821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45049-1_57

Download citation

  • DOI: https://doi.org/10.1007/3-540-45049-1_57

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67689-8

  • Online ISBN: 978-3-540-45049-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation