Abstraction mappings in mechanical theorem proving

  • D. A. Plaisted
Friday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 87)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Boyer, R. S. Locking, a restriction of resolution, Ph.D. Thesis, University of Texas at Austin (1971).Google Scholar
  2. [2]
    Kling, R. E. A paradigm for reasoning by analogy, Artificial Intelligence 2(1971), pp. 147–178.Google Scholar
  3. [3]
    Lankford, D. S. Canonical algebraic simplification in computational logic. Report No. ATP-25, Southwestern University, Georgetown, Texas (1975).Google Scholar
  4. [4]
    Munyer, J. C. Towards the use of analogy in deductive tasks, University of California at Santa Cruz (1979).Google Scholar
  5. [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. [6]
    Plaisted, D. Theorem proving with abstraction, part II, Report No. UIUCDCS-R-79-965, University of Illinois, Urbana, Illinois (1979).Google Scholar
  7. [7]
    Robinson, J. A. Automatic deduction with hyper-resolution, Internat. J. Comput. Math. 1 (1965), pp. 227–234.Google Scholar
  8. [8]
    Sacerdoti, E. Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974), pp. 115–135.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • D. A. Plaisted
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbana

Personalised recommendations