Synthesizing inductive expertise
From MaRDI portal
Publication:1107325
DOI10.1016/0890-5401(88)90055-7zbMATH Open0652.68068OpenAlexW2059655876MaRDI QIDQ1107325FDOQ1107325
Michael Stob, Scott Weinstein, Daniel N. Osherson
Publication date: 1988
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(88)90055-7
Cites Work
Cited In (12)
- The complexity of universal text-learners.
- The synthesis of language learners.
- Paradigms of truth detection
- Increasing the power of uniform inductive learners
- Learning algebraic structures from text
- An approach to intrinsic complexity of uniform learning
- Incorporating hypothetical knowledge into the process of inductive synthesis
- Synthesizing noise-tolerant language learners
- Synthesizing learners tolerating computable noisy data
- Robust learning with infinite additional information
- The complexity of universal text-learners
- Separation of uniform learning classes.
Recommendations
- Induction of inference rules for expert systems π π
- Inductive construction of a knowledge base for expert systems π π
- Aggregating inductive expertise on partial recursive functions π π
- A theory of formal synthesis via inductive learning π π
- Inductive synthesis of models from facts π π
- Incorporating hypothetical knowledge into the process of inductive synthesis π π
- Aggregating inductive expertise π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Synthesizing inductive expertise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107325)