Pages that link to "Item:Q749228"
From MaRDI portal
The following pages link to Monotonic and non-monotonic inductive inference (Q749228):
Displaying 43 items.
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Language learning without overgeneralization (Q673781) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- Inductive inference of monotonic formal systems from positive data (Q749217) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- When unlearning helps (Q924730) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- On some open problems in monotonic and conservative learning (Q989527) (← links)
- Inductive reasoning and Kolmogorov complexity (Q1190991) (← links)
- Logic program synthesis from incomplete specifications (Q1322854) (← links)
- Nonmonotonic reasoning: From finitary relations to infinitary inference operations (Q1327479) (← links)
- Probabilistic language learning under monotonicity constraints (Q1390945) (← links)
- Noisy inference and oracles (Q1390946) (← links)
- Brave nonmonotonic inference and its kinds (Q1397238) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- An empirical test of patterns for nonmonotonic inference (Q1601885) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Generalized notions of mind change complexity (Q1881221) (← links)
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification (Q1945017) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Maps of restrictions for behaviourally correct learning (Q2104257) (← links)
- Mapping monotonic restrictions in inductive inference (Q2117774) (← links)
- Normal forms for semantically witness-based learners in inductive inference (Q2117775) (← links)
- Results on memory-limited U-shaped learning (Q2384927) (← links)
- Robust learning of automatic classes of languages (Q2637647) (← links)
- Learning in Friedberg Numberings (Q3520051) (← links)
- Hypothesis Spaces for Learning (Q3618566) (← links)
- (Q4282558) (← links)
- Characterization of language learning front informant under various monotonicity constraints (Q4290131) (← links)
- Nonmonotonic inference operations (Q4291870) (← links)
- Two kinds of non-monotonic analogical inference (Q4632312) (← links)
- Set-driven and rearrangement-independent learning of recursive languages (Q4717054) (← links)
- Non-monotonic characterization of induction and its application to inductive learning (Q4853397) (← links)
- On the classification of computable languages (Q5048927) (← links)
- A Demonstration of the Incompleteness of Calculi of Inductive Inference (Q5210651) (← links)
- Learners based on transducers (Q5918614) (← links)
- Robust learning with infinite additional information (Q5941287) (← links)
- Aspects of complexity of probabilistic learning under monotonicity constraints (Q5958648) (← links)
- Topological separations in inductive inference (Q5964065) (← links)
