On the public citation graph

Middle-out reasoning for synthesis and induction

https://doi.org/10.1007/bf00244461
0 signed · 49 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-16780-3_132openalex-snapshot
The karlsruhe induction theorem proving system
inferredcites →https://doi.org/10.1007/3-540-52885-7_123openalex-snapshot
The OYSTER-CLAM system
inferredcites →https://doi.org/10.1007/3-540-58156-1_3openalex-snapshot
Synthesis of induction orderings for existence proofs
inferredcites →https://doi.org/10.1007/3-540-58156-1_4openalex-snapshot
Lazy generation of induction hypotheses
inferredcites →https://doi.org/10.1007/3-540-58156-1_69openalex-snapshot
Mollusc a general proof-development shell for sequent-based logics
inferredcites →https://doi.org/10.1007/978-1-4471-3560-9_1openalex-snapshot
Logic Program Synthesis via Proof Planning
inferredcites →https://doi.org/10.1007/978-3-642-76274-1_8openalex-snapshot
The Synthesis of Logic Programs from Inductive Proofs
inferredcites →https://doi.org/10.1007/978-3-642-84744-8openalex-snapshot
Automatische Synthese rekursiver Programme als Beweisverfahren
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-1675-3_5openalex-snapshot
A Calculus for and Termination of Rippling
inferredcites →https://doi.org/10.1007/bf00244460openalex-snapshot
Productive use of failure in inductive proof
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1007/bfb0013060openalex-snapshot
The use of planning critics in mechanizing inductive proofs
inferredcites →https://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferredcites →https://doi.org/10.1016/0004-3702(80)90050-8openalex-snapshot
Syntax-directed, semantics-supported program synthesis
inferredcites →https://doi.org/10.1016/0004-3702(93)90079-qopenalex-snapshot
Rippling: A heuristic for guiding inductive proofs
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0743-1066(94)90029-9openalex-snapshot
Logic program synthesis
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1109/iwssd.1993.315502openalex-snapshot
A framework for program development based on schematic proof
inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11853886_21openalex-snapshot
Automatic Deductive Synthesis of Lisp Programs in the System ALISA
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_6openalex-snapshot
Reasoning Inductively about Z Specifications via Unification
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_13openalex-snapshot
Achievements and Prospects of Program Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_7openalex-snapshot
A Critique of Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_52openalex-snapshot
Generic system support for deductive program development
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_2openalex-snapshot
Synthesis of Programs in Computational Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_4openalex-snapshot
Planning and Patching Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-17172-7_6openalex-snapshot
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_23openalex-snapshot
The Use of Rippling to Automate Event-B Invariant Preservation Proofs
inferred← citeshttps://doi.org/10.1007/s00165-004-0054-5openalex-snapshot
Discovering applications of higher order functions through proof planning
inferred← citeshttps://doi.org/10.1007/s10472-007-9079-9openalex-snapshot
An approach to automatic deductive synthesis of functional programs
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50015-1openalex-snapshot
The Automation of Proof by Mathematical Induction
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.028openalex-snapshot
Poitín: Distilling Theorems From Conjectures
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.06.055openalex-snapshot
Scheme-based theorem discovery and concept invention
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.006openalex-snapshot
Theorema: Towards computer-aided mathematical theory exploration
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.030openalex-snapshot
Synthesis of list algorithms by mechanical proving
inferred← citeshttps://doi.org/10.1023/a:1005903504159openalex-snapshot
Automated Synthesis of Recursive Programs from a ∀∃ Logical Specification
inferred← citeshttps://doi.org/10.1023/a:1006282725324openalex-snapshot
Managing Structural Information by Higher-Order Colored Unification
inferred← citeshttps://doi.org/10.1093/jigpal/jzr048openalex-snapshot
Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto
inferred← citeshttps://doi.org/10.1109/ase.2001.989817openalex-snapshot
Higher order function synthesis through proof planning
inferred← citeshttps://doi.org/10.1109/saci.2016.7507376openalex-snapshot
A case study on algorithm discovery from proofs: The insert function on binary trees
inferred← citeshttps://doi.org/10.1145/289121.289122openalex-snapshot
Logical framework based program development
inferred← citeshttps://doi.org/10.3233/aic-130584openalex-snapshot
European collaboration on automated reasoning
inferred← citeshttps://doi.org/10.34961/707openalex-snapshot
Constructing programs from metasystem transition proofs
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.