On the public citation graph

The use of planning critics in mechanizing inductive proofs

https://doi.org/10.1007/bfb0013060
0 signed · 62 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-52885-7_84openalex-snapshot
Extensions to the rippling-out tactic for guiding inductive proofs
inferredcites →https://doi.org/10.1007/bf00249016openalex-snapshot
Experiments with proof plans for induction
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11618027_10openalex-snapshot
Impasse-Driven Reasoning in Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-36607-5_2openalex-snapshot
CGRASS: A System for Transforming Constraint Satisfaction Problems
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-45653-8_50openalex-snapshot
Concept Formation via Proof Planning Failure
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_15openalex-snapshot
Invariant Discovery via Failed Proof Attempts
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_2openalex-snapshot
A divergence critic
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_29openalex-snapshot
Proof plans for the correction of false conjectures
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_5openalex-snapshot
On the use of inductive reasoning in program synthesis: Prejudice and prospects
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_112openalex-snapshot
Lemma discovery in automating induction
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_68openalex-snapshot
Extensions to a generalization critic for inductive proof
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_29openalex-snapshot
Using a generalisation critic to find bisimulations for coinductive proofs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_7openalex-snapshot
Guiding Synthesis Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_6openalex-snapshot
Reasoned Modelling: Harnessing the Synergies Between Reasoning and Modelling
inferred← citeshttps://doi.org/10.1007/978-3-540-24694-7_20openalex-snapshot
Invariant Patterns for Program Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_5openalex-snapshot
An Integration of Program Analysis and Automated Theorem Proving
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-540-69149-5_45openalex-snapshot
Tool Integration for Reasoned Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-11811-1_15openalex-snapshot
Reasoned Modelling Critics: Turning Failed Proofs into Modelling Guidance
inferred← citeshttps://doi.org/10.1007/978-3-642-30885-7_15openalex-snapshot
Refinement Plans for Informed Formal Design
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_3openalex-snapshot
Productive Use of Failure in Inductive Proof
inferred← citeshttps://doi.org/10.1007/978-94-009-1675-3_4openalex-snapshot
Middle-Out Reasoning for Synthesis and Induction
inferred← citeshttps://doi.org/10.1007/bf00244460openalex-snapshot
Productive use of failure in inductive proof
inferred← citeshttps://doi.org/10.1007/bf00244461openalex-snapshot
Middle-out reasoning for synthesis and induction
inferred← citeshttps://doi.org/10.1007/pl00010808openalex-snapshot
Using an induction prover for verifying arithmetic circuits
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/s10515-006-5467-3openalex-snapshot
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
inferred← citeshttps://doi.org/10.1007/s10817-006-9034-1openalex-snapshot
An Integrated Approach to High Integrity Software Verification
inferred← citeshttps://doi.org/10.1007/s10817-009-9125-xopenalex-snapshot
On Process Equivalence = Equation Solving in CCS
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.004openalex-snapshot
Failure Reasoning in Multiple-Strategy Proof Planning
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.11.025openalex-snapshot
On the Comparison of Proof Planning Systems: , Ωmega and IsaPlanner
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.jal.2005.10.007openalex-snapshot
A proof-centric approach to mathematical assistants
inferred← citeshttps://doi.org/10.1016/j.scico.2011.03.006openalex-snapshot
Reasoned modelling critics: Turning failed proofs into modelling guidance
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00169-3openalex-snapshot
Proof-search in type-theoretic languages: an introduction
inferred← citeshttps://doi.org/10.1017/s0890060400000986openalex-snapshot
Proof planning: A methodology for developing AI systems incorporating design issues
inferred← citeshttps://doi.org/10.1017/s0956796899003408openalex-snapshot
Automatic verification of functions with accumulating parameters
inferred← citeshttps://doi.org/10.1017/s1755020319000601openalex-snapshot
PLANS AND PLANNING IN MATHEMATICAL PROOFS
inferred← citeshttps://doi.org/10.1023/a:1005772217686openalex-snapshot
Coloring Terms to Control Equational Reasoning
inferred← citeshttps://doi.org/10.1023/a:1008770222354openalex-snapshot
Planning Proofs of Equations in CCS
inferred← citeshttps://doi.org/10.1023/a:1018969728171openalex-snapshot
Proof planning for strategy development
inferred← citeshttps://doi.org/10.1023/a:1018980611571openalex-snapshot
Adaptation of declaratively represented methods in proof planning
inferred← citeshttps://doi.org/10.1023/a:1024448931103openalex-snapshot
Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm
inferred← citeshttps://doi.org/10.1093/jigpal/11.6.647openalex-snapshot
Automatic Learning of Proof Methods in Proof Planning
inferred← citeshttps://doi.org/10.1109/ase.1999.802091openalex-snapshot
Towards automatic imperative program synthesis through proof planning
inferred← citeshttps://doi.org/10.1109/ase.2001.989817openalex-snapshot
Higher order function synthesis through proof planning
inferred← citeshttps://doi.org/10.1109/ase.2003.1240334openalex-snapshot
Automation for exception freedom proofs
inferred← citeshttps://doi.org/10.1109/ase.2006.69openalex-snapshot
Towards Automatic Assertion Refinement for Separation Logic
inferred← citeshttps://doi.org/10.1109/ase.2011.6100132openalex-snapshot
The CORE system: Animation and functional correctness of pointer programs
inferred← citeshttps://doi.org/10.1145/1345169.1345175openalex-snapshot
Cooperative reasoning for automatic software verification
inferred← citeshttps://doi.org/10.1613/jair.275openalex-snapshot
A Divergence Critic for Inductive Proof
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.22028/d291-40440openalex-snapshot
Towards a Framework to Integrate Proof Search Paradigms
inferred← citeshttps://doi.org/10.29007/svv8openalex-snapshot
Towards Automated Property Discovery within Hume
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.