On the public citation graph

Inductive inference of monotonic formal systems from positive data

https://doi.org/10.1007/bf03037094
0 signed · 78 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/3-540-53919-0_5openalex-snapshot
Elementary formal system as a logic programming language
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1016/0743-1066(84)90021-9openalex-snapshot
Alternation and the computational complexity of logic programs
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50025-8openalex-snapshot
ELEMENTARY FORMAL SYSTEM AS A UNIFYING FRAMEWORK FOR LANGUAGE LEARNING
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50026-xopenalex-snapshot
IDENTIFICATION OF UNIONS OF LANGUAGES DRAWN FROM AN IDENTIFIABLE CLASS
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50010-2openalex-snapshot
INDUCTIVE INFERENCE FROM POSITIVE DATA IS POWERFUL
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.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.1145/800135.804406openalex-snapshot
Finding patterns common to a set of strings (Extended Abstract)
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2206/kyushumfs.24.47openalex-snapshot
ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
inferredcites →https://doi.org/10.5109/13347openalex-snapshot
INFERRING UNIONS OF TWO PATTERN LANGUAGES
inferredcites →https://doi.org/10.5109/13373openalex-snapshot
INDUCTIVE INFERENCE OF FORMAL SYSTEMS FROM POSITIVE DATA
inferredcites →https://doi.org/10.5555/93335.93372openalex-snapshot
Elementary formal system as a unifying framework for language learning
inferredcites →https://doi.org/10.5555/93335.93373openalex-snapshot
Identification of unions of languages drawn from an identifiable class

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.2782openalex-snapshot
The Synthesis of Language Learners
inferred← citeshttps://doi.org/10.1006/inco.1998.2784openalex-snapshot
Incremental Concept Learning for Bounded Data Mining
inferred← citeshttps://doi.org/10.1006/inco.2000.3001openalex-snapshot
On a Generalized Notion of Mistake Bounds
inferred← citeshttps://doi.org/10.1006/jcss.2000.1736openalex-snapshot
Synthesizing Learners Tolerating Computable Noisy Data
inferred← citeshttps://doi.org/10.1007/11422532_13openalex-snapshot
Learnable Classes of General Combinatory Grammars
inferred← citeshttps://doi.org/10.1007/11503415_27openalex-snapshot
Mind Change Efficient Learning
inferred← citeshttps://doi.org/10.1007/11564089_25openalex-snapshot
A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_23openalex-snapshot
Minimised Residue Hypotheses in Relevant Logic
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_16openalex-snapshot
New Conditions for the Existence of Least Generalizations under Relative Subsumption
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_23openalex-snapshot
Refuting Learning Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_25openalex-snapshot
Extending Elementary Formal Systems
inferred← citeshttps://doi.org/10.1007/3-540-45650-3_30openalex-snapshot
An Efficient Derivation for Elementary Formal Systems Based on Partial Unification
inferred← citeshttps://doi.org/10.1007/3-540-48751-4_19openalex-snapshot
On Sufficient Conditions for Learnability of Logic Programs from Positive Data
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_16openalex-snapshot
Mind Change Complexity of Learning Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_13openalex-snapshot
Learnability of Translations from Positive Examples
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_16openalex-snapshot
Synthesizing Learners Tolerating Computable Noisy Data
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_47openalex-snapshot
Properties of language classes with finite elasticity
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_85openalex-snapshot
Inductive inference of an approximate concept from positive data
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-61863-5_51openalex-snapshot
Inductive inference of unbounded unions of pattern languages from positive data
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_52openalex-snapshot
A class of prolog programs inferable from positive data
inferred← citeshttps://doi.org/10.1007/3-540-63494-0_65openalex-snapshot
Learning from positive data
inferred← citeshttps://doi.org/10.1007/3540635149_54openalex-snapshot
Using abstraction schemata in inductive logic programming
inferred← citeshttps://doi.org/10.1007/978-3-319-96562-8_1openalex-snapshot
Machine Learning for Software Analysis: Models, Methods, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_29openalex-snapshot
Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_7openalex-snapshot
Inductive Inference of Term Rewriting Systems from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_5openalex-snapshot
Can Learning in the Limit Be Done Efficiently?
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-69902-6_23openalex-snapshot
Inferability of Closed Set Systems from Positive Data
inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_15openalex-snapshot
Mind Change Optimal Learning of Bayes Net Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_6openalex-snapshot
On Dispersed and Choice Iteration in Incrementally Learnable Dependency Types
inferred← citeshttps://doi.org/10.1007/978-3-642-32024-8_2openalex-snapshot
Two Models of Learning Iterated Dependencies
inferred← citeshttps://doi.org/10.1007/bf00173697openalex-snapshot
Identification in the limit of categorial grammars
inferred← citeshttps://doi.org/10.1007/bf03037585openalex-snapshot
Revising the logical foundations of inductive logic programming systems with ground reduced programs
inferred← citeshttps://doi.org/10.1007/bfb0030388openalex-snapshot
More about learning elementary formal systems
inferred← citeshttps://doi.org/10.1007/bfb0054061openalex-snapshot
Meaning helps learning syntax
inferred← citeshttps://doi.org/10.1007/s10994-010-5218-3openalex-snapshot
Languages as hyperplanes: grammatical inference with string kernels
inferred← citeshttps://doi.org/10.1007/s10994-021-05947-2openalex-snapshot
Incremental learning of iterated dependencies
inferred← citeshttps://doi.org/10.1016/j.ic.2006.02.004openalex-snapshot
Mind change efficient learning
inferred← citeshttps://doi.org/10.1016/j.ic.2009.03.009openalex-snapshot
Mind change optimal learning of Bayes net structure from dependency and independency data
inferred← citeshttps://doi.org/10.1016/j.is.2023.102339openalex-snapshot
Foundations and practice of binary process discovery
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.020openalex-snapshot
Hypothesis finding with proof theoretical appropriateness criteria
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.042openalex-snapshot
From learning in the limit to stochastic finite learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.043openalex-snapshot
Learning of erasing primitive formal systems from positive examples
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.027openalex-snapshot
Some classes of term rewriting systems inferable from positive data
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.028openalex-snapshot
Developments from enquiries into the learnability of the pattern languages from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00418-8openalex-snapshot
Advanced elementary formal systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00422-xopenalex-snapshot
Refuting learning revisited
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00814-9openalex-snapshot
Learning power and language expressiveness
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00270-4openalex-snapshot
Inductive inference of unbounded unions of pattern languages from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00271-6openalex-snapshot
Some classes of prolog programs inferable from positive data
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80844-2openalex-snapshot
k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures
inferred← citeshttps://doi.org/10.1109/icist.2018.8426166openalex-snapshot
Table Transformation Rule Learner
inferred← citeshttps://doi.org/10.1109/iiai-aai.2012.52openalex-snapshot
Translating XML Documents Through Dyck-Typed Regular Translation Elementary Formal Systems
inferred← citeshttps://doi.org/10.1109/iiai-aai.2013.82openalex-snapshot
Development of Flexible User Need's Investigation System Based on XML Conversions
inferred← citeshttps://doi.org/10.1145/130385.130400openalex-snapshot
Polynomial time inference of a subclass of context-free transformations
inferred← citeshttps://doi.org/10.1145/238061.238093openalex-snapshot
Elementary formal systems, intrinsic complexity, and procrastination
inferred← citeshttps://doi.org/10.1145/307400.307450openalex-snapshot
On a generalized notion of mistake bounds
inferred← citeshttps://doi.org/10.3115/1603899.1603955openalex-snapshot
Syntactico-semantic learning of categorial grammars
inferred← citeshttps://doi.org/10.5109/13444openalex-snapshot
INDUCTIVE INFERENCE OF FORMAL LANGUAGES
inferred← citeshttps://doi.org/10.5109/21044openalex-snapshot
LEARNABILITY OF XML DOCUMENT TRANSFORMATION RULES USING TYPED EFSS
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.