The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

Research Paper #681

Title:Proof Plans for the Correction of False Conjectures
Authors:Monroy-Borja,R; Bundy,A; Ireland,A
Date:Jan 1994
Presented:Submitted to LPAR'94
Abstract:Theorem proving is the systematic derivation of a mathematical proof from a set of axioms by the use of rules of inference. We are interested in a related but far less explored problem: the analysis and correction of false conjectures, especially where the correction involves finding a collection of antecedents that, together with a set of axioms, transform non-theorems into theorems. Most failed search trees are huge, and special care is to be taken in order to tackle the combinatorial explosion phenomenon. Fortunately, the planning search space generated by proof plans, see [1], are moderately small. We have explored the possibility of using this technique in the implementation of an abduction mechanism to correct non-theorems.

[Search These Pages] [DAI Home Page] [Comment]