Automation for interactive proof: First prototype

Information and Computation

Volumn 204, Issue 10, 2006, Pages 1575-1596

  Meng, Jia ^a   Quigley, Claire ^a   Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

FIRST ORDER; HIGHER ORDER LOGIC; INTERACTIVE PROOFS; INTERACTIVE SESSION; INTERACTIVE THEOREM PROVER; NATURAL DEDUCTION; THEOREM PROVERS; TYPE CLASS;

THEOREM PROVING;

EID: 84855199211     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.05.010     Document Type: Article

References (27)

1. Wolfgang Ahrendt, Bernhard Beckert, Reiner Hähnle, Wolfram Menzel, Wolfgang Reif, Gerhard Schellhorn, Peter H. Schmitt, Integrating automated and interactive theorem proving, in: Wolfgang Bibel, Peter H. Schmitt (Eds.), Automated Deduction-A Basis for Applications, volume II. Systems and Implementation Techniques, Kluwer Academic Publishers, Dordrecht, 1998, pp. 97-116.
2. David Aspinall, Proof general: a generic tool for proof development, in: S. Graf, M. Schwartzbach (Eds.), TACAS'00: Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, LNCS, vol. 1785, Springer, Berlin, 2000, pp. 38-42, On the Internet at http://proofgeneral.inf. ed.ac.uk/.
3. Matthias Baaz, Alexander Leitsch, On Skolemization and proof complexity, Fundamenta Informaticae 20(4) (1994) 353-379.
4. Marc Bezem, Dimitri Hendriks, Hans de Nivelle, Automatic proof construction in type theory using resolution, Journal of Automated Reasoning 29 (3-4) (2002) 253-275.
5. Judy Crow, Sam Owre, John Rushby, Natarajan Shankar, Mandayam Srivas, A tutorial introduction to PVS, Technical report, Computer Science Laboratory, SRI International, 1995. First published in Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida.
6. in: Emden R. Gansner, John H. Reppy (Eds.), The Standard ML Basis Library, Cambridge University Press, Cambridge, MA, 2004.
7. Michael J. C. Gordon, Thomas F. Melham, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge University Press, Cambridge, MA, 1993.
8. G. P. Huet, A unification algorithm for typed λ-calculus, Theoretical Computer Science 1(1975) 27-57.
9. Joe Hurd, Integrating Gandalf and HOL, in: Yves Bertot, Gilles Dowek, André Hirschowitz, Christine Paulin, Laurent Théry (Eds.), Theorem Proving in Higher Order Logics: TPHOLs '99, LNCS, vol. 1690, Springer, Berlin, 1999, pp. 311-321.
10. Joe Hurd, First-order proof tactics in higher-order logic theorem provers, in: Myla Archer, Ben Di Vito, César Muñoz (Eds.), Design and Application of Strategies/Tactics in Higher Order Logics, number NASA/CP-2003-212448 in NASA Technical Reports, pages 56-68, September 2003.
11. Andreas Meier, TRAMP: transformation of machine-found proofs into natural deduction proofs at the assertion level (system description), in: David McAllester (Ed.), Automated Deduction-CADE-17 International Conference, LNAI, vol. 1831, Springer, Berlin, 2000, pp. 460-464.
12. Jia Meng, Integration of interactive and automatic provers, in: Manuel Carro, Jesus Correas (Eds.), Second CologNet Workshop on Implementation Technology for Computational Logic Systems, 2003. On the Internet at http://www.cl.cam.ac.uk/users/jm318/papers/integration.pdf.
13. Jia Meng, Lawrence C. Paulson, Experiments on supporting interactive proof using resolution, in: David Basin, Michaël Rusinowitch (Eds.), Automated Reasoning-Second International Joint Conference, IJCAR 2004, LNAI, vol. 3097, Springer, Berlin, 2004, pp. 372-384. (Pubitemid 38939986)
14. Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel, in: Isabelle/HOL: A Proof Assistant for Higher-Order Logic, LNCS Tutorial, vol. 2283, Springer, Berlin, 2002.
15. Andreas Nonnengart, Christoph Weidenbach, Computing small clause normal forms, in: Robinson, Voronkov [20], chapter 6, pp. 335-367.
16. Lawrence C. Paulson, The foundation of a generic theorem prover, Journal of Automated Reasoning 5(3) (1989) 363-397.
17. Lawrence C. Paulson, A generic tableau prover and its integration with Isabelle, Journal of Universal Computer Science 5(3) (1999) 73-87.
18. Lawrence C. Paulson, Isabelle's logics: FOL and ZF. Technical report, Computer Laboratory, University of Cambridge, 2003. On the Internet at http://isabelle.in. tum.de/dist/Isabelle2003/doc/logics-ZF.pdf.
19. Alexander Riazanov, Andrei Voronkov, Vampire 1.1 (system description), in: Rajeev Goré, Alexander Leitsch, Tobias Nipkow (Eds.), Automated Reasoning-First International Joint Conference, IJCAR2001, LNAI, vol. 2083, Springer, Berlin, 2001, pp. 376-380. (Pubitemid 33291438)
20. Alan Robinson, Andrei Voronkov (Eds.), Handbook of Automated Reasoning, Elsevier Science, Amsterdam, 2001.
21. Jörg Siekmann, Christoph Benzmüller, Armin Fiedler, Andreas Meier, Immanuel Normann, Martin Pollet, Proof development with Ω, mega: the irrationality of √2, in: Fairouz Kamareddine (Ed.), Thirty Five Years of Automating Mathematics, Kluwer Academic Publishers, Dordrecht, 2003, pp. 271-314.
22. Geoff Sutcliffe, Christian Suttner, The TPTP problem library: CNF Release v1.2.1, Journal of Automated Reasoning 21(2) (1998) 177-203. (Pubitemid 128514347)
23. G. Sutcliffe, J. Zimmer, S. Schulz, TSTP data-exchange formats for automated theorem proving tools, in: W. Zhang, V. Sorge (Eds.), Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems, number 112 in Frontiers in Artificial Intelligence and Applications, IOS Press, 2004.
24. Christoph Weidenbach, Combining superposition, sorts and splitting, in: Robinson, Voronkov [20], chapter 27, pp. 1965-2013.
25. Markus Wenzel, Type classes and overloading in higher-order logic, in: Elsa L. Gunter, Amy Felty (Eds.), Theorem Proving in Higher Order Logics: TPHOLs '97, LNCS, vol. 1275, Springer, Berlin, 1997, pp. 307-322. (Pubitemid 127112672)
26. Markus M. Wenzel, Isabelle/Isar-A Versatile Environment for Human-readable Formal Proof Documents, Ph. D. thesis, Technische Universität München, 2002.
27. Lawrence Wos, George A. Robinson, Daniel F. Carson, Efficiency and completeness of the set of support strategy in theorem proving, Journal of the ACM 12(4) (1965) 536-541.