Skip to main content
SpringerLink
Log in

Some reordering properties for inequality proof trees

  • Section II: Algorithms
  • Conference paper
  • First Online:
Book cover Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

Included in the following conference series:

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. W. W. Bledsoe — L. M. Hines: Variable elimination and chaining in a resolution — based prover for inequalities. Proc. 5th Conference on Automated Deduction. Springer LNCS 87, ed. W. Bibel — R. Kowalski, p. 70–87.

    Google Scholar 

  2. W. W. Bledsoe — K. Kunen — R. Shostak: Completeness Results for Inequality Provers. Manuscript 1982.

    Google Scholar 

  3. W. W. Bledsoe — R. Neveln — R. Shostak: Completeness Results for a Class of Inequality Provers, Univ. of Texas Math. Dept. Memo ATP 60, March 1981

    Google Scholar 

  4. K. Kunen: A Completeness Theorem for Multiple Chaining, Univ. of Texas Math. Dept. Memo ATP 61, Aug. 1980.

    Google Scholar 

  5. D. W. Loveland: Automated Theorem Proving: A Logical Basis. Amsterdam 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Aachen, Germany

    Michael M. Richter

Authors
  1. Michael M. Richter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Richter, M.M. (1984). Some reordering properties for inequality proof trees. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation