On the public citation graph
A formal study of learning via queries
0 signed · 26 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-51734-0_53openalex-snapshot
Towards representation independence in PAC learning
inferredcites →https://doi.org/10.1016/0304-3975(90)90017-copenalex-snapshot
Learning context-free grammars from structural data in polynomial time
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_8openalex-snapshot
On the complexity of small description and related topics
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_27openalex-snapshot
A note on the query complexity of learning DFA
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_195openalex-snapshot
The query complexity of learning some subclasses of context-free grammars
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_43openalex-snapshot
The complexity of learning minor closed graph classes
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_38openalex-snapshot
The complexity of exactly learning algebraic concepts
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_50openalex-snapshot
Exact learning via teaching assistants (Extended abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_3openalex-snapshot
Coding Complexity: The Computational Complexity of Succinct Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_2openalex-snapshot
On the Complexity of Learning Description Logic Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/bf01578843openalex-snapshot
A framework for polynomial-time query learnability
inferred← citeshttps://doi.org/10.1007/bf03037351openalex-snapshot
The query complexity of learning DFA
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00043-8openalex-snapshot
Monotone term decision lists
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00266-2openalex-snapshot
Exact learning via teaching assistants
inferred← citeshttps://doi.org/10.1109/sct.1991.160247openalex-snapshot
On the computational complexity of small descriptions
inferred← citeshttps://doi.org/10.1109/sct.1994.315791openalex-snapshot
The complexity of learning with queries
inferred← citeshttps://doi.org/10.24963/ijcai.2020/259openalex-snapshot
On the Learnability of Possibilistic Theories
inferred← citeshttps://doi.org/10.3233/fi-1995-2313openalex-snapshot
LEARNING VIA QUERIES WITH TEAMS AND ANOMALIES
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01910openalex-snapshot
Model Learning: A Survey on Foundation, Tools and Applications
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.