Structuring of Computer-Generated Proofs by Cut Introduction
نویسندگان
چکیده
As modern Automated Deduction systems rely heavily on the use of a machine-oriented representation of a given problem, together with sophisticated redundancy-avoiding techniques, a major task in convincing human users of the correctness of automatically generated proofs is the intelligible representation of these proofs. In this paper, we propose the use of the cut-rule in the human-oriented presentation of computer-generated proofs. The intelligent application of cuts enables the integration of essential lemmata and therefore shortens and structures proof presentation. We show that many translation techniques in Automated Deduction, such as antiprenexing and some forms of normal form translations, can be described as cuts and are indeed part of the deductive solution of a problem. Furthermore, we demonstrate the connection between symmetric simpliication, quantorial extension principles and the application of the cut-rule.
منابع مشابه
Atomic Cut Introduction by Resolution: Proof Structuring and Compression
The careful introduction of cut inferences can be used to structure and possibly compress formal sequent calculus proofs. This paper presents CIRes, an algorithm for the introduction of atomic cuts based on various modifications and improvements of the CERes method, which was originally devised for efficient cut-elimination. It is also demonstrated that CIRes is capable of compressing proofs, a...
متن کاملStructuring Computer Generated Proofs
One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce- dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma- thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs re...
متن کاملAlgorithmic Structuring of Cut-free Proofs
The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB LK where blocks of quanti ers can be introduced in one step is investigated where a distinction is made between linear proofs and proofs in tree form In this framework structuring coincides with the introduction of cuts into a proof The algorithmic solvability of this problem can be reduced to the question of k l...
متن کاملIntroducing Quantified Cuts in Logic with Equality
Cut-introduction is a technique for structuring and compressing formal proofs. In this paper we generalize our cut-introduction method for the introduction of quantified lemmas of the form ∀x.A (for quantifier-free A) to a method generating lemmas of the form ∀x1 . . .∀xn.A. Moreover, we extend the original method to predicate logic with equality. The new method was implemented and applied to t...
متن کاملProof Fragments, Cut-Elimination and Cut-Introduction
Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...
متن کامل