Skip to main content
SpringerLink
Log in

Abstraction mappings in mechanical theorem proving

  • Friday Morning
  • Conference paper
  • First Online:
Book cover 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

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

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. Boyer, R. S. Locking, a restriction of resolution, Ph.D. Thesis, University of Texas at Austin (1971).

    Google Scholar 

  2. Kling, R. E. A paradigm for reasoning by analogy, Artificial Intelligence 2(1971), pp. 147–178.

    Google Scholar 

  3. Lankford, D. S. Canonical algebraic simplification in computational logic. Report No. ATP-25, Southwestern University, Georgetown, Texas (1975).

    Google Scholar 

  4. Munyer, J. C. Towards the use of analogy in deductive tasks, University of California at Santa Cruz (1979).

    Google Scholar 

  5. Newell, A. and Simon, H. GPS, a program that simulates human thought, Computers and Thought, E. A. Feigenbaum and J. Feldman (Eds.), McGraw-Hill, New York, 1963, pp. 279–293.

    Google Scholar 

  6. Plaisted, D. Theorem proving with abstraction, part II, Report No. UIUCDCS-R-79-965, University of Illinois, Urbana, Illinois (1979).

    Google Scholar 

  7. Robinson, J. A. Automatic deduction with hyper-resolution, Internat. J. Comput. Math. 1 (1965), pp. 227–234.

    Google Scholar 

  8. Sacerdoti, E. Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974), pp. 115–135.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois

    D. A. Plaisted

Authors
  1. D. A. Plaisted
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plaisted, D.A. (1980). Abstraction mappings in mechanical theorem proving. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation