Learning unions of tree patterns using queries

DOI10.1016/S0304-3975(97)00015-7zbMath0901.68162WikidataQ59278912 ScholiaQ59278912MaRDI QIDQ1390942

Hiroki Arimura, Takeshi Shinohara, Hiroki Ishizaka

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learninglogic programs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Learning elementary formal systems with queries.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prediction-preserving reducibility
• Finding patterns common to a set of strings
• Lower bound methods and separation results for on-line learning models
• Learning conjunctions of Horn clauses
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• The learnability of description logics with equality constraints
• Queries and concept learning
• Computational limitations on learning from examples
• Inclusion is undecidable for pattern languages

This page was built for publication: Learning unions of tree patterns using queries