The illinois prover: A general purpose resolution theorem prover

  • Steven Greenbaum
  • David A. Plaisted
Extended Abstracts Of Current Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


Priority System Default Strategy Negative Literal Input Transformation Clause Form 


  1. Chang, C. and Lee, R., Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).Google Scholar
  2. Lusk, E. and Overbeek. R., A portable environment for research in automated reasoning, Proceedings of the 7th Conference in Automated Deduction, R. Shostak, ed., Lecture Notes in Computer Science 170, G. Goos and J. Hartmanis, eds. (Springer-Verlag, New York, 1984), pp. 43–52.Google Scholar
  3. Plaisted, D., Theorem proving with abstraction, Artificial Intelligence 16 (1981) 47–108.CrossRefGoogle Scholar
  4. Plaisted, D., A simplified problem reduction format, Artificial Intelligence 18 (1982) 227–261.CrossRefGoogle Scholar
  5. Plaisted, D., and Greenbaum, S., A structure-preserving clause form translation, Journal of Symbolic Computation, 1986, to appear.Google Scholar
  6. Reboh, R, Raphael, B., Yates, R., Kling, R., and Velarde, C., Study of automatic theorem-proving programs, Technical note 75, Artificial Intelligence Center, SRI International, Menlo Park, California, 1972.Google Scholar
  7. Robinson, J., Theorem proving on the computer, J. ACM 10 (1963) 163–174.CrossRefGoogle Scholar
  8. Walther, C., Schubert's Steamroller — a case study in many sorted resolution, technical report, Institut for Informatik, May, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Steven Greenbaum
    • 1
  • David A. Plaisted
    • 2
  1. 1.DCL 240 Department of Computer ScienceUniversity of IllinoisUrbana
  2. 2.Department of Computer ScienceUniversity of North Carolina at Chapel HillChapel Hill

Personalised recommendations