Electronic Notes in Theoretical Computer Science · 2004 · 30 citations · 6 references
ComputingComputer ScienceMathematicsAlgorithmsFormal MethodsTheory Of ComputationAutomated ReasoningDeductive ReasoningDeductive VerificationMathematical KnowledgeMathematical ReasoningTheorem ProvingAutomated Proof CheckingAutomated Theorem ProvingAutomatic Theorem ProvingComputational ReasoningCorrectness CheckingProof AutomationProof SearchTop-down Synthesis
Recently, we proposed a systematic method for top-down synthesis and verification of lemmata and algorithms called “lazy thinking method” as a part of systematic mathematical theory exploration (mathematical knowledge management). The lazy thinking method is characterized: by using a library of theorem and algorithm schemes and by using the information contained in failing attempts to prove the schematic theorem or the correctness theorem for the algorithm scheme for inventing lemmata or requirements for subalgorithms, respectively.
6
Top-down synthesis of divide-and-conquer algorithms
Douglas R. Smith · Artificial Intelligence · 1985 · 156 citations
Douglas C. Schmidt, Mohamed E. Fayad, Ralph E. Johnson · Communications of the ACM · 1996 · 154 citations
ALGORITHM INVENTION AND VERIFICATION BY LAZY THINKING
Bruno Buchberger · 2004 · 26 citations