Skip to main content
SpringerLink
Log in

Patching faulty conjectures

  • Session 1B
  • Conference paper
  • First Online:
Automated Deduction — Cade-13 (CADE 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1104))

Included in the following conference series:

Abstract

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.

Most of the work presented in this paper was prepared while at the Fachbereich Informatik, TH Darmstadt, Germany.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robert S. Boyer, J Strother Moore. A Computational Logic. Academic Press, 1979.

    Google Scholar 

  2. A. Bundy et al., Rippling: A Heuristic for Guiding Inductive Proofs. Artificial Intelligence, vol. 62, no. 2, 185–253, August 1993.

    Article  Google Scholar 

  3. Marta Franova, Yves Kodratoff. Predicate Synthesis from Formal Specifications. Proc. ECAI 1992, pp. 87, 1992.

    Google Scholar 

  4. Raul Monroy, Alan Bundy, Andrew Ireland. Proof Plans for the Correction of False Conjectures. Proc. LPAR 1994, Springer LNCS vol. 822, 1994.

    Google Scholar 

  5. J Strother Moore. Computational Logic: Structure sharing and proof of program properties, part II. Unpublished PhD thesis, University of Edinburgh, 1974.

    Google Scholar 

  6. Martin Protzen. Lazy Generation of Induction Hypotheses. Proc. CADE-12, Springer LNAI vol. 814, pp. 42, Nancy, France, 1994.

    Google Scholar 

  7. Martin Protzen. Lazy Generation of Induction Hypotheses and Patching Faulty Conjectures. Doctoral Dissertation, Infix, St. Augustin, 1995.

    Google Scholar 

  8. C. Walther, Computing Induction Axioms, Proc. LPAR 1992, St. Petersburg, Springer LNCS vol. 624, 1992.

    Google Scholar 

  9. Christoph Walther. Mathematical Induction. In: D.M. Gabbay, C.J. Hogger & J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, Oxford University Press, 1994.

    Google Scholar 

  10. Christoph Walther. On Proving the Termination of Algorithms by Machine. Artificial Intelligence, vol. 71, no. 1, pp. 101–159, November 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Debis Systemhaus - IT-Sicherheit, Oxfordstr. 12-16, D-53111, Bonn, Germany

    Martin Protzen

Authors
  1. Martin Protzen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. A. McRobbie J. K. Slaney

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Protzen, M. (1996). Patching faulty conjectures. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-61511-3_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61511-8

  • Online ISBN: 978-3-540-68687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation