Show simple item record

Proceedings of Logic Programming and Automated Reasoning '94

dc.contributor.authorBundy, Alan
dc.contributor.authorMonroy, Raul
dc.contributor.authorIreland, Andrew
dc.date.accessioned2010-12-22T16:01:00Z
dc.date.available2010-12-22T16:01:00Z
dc.date.issued1994
dc.identifier.urihttp://www.springerlink.com/content/71261q5860p8unv7/en
dc.identifier.urihttp://hdl.handle.net/1842/4572
dc.description.abstractTheorem proving is the systematic derivation of a mathcmaticM proof from a set of axioms by the use of rules of inference. We ~re interested in a related but far less explored problem: the analysis and correction of false conjectures, especiMly where that 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 phenoraenom 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.en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.titleProof Plans for the Correction of False Conjecturesen
dc.typeArticleen
dc.identifier.doihttp://www.springerlink.com/content/71261q5860p8unv7/en
rps.volume822en
rps.titleProceedings of Logic Programming and Automated Reasoning '94en
dc.extent.pageNumbers54-68en
dc.date.updated2010-12-22T16:01:01Z


Files in this item

This item appears in the following Collection(s)

Show simple item record