Patching faulty conjectures

DOI10.1007/3-540-61511-3_70zbMATH Open1415.03027OpenAlexW2108239812MaRDI QIDQ4647501FDOQ4647501

Authors: Martin Protzen 

Publication date: 15 January 2019

Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61511-3_70

Recommendations

• Logic Based Program Synthesis and Transformation
• Predicting failures of and repairing inductive proof attempts
• Artificial Intelligence and Symbolic Computation
• Appropriate lemmae discovery
• scientific article; zbMATH DE number 408777

zbMATH Keywords

proof treeinduction proofrecursive callground terminduction hypothesis

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• On proving the termination of algorithms by machine
• Title not available (Why is that?)
• Lazy generation of induction hypotheses
• Rippling: A heuristic for guiding inductive proofs
• Title not available (Why is that?)
• Two examples of computational creativity: ILP multiple predicate synthesis and the `assets' in theorem proving

Cited In (2)

• Predicting failures of and repairing inductive proof attempts
• Logic Based Program Synthesis and Transformation

This page was built for publication: Patching faulty conjectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647501)