Sledgehammer: Judgement day

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6173 LNAI, Issue , 2010, Pages 107-121

  Böhme, Sascha ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL EVALUATIONS; FIRST ORDER LOGIC; HIGHER ORDER LOGIC; INTERACTIVE THEOREM PROVER; ISABELLE; ISABELLE THEORIES; PROOF OBLIGATIONS; RUNTIMES; TEST DATA;

AUTOMATION; FORMAL LOGIC; PROBLEM SOLVING;

AUTOMATA THEORY;

EID: 77955233329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14203-1_9     Document Type: Conference Paper

References (16)

1. Bradley, A., Manna, Z.: Property-directed incremental invariant generation. Formal Asp. Comput. 20, 379-405 (2008)
2. Huang, X.: Reconstructing proofs at the assertion level. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 738-752. Springer, Heidelberg (1994)
3. Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Archer, M., Di Vito, B., Muñoz, C. (eds.) Design and Application of Strategies/Tactics in Higher Order Logics. Number NASA/CP-2003-212448 in NASA Technical Reports, pp. 56-68 (2003)
4. Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. J. Automated Reasoning 40, 35-60 (2008)
5. Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Applied Logic 7, 41-57 (2009)
6. Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002), http://www.in.tum.de/~nipkow/LNCS2283/
7. Paulson, L.C., Susanto, K.W.: Source-level proof reconstruction for interactive theorem proving. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 232-245. Springer, Heidelberg (2007)
8. Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15, 91-110 (2002)
9. Schulz, S.: E - a brainiac theorem prover. AI Commun. 15(2-3), 111-126 (2002)
10. Sutcliffe, G., Zimmer, J., Schulz, S.: TSTP Data-Exchange Formats for Automated Theorem Proving Tools. In: Sorge, V., Zhang, W. (eds.) Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems, pp. 201-215. IOS Press, Amsterdam (2004)
11. Sutcliffe, G.: The 4th IJCAR Automated Theorem Proving System Competition - CASC-J4. AI Commun. 22, 59-72 (2009)
12. Sutcliffe, G.: SystemOnTPTP. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 406-410. Springer, Heidelberg (2000)
13. Urban, J.: MPTP 0.2: Design, implementation, and initial experiments. J. Automated Reasoning 37(1-2), 21-43 (2006)
14. Weidenbach, C., Dimova, D., Fietzke, A., Kumar, R., Suda, M., Wischnewski, P.: Spass version 3.5. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 140-145. Springer, Heidelberg (2009)
15. Wenzel, M.: Isar - a generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Thery, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167-183. Springer, Heidelberg (1999)
16. Wos, L., Robinson, G., Carson, D.: Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12, 536-541 (1965)