Skip to main content
SpringerLink
Log in

Tableau-based theorem provers: Systems and implementations

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

A list of tableau-based theorem provers was assembled in spring and summer 1993 as the result of a widespread enquiry via e-mail. It is intended to provide a brief overview of the field and existing implementations. For each system, a short description is given. Additionally, useful information about the system is presented in tabular form. This includes the type of logic that can be handled by the system (input), the implementation language, hardware, and operating systems requirements (implementation). Most of the systems are available as binaries or as sources with documentation and can be obtained via anonymous ftp or upon request. The descriptions and further information have been submitted by the individuals whose names are given as contact address. The provers are ordered alphabetically by their name (or the author's name).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Astrachan, O. L.: Investigations in Model Elimination Based Theorem Proving, PhD thesis, Duke University, 1992.

  2. Astrachan, O. L. and Loveland, D. W.: METEORs: High performance theorem provers using model elimination, in R. S. Boyer (ed.),Automated Reasoning: Essays in Honor of Woody Bledsoe, Kluwer Academic Publishers, 1991.

  3. Astrachan, O. L. and Stickel, M. E.: Caching and lemmaizing in model elimination theorem provers, in D. Kapur (ed.),Proc. CADE 11, 11th International Conference on Automated Deduction, Lecture Notes in AI, Springer, 1992, pp. 224–238.

  4. Atkinson, W. and Cunningham, J.: Proving properties of a safety-critical system,IEEE Software Engineering Journal 6(2) (1991), 41–50. Charles Babbage Award Paper.

    Google Scholar 

  5. Baumgartner, P.: Linear Completion: Combining the Linear and the Unit-Resulting Restrictions. Research Report 9/93, University of Koblenz, 1993.

  6. Baumgartner, P. and Furbach, U.: Model elimination without contrapositives, inProc. 12th International Conference on Automated Deduction, Springer, 1994.

  7. Baumgartner, P. and Furbach, U.: PROTEIN: APROver with aTheoryExtensionInterface, in12th International Conference on Automated Deduction, Springer, 1994.

  8. Beckert, B. and Hähnle, R.: An improved method for adding equality to free variable semantic tableau, in D. Kapur (ed.),Proc. CADE 11, 11th International Conference on Automated Deduction, Saratoga Springs, Lecture Notes in AI 607, Springer-Verlag, 1992, pp. 507–521.

  9. Bose, S., Clarke, E. M., Long, D. E., and Michaylov, S.: Parthenon: a parallel theorem prover for non-Horn clauses,Journal of Automated Reasoning 8 (1992), 153–181.

    Google Scholar 

  10. Costa, M. and Cunningham, J.: Tableaux for an action logic. Technical Report PPR1, Esprit 3125 Medlar project, 1993. (Accepted subject to revision by theJournal of Logic and Computation.)

  11. Crawford, J. M. and Auton, L. D.: Experimental results on the crossover point in satisfiability problems, inProc. AAAI-93, 1993.

  12. Dahn, B. I.: Integration of logic functions, in J. Denzinger and J. Avenhaus (eds),Proc. of the Annual Meeting of “GI-Fachgruppe Deduktion,” SEKI-Report SR-93-11. Universität Kaiserslautern, 1993.

  13. de Kogel, E. A. and Ophelders, W. M. J.: A tableaux-based automated theorem prover, in H. C. M. de Swart (ed.),LOGIC: Mathematics, Language, Computer Science and Philosophy, vol. 2, Verlag Peter Lang, 1994.

  14. de Swart, H. C. M. and Ophelders, W. M. J.: Tableaux, resolution, and complexity of formulas, inMethods of Logic in Computer Science, 1993.

  15. Ertel, W.: OR-parallel theorem proving with random competition, inProceedings of LPAR'92, LNAI, vol. 624, Springer, 1992, pp. 226–237.

  16. Gerberding, S.: DT-Ein Tableaubeweiser für dreiwertige Prädikatenlogik erster Stufe. User's Manual and System Description, 1992.

  17. Goubault, J.: Démonstration automatique en logique classique: Complexité et méthodes. PhD thesis, Laboratoire d'informatique de l'Ecole Polytechnique, Ecole Polytechnique, Palaiseau, France, 1993.

    Google Scholar 

  18. Goubault, J.: Syntax independent connections, inProc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France, Max Planck-Institut für Informatik, Saarbrücken, Germany, 1993.

    Google Scholar 

  19. Grundy, M.: Cameo: Refutation Proving by Unordered Model Classifications. Technical Report TR-ARP-6/90, The Australian National University, Automated Reasoning Project, 1990.

  20. Grundy, M.: Tableau Efficiency and Cameo. Technical Report TR-ARP-13/91, The Australian National University, Automated Reasoning Project, 1991.

  21. Grundy, M.: Theorem Prover Generation Using Refutation Procedures. PhD dissertation, The University of Sydney, Basser Department of Computer Science, 1992.

  22. Hähnle, R.:Automated Theorem Proving in Multiple-Valued Logics, Oxford University Press, 1993.

  23. Hähnle, R., Beckert, B., Gerberding, S., and Kernig, W.: The Many-Valued Tableau-Based Theorem Prover3 T A P. Technical Report, IBM Germany Scientific Center Institute of Knowledge Based Systems, 1992.

  24. Hähnle, R. and Schmitt, P. H.: The Liberalized δ-Rule in Free Variable Semantic Tableaux. Technical Report, Universität Karlsruhe, Institut für Logik, Komplexität und Deduktionssysteme, 1991.

  25. Kumar, R., Schneider, K., and Kropf, Th.: Structuring and automating hardware proofs in a higher-order theorem-proving environment,Journal of Formal Methods in System Design,2(2) (1993), 165–230.

    Google Scholar 

  26. Lafon, E. and Schwind, C. B.: A theorem prover for action performance, in E. Kodratoff (ed.),European Conference on Artificial Intelligence, ECAI-88, Pitman, 1988, pp. 541–546.

  27. Letz, R., Schumann, J., Bayerl, S., and Bibel, W.: SETHEO: A high-performance theorem prover,Journal of Automated Reasoning 8(2) (1992), 183–212.

    Google Scholar 

  28. Loveland, D. W.:Automated Theorem Proving: a Logical Basis, North-Holland, Amsterdam, 1978.

    Google Scholar 

  29. Murray, N. and Rosenthal, E.: On the relative merits of path dissolution and the method of analytic tableaux (Condensed), inProc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France, Max Planck-Institut für Informatik, Saarbrücken, Germany, 1993, pp. 183–194.

    Google Scholar 

  30. Neitz, W.: A connection method-based theorem prover with selective backtracking, inProc. Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Lautenbach, Germany, number TR 8/92. Institute für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, 1992.

  31. Neitz, W.: Selective backtracking in the connection method, inProc. IMYCS'92, Gorden and Breach, 1992.

  32. Ophelders, W. M. J.: Automated Theorem Proving Based upon a Tableau-Method with Unification under Restrictions: Theory, Implementation and Empirical Results. PhD thesis, Tilburg University, The Netherlands, 1992.

    Google Scholar 

  33. Ophelders, W. M. J. and de Swart, H. C. M.: Tableaux versus resolution: A comparison,Fundamenta Informaticae 18(2–4) (1993), 109–127. Special Issue: Algebraic Logic and Its Applications.

    Google Scholar 

  34. Oppacher, S. and Suen, E.: HARP: A tableau-based theorem prover,Journal of Automated Reasoning (4) (1988), 69–100.

  35. Posegga, J.:Deduktion mit Shannongraphen für Prädikatenlogik erster Stufe, Dissertation, Universität Karlsruhe, Germany, 1993.

    Google Scholar 

  36. Posegga, J. and Ludäscher, B.: Towards first-order deduction based on shannon graphs, inProc. German Workshop on Artificial Intelligence (GWAI), Bonn, Germany, Lecture Notes in AI, Springer, 1992.

  37. Posegga, J. and Schneider, K.: Deduction with first-order BDDs, inProc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France, Max Planck-Institut für Informatik, Saarbrücken, Germany, 1993.

    Google Scholar 

  38. Ramesh, A. and Murray, N.: Experiments in computing prime implicants and prime implicates using techniques not requiring clause form, inProc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France. Max Planck-Institut für Informatik, Saarbrücken, Germany, 1993, pp. 225–228.

    Google Scholar 

  39. Ramesh, A. and Murray, N.: Non-clausal deductive techniques for computing prime implicants and prime implicates, inFourth International Conference on Logic Programming and Automated Reasoning (LPAR), Lecture Notes in AI, Springer, 1993.

  40. Schneider, K., Kumar, R., and Kropf, Th.: Accelerating tableaux proofs using compact representations,Journal of Formal Methods in System Design (1993).

  41. Schneider, K., Kumar, R., and Kropf, Th.: Hardware verification with first-order BDDs, inConference on Computer Hardware Description Languages (1993).

  42. Schumann, J. and Letz, R.: PARTHEO: A high-performance parallel theorem prover, inProceedings of the 10th International Conference on Automated Deduction (CADE), Lecture Notes in AI 449, Springer, 1990, pp. 40–56.

  43. Schwind, C. B.: Un démonstrateur de théorèmes pour des logiques modales et temporelles, en Prolog, inSème Congrès AFCET Reconnaissances des formes et Intelligence Artificielle, Grenoble, 1985, pp. 897–913.

  44. Schwind, C. B.: A tableaux-based theorem prover for a decidable subset of default logic, in M. E. Stickel (ed.),Proc. CADE 10, 10th International Conference on Automated Deduction, Kaiserslautern, Germany, Lecture Notes in AI 449, Springer-Verlag, 1990, pp. 528–542.

  45. Stickel, M. E.: A Prolog technology theorem prover: implementation by an extended prolog compiler,Journal of Automated Reasoning 4(4) (1988), 353–380.

    Google Scholar 

  46. Stickel, M. E.: A Prolog technology theorem prover: a new exposition and implementation in prolog,Theoretical Computer Science 104 (1992), 109–128.

    Google Scholar 

  47. Tammet, T.:Proof Search Strategies in Linear Logic, Programming Methodology Group Report 70, Chalmers University of Technology, University of Göteborg, 1993.

  48. Wallace, K.: Tableau-based automated theorem provers: the use of heuristics and software engineering techniques to increase deductive power. PhD thesis, University of Newcastle, Australia, 1994 (to appear).

  49. Wolf, A.:Deduktionssysteme und Taktikübersetzung, Diplomarbeit, Humboldt-Universität zu Berlin, Fachbereich Mathematik, 1992.

  50. Wrightson, G.:Semantic Tableaux, Unification and Links, Technical Report CSD-ANZARP-84-001, Victoria University, Wellington, New Zealand, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, 80290, Munich, Germany

    J. Schumann

Authors
  1. J. Schumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schumann, J. Tableau-based theorem provers: Systems and implementations. J Autom Reasoning 13, 409–421 (1994). https://doi.org/10.1007/BF00881952

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881952

Key words

Search

Navigation