Controlling deduction with proof condensation and heuristics

  • F. Oppacher
  • E. Suen
Special Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)


This paper presents a proof condensation (or redundancy elimination) procedure and heuristic rules that are used to enhance the tableau-based theorem prover HARP. The proof condensation procedure makes proofs easier to construct and more readable by excising redundancies from proof trees. Since the entire language of first-order logic is used without preprocessing, heuristics can be formulated to capture efficient and human-like deduction strategies. We also present evidence that the combination of these two techniques enable HARP to solve challenging problems such as Schubert's Steamroller.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be65]
    E.W.Beth. The Foundations of Mathematics. North-Holland, 1965.Google Scholar
  2. [Bi82]
    W. Bibel. "A Comparative Study of Several Proof Procedures". Artificial Intelligence (18, 1982), pp 269–293.CrossRefGoogle Scholar
  3. [B183]
    W.W.Bledsoe. The UT Interactive Prover. University of Texas at Austin, ATP-17B, 1983.Google Scholar
  4. [Co81]
    D.N. Cohen. Knowledge Based Theorem Proving and Learning. UMI Research Press, Ann Arbor, Michigan, 1981.Google Scholar
  5. [Co85]
    A.G.Cohn. "On the solution of Schubert's Steamroller in Many Sorted Logic". IJCAI85, pp 1169–1173.Google Scholar
  6. [Fi83]
    M.C. Fitting. Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht, Holland, 1983.Google Scholar
  7. [Hi55]
    J.Hintikka. Form and Content in Quantification Theory. Acta Philosophica Fennica 8, 1955.Google Scholar
  8. [Je67]
    R.C. Jeffrey. Formal Logic: Its Scope and Limits. McGraw-Hill, New York, 1967.Google Scholar
  9. [Lo78]
    D. Loveland. Automated Theorem Proving: A Logical Basis. North Holland, New York, 1978.Google Scholar
  10. [Mu82]
    N.V. Murray. "Completely Non-Clausal Theorem Proving". Artificial Intelligence (18, 1982), pp 67–85.CrossRefGoogle Scholar
  11. [Ni80]
    N.Nilsson. Principles of Artificial Intelligence. Tioga, Palo Alto, 1980.Google Scholar
  12. [Ro81]
    J.A. Robinson. Logic: Form and Function. North Holland, New York, 1981.Google Scholar
  13. [Sc85]
    W. Schonfeld. "Prolog extensions based on Tableau Calculus". IJCAI 85, pp 730–732.Google Scholar
  14. [Sm68]
    R.M. Smullyan. First-Order Logic. Springer Verlag, Berlin, 1968.Google Scholar
  15. [St84]
    W. Stegmuller, M.V. v.Kibed, Strukturtypen der Logik. Springer-Verlag, New York, 1984.Google Scholar
  16. [Wa83]
    C.Walther. "A many-sorted calculus based on resolution and paramodulation". IJCAI 83, Vol. 2, pp 882–891.Google Scholar
  17. [Wa85]
    C.Walther. "A mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution". Artificial Intelligence, (May 1985), pp 217–224.Google Scholar
  18. [Wr84]
    G. Wrightson. Semantic Tableaux, Unification and Links. Technical Report CSD-ANZARP-84-001, 1984, Victoria University, Wellington, New Zealand.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • F. Oppacher
    • 1
  • E. Suen
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations