Skip to main content
SpringerLink
Log in

On different concepts of function introduction

  • Contributed Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 713))

Included in the following conference series:

Abstract

In this paper, we introduce a resolution calculus extended by a function introduction rule and by a tautology introduction rule. As opposed to most resolution refinements where tautology deletion does not lengthen a refutation, removing tautologies may disable short refutations if extended resolution calculi are applied. Moreover, the introduction of tautologies may strengthen a resolution calculus augmented by function introduction. We compare resolution calculi extended by different function introduction rules w.r.t. refutation length.

This research was supported by the Federal Ministry for Research and Technology within the project TASSO under grant no. ITW 8900 C2.

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. M. Baaz and A. Leitsch. Complexity of Resolution Proofs and Function Introduction. Annals of Pure and Applied Logic, 57:181–215, 1992.

    Google Scholar 

  2. W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, second edition, 1987.

    Google Scholar 

  3. C. L. Chang and R. C. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.

    Google Scholar 

  4. E. Eder. Relative Complexities of First Order Calculi. Vieweg, Braunschweig, 1992.

    Google Scholar 

  5. U. Egly. Shortening Proofs by Quantifier Introduction. In A. Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning, pages 148–159. Springer Verlag, 1992.

    Google Scholar 

  6. U. Egly. On Different Concepts of Function Introduction. Technical Report AIDA-93–09, FG Intellektik, FB Informatik, TH Darmstadt, 1993.

    Google Scholar 

  7. D. W. Loveland. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland Publishing Company, Amsterdem, New York, Oxford, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FG Intellektik, TH Darmstadt, Alexanderstraße 10, D-64283, Darmstadt

    Uwe Egly

Authors
  1. Uwe Egly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Egly, U. (1993). On different concepts of function introduction. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022565

Download citation

  • DOI: https://doi.org/10.1007/BFb0022565

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

  • Online ISBN: 978-3-540-47943-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation