Skip to main content
SpringerLink
Log in

Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions

  • Technical Papers-section 3
  • Conference paper
  • First Online:
KI-98: Advances in Artificial Intelligence (KI 1998)

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

Included in the following conference series:

Abstract

Computing least common subsumers (lcs) and most specific concepts (msc) are inference tasks that can be used to support the “bottom up” construction of knowledge bases for KR systems based on description logic. For the description logic ALN, the msc need not always exist if one restricts the attention to acyclic concept descriptions. In this paper, we extend the notions lcs and msc to cyclic descriptions, and show how they can be computed.

Supported by “Studienstiftung des deutschen Volkes”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader. A formal definition for the expressive power of terminological knowledge representation languages. J. of Logic and Computation, 6 (1): 33–54, 1996.

    MATH  MathSciNet  Google Scholar 

  2. F. Baader. Using automata theory for characterizing the semantics of terminological cycles. Annals of Mathematics and Artificial Intelligence, 18 (2–4): 175–219, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. F. Baader and B. Hollunder. A terminological knowledge representation system with complete inference algorithms. In Proceedings of the First International Workshop on Processing Declarative Knowledge, volume 572 of Lecture Notes in Computer Science, pages 67–85, Kaiserslautern (Germany), 1991. Springer-Verlag.

    Google Scholar 

  4. F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. Technical Report LTCS-Report 98-06, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwthaachen.de/Forschung/Papers.html.

    Google Scholar 

  5. F. Baader and U. Sattler. Knowledge representation in process engineering. In Proceedings of the International Workshop on Description Logics, Cambridge (Boston), MA, U.S.A., 1996. AAAI Press/The MIT Press.

    Google Scholar 

  6. A. Borgida, R. J. Brachman, D. L. McGuinness, and L. A. Resnick. CLASSIC: A structural data model for objects. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pages 59–67, Portland, OR, 1989.

    Google Scholar 

  7. W. W. Cohen, A. Borgida, and H. Hirsh. Computing least common subsumers in description logics. In William Swartout, editor, Proceedings of the 10th National Conference on Artificial Intelligence, pages 754–760, San Jose, CA, July 1992. MIT Press.

    Google Scholar 

  8. W. W. Cohen and H. Hirsh. Learnability of description logics with equality constrains. Machine Learning, 17 (2/3), 1994.

    Google Scholar 

  9. W. W. Cohen and H. Hirsh. Learning the classic description logic: Theoretical and experimental results. In Proceedings of the Fourth International Confrence on Principles of Knowledge Representation and Reasoning (KR’94), pages 121–133, San Francisco, Calif., 1994. Morgan Kaufmann.

    Google Scholar 

  10. J.-U. Kietz and K. Mork. A polynomial approach to the constructive induction of structural knowledge. Machine Learning Journal, 14 (2): 193–218, 1994.

    Article  MATH  Google Scholar 

  11. R. Küsters. Characterizing the semantics of terminological cycles in ALN using finite automata. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 499–510, Trento, Italy, 1998.

    Google Scholar 

  12. B. Nebel. Terminological cycles: Semantics and computational properties. In J. Sowa, editor, Formal Aspects of Semantic Networks, pages 331–361. Morgan Kaufmann, San Mateo, 1991.

    Google Scholar 

  13. W. A. Woods and J. G. Schmolze. The KL-ONE family, Computers and Mathematics with Applications, special issue on knowledge representation, 23 (2–5): 133–177, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LuFG Theoretische Informatik, RWTH Aachen, Ahornstr. 55, 52074, Aachen, Germany

    Franz Baader & Ralf Küsters

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralf Küsters
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otthein Herzog Andreas Günter

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baader, F., Küsters, R. (1998). Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In: Herzog, O., Günter, A. (eds) KI-98: Advances in Artificial Intelligence. KI 1998. Lecture Notes in Computer Science, vol 1504. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095434

Download citation

  • DOI: https://doi.org/10.1007/BFb0095434

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49656-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation