On the public citation graph

Productive use of failure in inductive proof

https://doi.org/10.1007/bf00244460
0 signed · 145 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-51734-0_69openalex-snapshot
Inductive inference for solving divergence in Knuth-Bendix completion
inferredcites →https://doi.org/10.1007/3-540-52885-7_123openalex-snapshot
The OYSTER-CLAM system
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/3-540-52885-7_85openalex-snapshot
Guiding induction proofs
inferredcites →https://doi.org/10.1007/3-540-55602-8_173openalex-snapshot
Difference matching
inferredcites →https://doi.org/10.1007/3-540-58156-1_2openalex-snapshot
A divergence critic
inferredcites →https://doi.org/10.1007/3-540-58216-9_29openalex-snapshot
Proof plans for the correction of false conjectures
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.1016/0004-3702(81)90010-2openalex-snapshot
Using meta-level inference for selective application of multiple rewrite rule sets in algebraic manipulation
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/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1037/026050openalex-snapshot
Review of The Collected Papers.
inferredcites →https://doi.org/10.1093/mind/xxxviii.149.1openalex-snapshot
I.—MATHEMATICAL PROOF

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.2859openalex-snapshot
On Terminating Lemma Speculations
inferred← citeshttps://doi.org/10.1006/jsco.1996.0076openalex-snapshot
Automated Theorem Proving by Test Set Induction
inferred← citeshttps://doi.org/10.1006/jsco.1997.0174openalex-snapshot
The Use of Proof Planning for Co-operative Theorem Proving
inferred← citeshttps://doi.org/10.1007/0-387-21821-1_42openalex-snapshot
Using the CORAL System to Discover Attacks on Security Protocols
inferred← citeshttps://doi.org/10.1007/10721959_41openalex-snapshot
System Description: Interactive Proof Critics in XBarnacle
inferred← citeshttps://doi.org/10.1007/11618027_10openalex-snapshot
Impasse-Driven Reasoning in Proof Planning
inferred← citeshttps://doi.org/10.1007/11829263_5openalex-snapshot
Best-First Rippling
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_23openalex-snapshot
A Semantics for Proof Plans with Applications to Interactive Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_25openalex-snapshot
“Term Partition” for Mathematical Induction
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_43openalex-snapshot
Proof Planning with Multiple Strategies
inferred← citeshttps://doi.org/10.1007/3-540-45422-5_29openalex-snapshot
Experiments with an Agent-Oriented Reasoning System
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_28openalex-snapshot
Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus
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-45685-6_13openalex-snapshot
A Comparison of Two Proof Critics: Power vs. Robustness
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_1openalex-snapshot
Proofs About Lists Using Ellipsis
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_6openalex-snapshot
A Survey of Automated Deduction
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-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-61511-3_71openalex-snapshot
Internal analogy in theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_72openalex-snapshot
Termination of theorem proving by reuse
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_66openalex-snapshot
When to prove theorems by analogy?
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/3-540-63104-6_30openalex-snapshot
A colored version of the λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_39openalex-snapshot
XBarnacle: Making theorem provers more accessible
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_2openalex-snapshot
A Science of Reasoning (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3540634932_4openalex-snapshot
Structured incremental proof planning
inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_15openalex-snapshot
Predicting Failures of and Repairing Inductive Proof Attempts
inferred← citeshttps://doi.org/10.1007/978-3-030-23250-4_9openalex-snapshot
Lemma Discovery for Induction
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_35openalex-snapshot
Lemma Synthesis for Automating Induction over Algebraic Data Types
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_6openalex-snapshot
Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_1openalex-snapshot
The History of the DReaM Group
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_3openalex-snapshot
Adventures in Mathematical Reasoning
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-031-63498-7_13openalex-snapshot
Lemma Discovery and Strategies for Automated Induction
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_6openalex-snapshot
Can LLM Aid in Solving Constraints with Inductive Definitions?
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_9openalex-snapshot
Hipster: Integrating Theory Exploration in a Proof Assistant
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_17openalex-snapshot
Introducing Quantified Cuts in Logic with Equality
inferred← citeshttps://doi.org/10.1007/978-3-319-20615-8_23openalex-snapshot
TIP: Tons of Inductive Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_26openalex-snapshot
ASP, Amalgamation, and the Conceptual Blending Workflow
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_30openalex-snapshot
Automating Induction for Solving Horn Clauses
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-30142-4_7openalex-snapshot
Higher Order Rippling in IsaPlanner
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-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
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-14052-5_21openalex-snapshot
Case-Analysis for Rippling and Inductive 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-22673-1_5openalex-snapshot
Using Theorema in the Formalization of Theoretical Economics
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_28openalex-snapshot
Zeno: An Automated Prover for Properties of Recursive Data Structures
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/978-3-642-38574-2_27openalex-snapshot
Automating Inductive Proofs Using Theory Exploration
inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_5openalex-snapshot
Induction for SMT Solvers
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/978-94-009-1675-3_5openalex-snapshot
A Calculus for and Termination of Rippling
inferred← citeshttps://doi.org/10.1007/978-94-010-0550-0_7openalex-snapshot
Model-Guided Proof Planning
inferred← citeshttps://doi.org/10.1007/978-94-015-9383-0_16openalex-snapshot
Concepts in Proof Planning
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_11openalex-snapshot
Proof Development with Ωmega: The Irrationality of $$\sqrt 2$$
inferred← citeshttps://doi.org/10.1007/bf00244461openalex-snapshot
Middle-out reasoning for synthesis and induction
inferred← citeshttps://doi.org/10.1007/bf00244462openalex-snapshot
A calculus for and termination of rippling
inferred← citeshttps://doi.org/10.1007/bfb0054254openalex-snapshot
System description: Proof planning in higher-order logic with λClam
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/s00165-018-00476-7openalex-snapshot
Automating Event-B invariant proofs by rippling and proof patching
inferred← citeshttps://doi.org/10.1007/s10462-017-9598-7openalex-snapshot
Evaluating representational systems in artificial intelligence
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-010-9177-yopenalex-snapshot
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
inferred← citeshttps://doi.org/10.1007/s10817-018-9462-8openalex-snapshot
On the Generation of Quantified Lemmas
inferred← citeshttps://doi.org/10.1007/s11390-026-6040-0openalex-snapshot
Automated Conjecturing and Theorem Finding: A Survey
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.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.artint.2017.11.005openalex-snapshot
A computational framework for conceptual blending
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.021openalex-snapshot
Interactive Theorem Proving with Tasks
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.08.003openalex-snapshot
Constructing Induction Rules for Deductive Synthesis Proofs
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.ins.2003.06.012openalex-snapshot
Appropriate lemmae discovery
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.jal.2005.10.007openalex-snapshot
A proof-centric approach to mathematical assistants
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.010openalex-snapshot
Supporting the formal verification of mathematical texts
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.05.022openalex-snapshot
Sound generalizations in mathematical induction
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.018openalex-snapshot
Algorithmic introduction of quantified cuts
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.003openalex-snapshot
The problem of Π2-cut-introduction
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00096-xopenalex-snapshot
Proving theorems by reuse
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.1016/s1571-0661(04)80648-0openalex-snapshot
Deduction as an Engineering Science
inferred← citeshttps://doi.org/10.1017/s0956796899003408openalex-snapshot
Automatic verification of functions with accumulating parameters
inferred← citeshttps://doi.org/10.1017/s1471068424000176openalex-snapshot
Property-Based Testing by Elaborating Proof Outlines
inferred← citeshttps://doi.org/10.1017/s1755020319000601openalex-snapshot
PLANS AND PLANNING IN MATHEMATICAL PROOFS
inferred← citeshttps://doi.org/10.1023/a:1005936130801openalex-snapshot
Analogy in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1023/a:1006282725324openalex-snapshot
Managing Structural Information by Higher-Order Colored Unification
inferred← citeshttps://doi.org/10.1023/a:1008763422061openalex-snapshot
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm
inferred← citeshttps://doi.org/10.1023/a:1008770222354openalex-snapshot
Planning Proofs of Equations in CCS
inferred← citeshttps://doi.org/10.1023/a:1018940332714openalex-snapshot
Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts
inferred← citeshttps://doi.org/10.1023/a:1018969728171openalex-snapshot
Proof planning for strategy development
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/jzr048openalex-snapshot
Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto
inferred← citeshttps://doi.org/10.1093/logcom/exab090openalex-snapshot
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach
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.2000.873654openalex-snapshot
The use of abduction and recursion-editor techniques for the correction of faulty conjectures
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/fmcad.2006.2openalex-snapshot
A Refinement Method for Validity Checking of Quantified First-Order Formulas in Hardware Verification
inferred← citeshttps://doi.org/10.1109/sefm.2005.15openalex-snapshot
Customised induction rules for proving correctness of imperative programs
inferred← citeshttps://doi.org/10.1145/1345169.1345175openalex-snapshot
Cooperative reasoning for automatic software verification
inferred← citeshttps://doi.org/10.1145/3354166.3354170openalex-snapshot
Property-Based Testing via Proof Reconstruction
inferred← citeshttps://doi.org/10.1145/3462172.3462192openalex-snapshot
Template-based Theory Exploration: Discovering Properties of Functional Programs by Testing
inferred← citeshttps://doi.org/10.1145/3519939.3523731openalex-snapshot
CycleQ: an efficient basis for cyclic equational reasoning
inferred← citeshttps://doi.org/10.14236/ewic/fm1997.7openalex-snapshot
The Use of Theorem Provers in the Teaching and Practice of Formal Methods
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.72.1009openalex-snapshot
Conditional Lemma Discovery and Recursion Induction in Hipster
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.22028/d291-25851openalex-snapshot
Transformations of specifications and proofs to support an evolutionary formal software development
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:10)2017openalex-snapshot
Some observations on the logical foundations of inductive theorem proving
inferred← citeshttps://doi.org/10.25405/ncl.34187967openalex-snapshot
Inferring the Proof Process
inferred← citeshttps://doi.org/10.29007/3qwropenalex-snapshot
HipSpec : Automating Inductive Proofs of Program Properties
inferred← citeshttps://doi.org/10.29007/svv8openalex-snapshot
Towards Automated Property Discovery within Hume
inferred← citeshttps://doi.org/10.3233/aic-130584openalex-snapshot
European collaboration on automated reasoning
inferred← citeshttps://doi.org/10.3233/fi-2010-305openalex-snapshot
Automation for Dependently Typed Functional Programming
inferred← citeshttps://doi.org/10.3929/ethz-a-006860117openalex-snapshot
VSTTE 2010 workshop proceedings
inferred← citeshttps://doi.org/10.4204/eptcs.341.1openalex-snapshot
Conjectures, Tests and Proofs: An Overview of Theory Exploration
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1737openalex-snapshot
Sound Lemma Generation for Proving Inductive Validity of Equations
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6226openalex-snapshot
Automation of Mathematical Induction as part of the History of Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1405.3426openalex-snapshot
Hipster: Integrating Theory Exploration in a Proof Assistant
inferred← citeshttps://doi.org/10.48550/arxiv.1710.06515openalex-snapshot
Enhancing Inductive Entailment Proofs in Separation Logic with Lemma Synthesis
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.