Abstract. Generalisation is a major 'open ' problem in theorem-proving which must often be addressed when attempting automation of proofs involving mathematical induction. This paper proposes a new, uniform method of generalisation, involving the transformation of proofs, which encompasses many different types of generalisation and which may succeed when other methods fail.
Contains fulltext : 91550.pdf (preprint version ) (Open Access)First Workshop on A...
Abstract In this paper, we provide a general setting under which results of normalization of proof t...
In this thesis we develop a comprehensive human-oriented theorem proving system that integrates seve...
In general, cut elimination holds for arithmetical systems with the w -rule, but not for systems w...
We present a proof-theoretic foundation for automated deduction in linear logic. At first, we system...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Mathematical induction is required for reasoning about objects or events containing repe-tition, e.g...
Analysis and transformation techniques developed for logic programming can be successfully applied t...
Most automated theorem provers suffer on the problem that the proofs they produce are difficult to u...
In this paper we will look at automated theorem proving for categorial grammar logics. Taking linear...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
AbstractWe present a proof-theoretic foundation for automated deduction in linear logic. At first, w...
Most automated theorem provers suffer from the problem that theycan produce proofs only in formalism...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Contains fulltext : 91550.pdf (preprint version ) (Open Access)First Workshop on A...
Abstract In this paper, we provide a general setting under which results of normalization of proof t...
In this thesis we develop a comprehensive human-oriented theorem proving system that integrates seve...
In general, cut elimination holds for arithmetical systems with the w -rule, but not for systems w...
We present a proof-theoretic foundation for automated deduction in linear logic. At first, we system...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Mathematical induction is required for reasoning about objects or events containing repe-tition, e.g...
Analysis and transformation techniques developed for logic programming can be successfully applied t...
Most automated theorem provers suffer on the problem that the proofs they produce are difficult to u...
In this paper we will look at automated theorem proving for categorial grammar logics. Taking linear...
This paper summarizes the theoretical foundations and basic methodology of automated theorem-proving...
AbstractWe present a proof-theoretic foundation for automated deduction in linear logic. At first, w...
Most automated theorem provers suffer from the problem that theycan produce proofs only in formalism...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Contains fulltext : 91550.pdf (preprint version ) (Open Access)First Workshop on A...
Abstract In this paper, we provide a general setting under which results of normalization of proof t...
In this thesis we develop a comprehensive human-oriented theorem proving system that integrates seve...