Algorithm Synthesis by Lazy Thinking: Using Problem Schemes

Bruno Buchberger, Adrian Crăciun · 2004

Recently, as part of a general formal (i.e. logic based) methodology for mathematical knowledge management we also introduced a method for the automated synthesis of correct algorithms, which we called the lazy thinking method. For a given concrete problem specification (in predicate logic), the method tries out various algorithm schemes and derives specifications for the subalgorithms in the algorithm scheme.

Read the paper · More papers on PaperTik