论文信息 - Patching Faulty Conjectures

Patching Faulty Conjectures

A method is proposed which allows to abduce the definition of a predicate G during the proof attempt of a (faulty) conjecture H(x) such that ∀ x. G(x) → H(x) holds by construction. It is demonstrated how the synthesized predicate may help to complete an induction proof if the faulty conjecture has been obtained as an (over-) generalization of a true conjecture H'(x). An equivalence preserving transformation of predicates is presented which in some cases allows to unblock induction proofs which fail otherwise.

Martin Protzen | Martin Protzen

[1] Christoph Walther,et al. On Proving the Termination of Algorithms by Machine , 1994, Artif. Intell..

[2] Christoph Walther,et al. Mathematical induction , 1994, Handbook of Logic in Artificial Intelligence and Logic Programming.

[3] Dov M. Gabbay,et al. Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .

[4] Martin Protzen,et al. Lazy Generation of Induction Hypotheses , 1994, CADE.

[5] J. Strother Moore,et al. Computational logic : structure sharing and proof of program properties , 1973 .

[6] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.

[7] Alan Bundy,et al. Proof Plans for the Correction of False Conjectures , 1994, LPAR.

[8] Marta Franová,et al. Predicate Synthesis from Formal Specifications , 1992, ECAI.

[9] Christoph Walther,et al. Computing Induction Axioms , 1992, LPAR.

[10] Martin Protzen. Lazy generation of induction hypotheses and patching faulty conjectures , 1995, DISKI.

[11] Frank van Harmelen,et al. Rippling: A Heuristic for Guiding Inductive Proofs , 1993, Artif. Intell..