The learnability of description logics with equality constraints
Open Access
- 1 January 1994
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 17 (2) , 169-199
- https://doi.org/10.1007/bf00993470
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Classification as a query processing technique in the CANDIDE semantic data modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description LogicJournal of Artificial Intelligence Research, 1994
- LaSSIECommunications of the ACM, 1991
- Learning boolean functions in an infinite attribute spacePublished by Association for Computing Machinery (ACM) ,1990
- Incremental Version-Space Merging: A General Framework for Concept LearningPublished by Springer Nature ,1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A BOOTSTRAPPING APPROACH TO CONCEPTUAL CLUSTERINGPublished by Elsevier ,1989
- Generalized subsumption and its applications to induction and redundancyArtificial Intelligence, 1988
- An Overview of KRL, a Knowledge Representation LanguageCognitive Science, 1977
- Language identification in the limitInformation and Control, 1967