Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 129-140
- https://doi.org/10.1007/bfb0095434
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptionsPublished by Springer Nature ,1998
- Characterizing the semantics of terminological cycles in ALN using finite automataPublished by Sachsische Landesbibliothek, Staats- und Universitatsbibliothek Dresden ,1997
- Using automata theory for characterizing the semantics of terminological cyclesAnnals of Mathematics and Artificial Intelligence, 1996
- A Formal Definition for the Expressive Power of Terminological Knowledge Representation LanguagesJournal of Logic and Computation, 1996
- Learning the CLASSIC Description Logic: Theoretical and Experimental ResultsPublished by Elsevier ,1994
- A Polynomial Approach to the Constructive Induction of Structural KnowledgeMachine Learning, 1994
- The Learnability of Description Logics with Equality ConstraintsMachine Learning, 1994
- A terminological knowledge representation system with complete inference algorithmsPublished by Springer Nature ,1991
- CLASSIC: a structural data model for objectsPublished by Association for Computing Machinery (ACM) ,1989