A generic tableau prover and its integration with isabelle

Journal of Universal Computer Science

Volumn 5, Issue 3, 1999, Pages 73-87

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013087577     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. [Baaz and Fermüller, 1995] Baaz, M. and Fermüller, C. G. (1995). Non-elementary speedups between different versions of tableaux. In P. Baumgartner, R. Hähnle, and J. Posegga, editors, Theorem Proving with Analytic Tableaux and Related Methods: 4th International Workshop, TABLEA UX '95, LNAI 918, pages 217-230. Springer.
2. [Baaz and Leitsch, 1994] Baaz, M. and Leitsch, A. (1994). On Skolemization and proof complexity. Fundamenta Informaticae, 20, 353-379.
3. [Beckert and Posegga, 1995] Beckert, B. and Posegga, J. (1995). LeanTAP: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3), 339-358.
4. [Beckert et al., 1993] Beckert, B., Hähnle, R., and Schmitt, P. H. (1993). The even more liberalized 5-rule in free variable semantic tableaux. In G. Gottlob, A. Leitsch, and D. Mundici, editors, Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93 Colloquium, LNCS 713, pages 108-119. Springer.
5. [Bundy et al., 1991] Bundy, A., van Harmelen, F., Hesketh, J., and Smaill, A. (1991). Experiments with proof plans for induction. Journal of Automated Reasoning, 7(3), 303-324.
6. [Dafa, 1997] Dafa, L. (1997). Unification algorithms for eliminating and introducing quantifiers in natural deduction automated theorem proving. Journal of Automated Reasoning, 18(1), 105-134.
7. [Davis, 1981] Davis, M. (1981). Obvious logical inferences. In 7th International Joint Conference on Artificial Intelligence (IJCAI '81), pages 530-531.
8. [Hähnle and Schmitt, 1994] Hähnle, R. and Schmitt, P. H. (1994). The liberalized δ-rule in free variable semantic tableaux. Journal of Automated Reasoning, 13(2), 211-221.
9. [Huet, 1975] Huet, G. P. (1975). A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1, 27-57.
10. [Korf, 1985] Korf, R. E. (1985). Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27, 97-109.
11. [Lifschitz, 1989] Lifschitz, V. (1989). What is the inverse method? Journal of Automated Reasoning, 5(1), 1-23.
12. [Miller, 1992] Miller, D. (1992). Unification under a mixed prefix. Journal of Symbolic Computation, 14(4), 321-358.
13. [Nipkow and Snelting, 1991] Nipkow, T. and Snelting, G. (1991). Type classes and overloading resolution via order-sorted unification. In 5th ACM Conf. Functional Programming Languages and Computer Architecture, pages 1-14. Springer. LNCS 523.
14. [Paulson, 1989] Paulson, L. C. (1989). The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3), 363-397.
15. [Paulson, 1993] Paulson, L. C. (1993). Set theory for verification: I. From foundations to functions. Journal of Automated Reasoning, 11(3), 353-389.
16. [Paulson, 1994] Paulson, L. C. (1994). Isabelle: A Generic Theorem Prover. Springer. LNCS 828.
17. [Paulson, 1995] Paulson, L. C. (1995). Set theory for verification: II. Induction and recursion. Journal of Automated Reasoning, 15(2), 167-215.
18. [Paulson, 1996] Paulson, L. C. (1996). ML for the Working Programmer. Cambridge University Press, 2nd edition.
19. [Paulson, 1997a] Paulson, L. C. (1997a). Generic automatic proof tools. In R. Veroff, editor, Automated Reasoning and its Applications: Essays in Honor of Larry Wos, chapter 3. MIT Press.
20. [Paulson, 1997b] Paulson, L. C. (1997b). Proving properties of security protocols by induction. In 10th Computer Security Foundations Workshop, pages 70-83. IEEE Computer Society Press.
21. [Paulson and Gra̧bczewski, 1996] Paulson, L. C. and Gra̧bczewski, K. (1996). Mechanizing set theory: Cardinal arithmetic and the axiom of choice. Journal of Automated Reasoning, 17(3), 291-323.
22. [Pelletier, 1986] Pelletier, F. J. (1986). Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2, 191-216. Errata, JAR 4 (1988), 235-236 and JAR 18 (1997), 135.
23. [Rudnicki, 1987] Rudnicki, P. (1987). Obvious inferences. Journal of Automated Reasoning, 3(4), 383-393.
24. [Stenz et al., 1999] Stenz, G., Ahrendt, W., and Beckert, B. (1999). Proof transformations from search-oriented into interaction-oriented tableau calculi. Journal of Universal Computer Science, 5(this number).
25. [Stickel, 1988] Stickel, M. E. (1988). A Prolog technology theorem prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning, 4(4), 353-380.
26. [Sutcliffe and Suttner, 1998] Sutcliffe, G. and Suttner, C. (1998). The TPTP problem library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2), 177-203.