On the public citation graph
Baltic Computer Science
0 signed · 51 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/bfb0019354openalex-snapshot
Type-theoretical semantics of some declarative languages
inferredcites →https://doi.org/10.1007/bfb0019356openalex-snapshot
Toward knowledge-based specifications of languages
inferredcites →https://doi.org/10.1007/bfb0019358openalex-snapshot
Inductive inference of recursive functions: Complexity bounds
inferredcites →https://doi.org/10.1007/bfb0019359openalex-snapshot
Inductive synthesis of dot expressions
inferredcites →https://doi.org/10.1007/bfb0019361openalex-snapshot
Inductive synthesis of term rewriting systems
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.1999.2805openalex-snapshot
Robust Behaviorally Correct Learning
inferred← citeshttps://doi.org/10.1006/inco.2000.2915openalex-snapshot
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
inferred← citeshttps://doi.org/10.1006/inco.2001.2922openalex-snapshot
Learning by the Process of Elimination
inferred← citeshttps://doi.org/10.1006/jcss.1997.1508openalex-snapshot
Learning Recursive Functions from Approximations
inferred← citeshttps://doi.org/10.1006/jcss.2001.1759openalex-snapshot
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
inferred← citeshttps://doi.org/10.1006/jsco.1999.0360openalex-snapshot
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
inferred← citeshttps://doi.org/10.1006/jsco.1999.0362openalex-snapshot
Goals and Benchmarks for Automated Map Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_22openalex-snapshot
Learning Recursive Functions Refutably
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_35openalex-snapshot
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_4openalex-snapshot
Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_23openalex-snapshot
On the Uniform Learnability of Approximations to Non-recursive Functions
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_18openalex-snapshot
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_9openalex-snapshot
A Deduction Method Complete for Refutation and Finite Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-58484-6_274openalex-snapshot
Genetic Programming with local hill-climbing
inferred← citeshttps://doi.org/10.1007/3-540-60217-8_6openalex-snapshot
Optimization problem in inductive inference
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_47openalex-snapshot
Effects of Kolmogorov complexity present in inductive inference as well
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_22openalex-snapshot
Active Learning of Recursive Functions by Ultrametric Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07179-4_20openalex-snapshot
SAW-Based Rankings vs. Intrinsic Evaluations of the Negotiation Offers – An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-319-13749-0_1openalex-snapshot
Ultrametric Vs. Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_6openalex-snapshot
Structured Frequency Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_9openalex-snapshot
Changing the Inference Type – Keeping the Hypothesis Space
inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_4openalex-snapshot
Coverage Criteria for State Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_81openalex-snapshot
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
inferred← citeshttps://doi.org/10.1007/978-3-642-02734-5_5openalex-snapshot
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_26openalex-snapshot
Amount of Nonconstructivity in Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13523-1_14openalex-snapshot
Postselection Finite Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13523-1_16openalex-snapshot
Quantum Query Algorithms for Conjunctions
inferred← citeshttps://doi.org/10.1007/978-3-642-13523-1_5openalex-snapshot
Finite State Transducers with Intuition
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_33openalex-snapshot
On the Amount of Nonconstructivity in Learning Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_50openalex-snapshot
Multiple Usage of Random Bits in Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_26openalex-snapshot
On the Size Complexity of Deterministic Frequency Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_1openalex-snapshot
Ultrametric Finite Automata and Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-44958-1_11openalex-snapshot
Algorithmic Information Theory and Computational Complexity
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50027-8openalex-snapshot
Resolution Decision Procedures
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.075openalex-snapshot
Systematic Semantic Tableaux for PLTL
inferred← citeshttps://doi.org/10.1016/j.ic.2004.03.003openalex-snapshot
Learning all subfunctions of a function
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.005openalex-snapshot
Robust learning—rich and poor
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.007openalex-snapshot
Learning with belief levels
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.021openalex-snapshot
Learning recursive functions: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.009openalex-snapshot
Mind change speed-up for learning languages from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00421-8openalex-snapshot
On learning of functions refutably
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00295-2openalex-snapshot
Kolmogorov numberings and minimal identification
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00016-6openalex-snapshot
Extracting models from clause sets saturated under semantic refinements of the resolution rule
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00059-2openalex-snapshot
On the intrinsic complexity of learning recursive functions
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.