Computing the Least Common Subsumer in the Description Logic $\mathcal{EL}$ w.r.t. Terminological Cycles with Descriptive Semantics
- 1 January 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Computing simulations on finite and infinite graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Terminological cycles in a description logic with existential restrictionsPublished by Sachsische Landesbibliothek, Staats- und Universitatsbibliothek Dresden ,2002
- Approximating Most Specific Concepts in Description Logics with Existential RestrictionsPublished by Springer Nature ,2001
- Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept AnalysisPublished by Springer Nature ,2000
- Computing Least Common Subsumer in Description Logics with Existential RestrictionsPublished by Sachsische Landesbibliothek, Staats- und Universitatsbibliothek Dresden ,1998
- Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptionsPublished by Springer Nature ,1998