Centre for Intelligent Systems and their Applicationsaward number 99303126This thesis presents an investigation into the structure of proof in non-standard analysis using proof-planning. The theory of non-standard analysis, developed by Robinson in the 1960s, offers a more algebraic way of looking at proof in analysis. Proof-planning is a technique for reasoning about proof at the meta-level. In this thesis, we use it to encapsulate the patterns of reasoning that occur in non-standard analysis proofs. We first introduce in detail the mathematical theory and the proof-planning architecture. We then present our research methodology, describe the formal framework, which includes an axiomatisation, and develop suitable evaluation criteri...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
This thesis presents an investigation into the structure of proof in non-standard analysis using pro...
Centre for Intelligent Systems and their ApplicationsCoinduction is a proof rule which is the dual o...
Centre for Intelligent Systems and their ApplicationsProof planning is a paradigm for the automation...
Proof planning is an alternative methodology to classical automated theorem prov-ing based on exhaus...
We present a framework for describing proof planners. This framework is based around a decompositio...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
The workshop on proof theory took place in Vichy at the Pôle Universitaire de Vichy on 25 June 2018....
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtain...
AbstractThis paper describes the proof planning system P ω+ for the meta theorem prove...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
This thesis presents an investigation into the structure of proof in non-standard analysis using pro...
Centre for Intelligent Systems and their ApplicationsCoinduction is a proof rule which is the dual o...
Centre for Intelligent Systems and their ApplicationsProof planning is a paradigm for the automation...
Proof planning is an alternative methodology to classical automated theorem prov-ing based on exhaus...
We present a framework for describing proof planners. This framework is based around a decompositio...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
The workshop on proof theory took place in Vichy at the Pôle Universitaire de Vichy on 25 June 2018....
Proof planning is a powerful technique for theorem proving. Proof plans are descriptions of common p...
We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtain...
AbstractThis paper describes the proof planning system P ω+ for the meta theorem prove...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...