| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Deduction And Theorem Proving (I.2.3) > Mathematical Induction (I.2.3...)
|
|
 |
|
|
| |
|
|
| |
1-3 of 3
Reviews about "Mathematical Induction (I.2.3...)":
|
Date Reviewed |
| |
On terminating lemma speculations
Walther C., Kolbe T. Information and Computation 162(1/2): 96-116, 2000. Type: Article
An original and interesting method is proposed in this paper to improve the performance of theorem provers, based on mathematical induction, via the re-use of previously computed proofs. Re-use of a proof is seen as a problem reduction...
|
Feb 1 2002 |
| |
A finitary version of the calculus of partial inductive definitions
Eriksson L. (ed) Extensions of logic programming (, Stockholm, Sweden, Jan 27-29, 1991) 1341991. Type: Proceedings
A formal system for logic programming is presented. The system is based on a finitary representation of partial inductive definitions, which is clearly connected to pure partial inductive definitions. A finitary representation and its ...
|
Jul 1 1994 |
| |
Proving termination of normalization functions for conditional expressions
Paulson L. Journal of Automated Reasoning 2(1): 63-74, 1986. Type: Article
This paper is presented as a description of an experiment in computer-aided theorem proving, but most of the conclusions derived from this and similar experiments belong to the folklore of the proof theory of the 1960s and 1970s, which...
|
Apr 1 1987 |
| |
|
|
| |
|
