Skip to main content
SpringerLink
Log in

Disproving conjectures

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

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

Included in the following conference series:

Abstract

A calculus to disprove universally quantified conjectures is presented. It's soundness and completeness are verified. Some strategies and heuristics are presented that yield an effective prover based on the calculus. The prover has been integrated into the induction theorem proving system INKA and has proven successful for disproving conjectures, in particular of those synthesized by the system.

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.

Literature

  • R. Aubin, Mechanizing Structural Induction, Ph. D. Thesis, University of Edinburgh, 1976

    Google Scholar 

  • S. Biundo, B. Hummel, D. Hutter, C. Walther, The Karlsruhe Induction Theorem Proving System, Proc. CADE-8, Oxford, Springer LNCS, vol. 230, 1986

    Google Scholar 

  • S. Biundo, Automatische Synthese rekursiver Algorithmen als Beweisverfahren, Dissertation, Universität Karlsruhe, 1990

    Google Scholar 

  • R. S. Boyer & J S. Moore, A Computational Logic, Academic Press, 1979

    Google Scholar 

  • S. Hölldobler, Foundations of Equational Logic Programming, Springer LNCS, vol. 353, 1989

    Google Scholar 

  • J. M. Hullot, Canonical Forms and Unification, Proc. CADE-5, Les Arcs, 1980

    Google Scholar 

  • B. Hummel, Generierung von Induktionsformeln und Generalisierung beim automatischen Beweisen mit vollständiger Induktion, Dissertation, Universität Karlsruhe, 1990

    Google Scholar 

  • N. J. Nilsson, Principles of Artificial Intelligence, Tioga Pub. Comp., 1980

    Google Scholar 

  • M. Protzen, Disproving Conjectures, Internal Report, TH Darmstadt, 1991

    Google Scholar 

  • Chr. Walther, Argument-Bounded Algorithms as a Basis for Automated Termination Proofs, Proc. CADE-9, Argonne 1988

    Google Scholar 

  • Chr. Walther, Computing Induction Axioms, Internal Report, TH Darmstadt, 1991

    Google Scholar 

Download references

Author information

Author notes

  1. Martin Protzen

    Present address: Technische Hochschule Darmstadt, FB Informatik, Alexanderstr. 10, D-6100, Darmstadt, Germany

Authors and Affiliations

    Authors
    1. Martin Protzen
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding author

    Correspondence to Martin Protzen .

    Editor information

    Deepak Kapur

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1992 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Protzen, M. (1992). Disproving conjectures. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_176

    Download citation

    • DOI: https://doi.org/10.1007/3-540-55602-8_176

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-55602-2

    • Online ISBN: 978-3-540-47252-0

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation