Results 1 
3 of
3
Planning Diagonalization Proofs
 IN PROCEEDINGS OF 8TH INTERNATIONAL CONFERENCE ON ARTI INTELLIGENCE: METHODOLOGY, SYSTEMS, APPLICATIONS (AIMSA'98), LNAI, SOZOPOL
, 1997
"... ..."
A multimodi Proof Planner
 UNIVERSITY OF KOBLENZLANDAU
, 1998
"... Proof planning is a novel knowledgebased approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical field. This paradigm is adopted in the\Omega mega proof development system, to provide supp ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Proof planning is a novel knowledgebased approach for proof construction, which supports the incorporation of mathematical knowledge and the common mathematical proof techniques of a particular mathematical field. This paradigm is adopted in the\Omega mega proof development system, to provide support for the user. A considerable part of the proof construction and even sometimes the whole work can be undertaken by a proof planner. In the\Omega mega project we are investigating the aspect of computation under bounded resources in mathematical theorem proving. The relevant resources are, in addition to time and memory space, user availability as well as the frequency of user interaction. At this issue, the proof planner of\Omega mega is conceived in such a way that it has a resourceadaptive behaviour. This property of the planner is achieved by a planner modus which defines the planner behaviour depending on which and how many resources are available. In this paper, we describe the...
The Mechanization of the Diagonalization Proof Strategy
 FACHBEREICH INFORMATIK, UNIVERSITAT DES SAARLANDES, IM STADTWALD
, 1996
"... We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) finds an indexing relation, (ii) constructs a diagonal element, and (iii) makes th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) finds an indexing relation, (ii) constructs a diagonal element, and (iii) makes the implicit contradiction of the diagonal element explicit. Moreover we suggest how diagonal elements can be represented.