A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Methods of Lemma Extraction in Natural Deduction Proofs
2012
Journal of automated reasoning
The existing examples of natural deduction proofs, either declarative or procedural, indicate that often the legibility of proof scripts is of secondary importance to the authors. As soon as the computer accepts the proof script, many authors do not work on improving the parts that could be shortened and do not avoid repetitions of technical sub-deductions, which often could be replaced by a single lemma. This article presents selected properties of reasoning passages that may be used to
doi:10.1007/s10817-012-9267-0
fatcat:umkypcbtgrc47h5wjyorsobnr4