Refutable language learning with a neighbor system.

DOI10.1016/S0304-3975(02)00420-6MaRDI QIDQ1874230zbMATH OpenOpenAlexFDO

Authors Yasuhito Mukouchi, Masako Sato

Publication date 22 May 2003

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

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00420-6

zbMATH Keywords

Language learningMachine discoveryNeighbor systemRefutable inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2080663
• scientific article; zbMATH DE number 2086330
• Refuting learning revisited.
• scientific article; zbMATH DE number 1351096
• scientific article; zbMATH DE number 1301797

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 67628 (Why is no real title available?)
• scientific article; zbMATH DE number 1301792 (Why is no real title available?)
• scientific article; zbMATH DE number 1334314 (Why is no real title available?)
• scientific article; zbMATH DE number 1351096 (Why is no real title available?)
• scientific article; zbMATH DE number 2077177 (Why is no real title available?)
• scientific article; zbMATH DE number 2077180 (Why is no real title available?)
• scientific article; zbMATH DE number 2080663 (Why is no real title available?)
• scientific article; zbMATH DE number 791077 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Finding patterns common to a set of strings
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning elementary formal systems
• Learning with refutation
• Monadic Elementary Formal Systems
• Noisy inference and oracles
• Program synthesis in the presence of infinite number of inaccuracies
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Short note: procedural semantics and negative information of elementary formal system
• Towards a mathematical theory of machine discovery from facts

Cited in

(4)

• scientific article; zbMATH DE number 2086330 (Why is no real title available?)
• Reflective inductive inference of recursive functions
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• scientific article; zbMATH DE number 2080663 (Why is no real title available?)

This page was built for publication: Refutable language learning with a neighbor system.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874230)