scientific article; zbMATH DE number 3871342

From MaRDI portal
Publication:3338233





[For the entire collection see Zbl 0537.00025.] Specific to analytic proofs is the idea that the proof (or refutation) procedure analyzes the given formula. Analytic proofs are very well suited for an efficient automatic search in computer proofs. As non- analytic methods can be considered approaches (to non-resolution theorem proving) like term-rewriting, built-in inequalities, forward-chaining, models, counterexamples. They sometimes consider formulas not part of the proposed theorem. The traditional non-analytic proof examples are Hilbert-style, Gentzen-style, or natural deduction-style proof systems. These proofs have an elegant and comprehensible format, making use of the mathematical thinking style. An essential problem in theorem proving is to translate a given non- analytic proof into an analytic one, possible to transform this analytic proof into a shorter one, and then to build a new natural deduction proof from it, in a canonical fashion. Extending ideas and improving techniques of \textit{D. A. Miller} [Proofs in higher order logic, Ph. D. Thesis, Carnegie-Mellon Univ. (1983)], the main result of the paper is represented by an explicit algorithm which translates \(I^*\)-proofs into expansion proofs (sections 5, 6, 7). Section 8 states and proves the correctness of a two-step procedure by which resolution refutations can be translated into \(I^*\)-proofs, and, in one more step, into comprehensible natural deduction proofs.











This page was built for publication:

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