Add to ORKGOne of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation procedures have been designed in order to state these proofs in a formalism that is more familiar to a human mathematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs represented as abstract refutation graphs into natural deduction proofs. During this process topological properties of the refutation graphs can be exploited in order to obtain structured proofs.
This paper presents a graph implementation of natural deduction for rst-order intuitionistic logic....
In this paper, we introduce the formalism of deduction graphs as a generalisation of both Gentzen–Pr...
AbstractThis note introduces a method of representing and reasoning about the actions of a class of ...
Most computer generated proofs are stated in abstract representations not normally used by mathemati...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
This paper presents an algorithm that redirects proofs by contradiction. The input is a refutation g...
Most automated theorem provers suffer on the problem that the proofs they produce are difficult to u...
Part I of this thesis studies a fragment of natural deduction to which we have added the notion of s...
We propose a new format for writing proofs, which we call structured calculational proof. The format...
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the struct...
We propose a new format for writing proofs, which we call structured calculational proof. The forma...
Most automated theorem provers suffer from the problem thatthey can produce proofs only in formalism...
Most automated theorem provers suffer from the problem that theycan produce proofs only in formalism...
This paper presents a graph implementation of natural deduction for rst-order intuitionistic logic....
In this paper, we introduce the formalism of deduction graphs as a generalisation of both Gentzen–Pr...
AbstractThis note introduces a method of representing and reasoning about the actions of a class of ...
Most computer generated proofs are stated in abstract representations not normally used by mathemati...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
One of the main reasons why computer generated proofs are not widely accepted is often their complex...
This paper presents an algorithm that redirects proofs by contradiction. The input is a refutation g...
Most automated theorem provers suffer on the problem that the proofs they produce are difficult to u...
Part I of this thesis studies a fragment of natural deduction to which we have added the notion of s...
We propose a new format for writing proofs, which we call structured calculational proof. The format...
Deduction graphs [3] provide a formalism for natural deduction, where the deductions have the struct...
We propose a new format for writing proofs, which we call structured calculational proof. The forma...
Most automated theorem provers suffer from the problem thatthey can produce proofs only in formalism...
Most automated theorem provers suffer from the problem that theycan produce proofs only in formalism...
This paper presents a graph implementation of natural deduction for rst-order intuitionistic logic....
In this paper, we introduce the formalism of deduction graphs as a generalisation of both Gentzen–Pr...
AbstractThis note introduces a method of representing and reasoning about the actions of a class of ...