The learnability of description logics with equality constraints

DOI10.1007/BF00993470zbMath0823.68094MaRDI QIDQ1342732

William W. Cohen, Haym Hirsh

Publication date: 15 January 1995

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

concept learningProlog

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Learning unions of tree patterns using queries ⋮ Matching in Hybrid Terminologies ⋮ Classic learning ⋮ Learning logic programs with structured background knowledge ⋮ Unnamed Item ⋮ Pac-learning non-recursive Prolog clauses ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ Ontology Learning from Interpretations in Lightweight Description Logics ⋮ Structural subsumption and least common subsumers in a description logic with existential and number restrictions

Uses Software

• GOLEM

Cites Work

• Prediction-preserving reducibility
• Learning regular sets from queries and counterexamples
• Generalized subsumption and its applications to induction and redundancy
• The KL-ONE family
• Learning Boolean functions in an infinite attribute space
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples
• Cryptographic limitations on learning Boolean formulae and finite automata
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item