On the public citation graph
Monotonic versus non-monotonic language learning
0 signed · 81 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08353-7_182openalex-snapshot
Identification of formal languages
inferredcites →https://doi.org/10.1007/3-540-11980-9_19openalex-snapshot
Polynomial time inference of extended regular pattern languages
inferredcites →https://doi.org/10.1007/bf03037092openalex-snapshot
Monotonic and non-monotonic inductive inference
inferredcites →https://doi.org/10.1007/bfb0012761openalex-snapshot
Machine inductive inference and language identification
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/0890-5401(90)90042-gopenalex-snapshot
Prudence and other conditions on formal language learning
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50007-6openalex-snapshot
A Polynomial-time Algorithm for Learning k-variable Pattern Languages from Examples
inferredcites →https://doi.org/10.1016/b978-1-55860-141-3.50049-3openalex-snapshot
Learning String Patterns and Tree Patterns from Examples
inferredcites →https://doi.org/10.1016/s0019-9958(64)90131-7openalex-snapshot
A formal theory of inductive inference. Part II
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.4018/978-1-59904-849-9openalex-snapshot
Encyclopedia of Artificial Intelligence
inferredcites →https://doi.org/10.5555/93335.93343openalex-snapshot
A polynomial-time algorithm for learning k-variable pattern languages from examples
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2784openalex-snapshot
Incremental Concept Learning for Bounded Data Mining
inferred← citeshttps://doi.org/10.1006/jcss.1998.1568openalex-snapshot
A Note on Batch and Incremental Learnability
inferred← citeshttps://doi.org/10.1007/11564089_20openalex-snapshot
Non U-Shaped Vacillatory and Team Learning
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_8openalex-snapshot
The VC-Dimension of Subclasses of Pattern Languages
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_23openalex-snapshot
Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_17openalex-snapshot
A unifying approach to monotonic language learning on informant
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_5openalex-snapshot
Too much information can be too much for learning efficiently
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_39openalex-snapshot
Case-based representation and learning of pattern languages
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_42openalex-snapshot
Inductive inference machines that can refute hypothesis spaces
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_76openalex-snapshot
On monotonic strategies for learning r.e. languages
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_77openalex-snapshot
Language learning under various types of constraint combinations
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_83openalex-snapshot
Set-driven and rearrangement-independent learning of recursive languages
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_173openalex-snapshot
Trading monotonicity demands versus mind changes
inferred← citeshttps://doi.org/10.1007/3-540-60217-8_12openalex-snapshot
A guided tour across the boundaries of learning recursive languages
inferred← citeshttps://doi.org/10.1007/3-540-60217-8_14openalex-snapshot
Inductive learning of recurrence-term languages from positive data
inferred← citeshttps://doi.org/10.1007/3-540-62064-8_12openalex-snapshot
Co-learning of recursive languages from positive data
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_25openalex-snapshot
Ordinal mind change complexity of language identification
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_7openalex-snapshot
Monotonic and dual-monotonic probabilistic language learning of indexed families with high probability
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_12openalex-snapshot
Learnability and Positive Equivalence Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_13openalex-snapshot
Mapping Monotonic Restrictions in Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_9openalex-snapshot
Maps of Restrictions for Behaviourally Correct Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_4openalex-snapshot
A Map of Update Constraints in Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_5openalex-snapshot
On the Role of Update Constraints and Text-Types in Iterative Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_26openalex-snapshot
Learning Figures with the Hausdorff Metric by Fractals
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_10openalex-snapshot
Topological Separations in Inductive Inference
inferred← citeshttps://doi.org/10.1007/bf01301967openalex-snapshot
Set-driven and rearrangement-independent learning of recursive languages
inferred← citeshttps://doi.org/10.1007/s00153-025-00976-3openalex-snapshot
Extending antichains in the poset $$\langle [\omega ]^{<\omega },\subseteq \rangle $$
inferred← citeshttps://doi.org/10.1007/s10994-012-5301-zopenalex-snapshot
Learning figures with the Hausdorff metric by fractals—towards computable binary classification
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00284-7openalex-snapshot
Monotonic and dual monotonic language learning
inferred← citeshttps://doi.org/10.1016/0304-3975(95)91134-copenalex-snapshot
Case-based representation and learning of pattern languages
inferred← citeshttps://doi.org/10.1016/0304-3975(95)91135-dopenalex-snapshot
Towards a mathematical theory of machine discovery from facts
inferred← citeshttps://doi.org/10.1016/j.ic.2015.12.005openalex-snapshot
On the role of update constraints and text-types in iterative learning
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104913openalex-snapshot
Learnability and positive equivalence relations
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.013openalex-snapshot
Non-U-shaped vacillatory and team learning
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.003openalex-snapshot
A bibliographical study of grammatical inference
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.017openalex-snapshot
Learning in the limit with lattice-structured hypothesis spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.010openalex-snapshot
Memory-limited non-U-shaped learning with solved open problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.036openalex-snapshot
Topological separations in inductive inference
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.028openalex-snapshot
A map of update constraints in inductive inference
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00273-5openalex-snapshot
Aspects of complexity of probabilistic learning under monotonicity constraints
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00017-0openalex-snapshot
Probabilistic language learning under monotonicity constraints
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00005-5openalex-snapshot
Ordinal mind change complexity of language identification
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00268-6openalex-snapshot
Vacillatory and BC learning on noisy data
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00269-8openalex-snapshot
Learning languages and functions by erasing
inferred← citeshttps://doi.org/10.1023/a:1010875913047openalex-snapshot
Stochastic Finite Learning of the Pattern Languages
inferred← citeshttps://doi.org/10.1023/a:1018903922049openalex-snapshot
Generalization and specialization strategies for learning r.e. languages
inferred← citeshttps://doi.org/10.1023/a:1018964207937openalex-snapshot
Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
inferred← citeshttps://doi.org/10.1080/09528139408953782openalex-snapshot
Characterization of language learning front informant under various monotonicity constraints
inferred← citeshttps://doi.org/10.1080/09528139408953785openalex-snapshot
Ignoring data may be the only way to learn efficiently
inferred← citeshttps://doi.org/10.1145/130385.130427openalex-snapshot
Types of monotonic language learning and their characterization
inferred← citeshttps://doi.org/10.1145/180139.181139openalex-snapshot
The representation of recursive languages and its impact on the efficiency of learning
inferred← citeshttps://doi.org/10.1145/267460.267485openalex-snapshot
Generalized notions of mind change complexity
inferred← citeshttps://doi.org/10.3233/com-220421openalex-snapshot
Maps for learning indexable classes
inferred← citeshttps://doi.org/10.48550/arxiv.1404.7527openalex-snapshot
A Map of Update Constraints in Inductive Inference
inferred← citeshttps://doi.org/10.48550/arxiv.1801.10502openalex-snapshot
Learning from Informants: Relations between Learning Success Criteria
inferred← citeshttps://doi.org/10.5109/13443openalex-snapshot
TRADING MONOTONICITY DEMANDS VERSUS EFFICIENCY
inferred← citeshttps://doi.org/10.70675/f4b8a530z336bz42fdz9950z36e65bf37ec5openalex-snapshot
Ingénierie de simulation multi-agents conduite par la connaissance pour évaluer l'efficacité des plans de gestion de catastrophes
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.