Satallax: An automatic higher-order prover

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

Volumn 7364 LNAI, Issue , 2012, Pages 111-117

  Brown, Chad E ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

higher order logic; higher order theorem proving; simple type theory

Indexed keywords

HIGHER ORDER LOGIC; SIMPLE TYPES; TABLEAU RULES; THEOREM PROVERS;

THEOREM PROVING;

PROBLEM SOLVING;

EID: 84863632508     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31365-3_11     Document Type: Conference Paper

References (11)

1. Backes, J., Brown, C.E.: Analytic Tableaux for Higher-Order Logic with Choice. Journal of Automated Reasoning 47(4), 451-479 (2011)
2. Benzmüller, C.: Equality and Extensionality in Automated Higher-Order Theorem Proving. PhD thesis, Universität des Saarlandes (1999)
3. Benzmüller, C., Paulson, L.C., Theiss, F., Fietzke, A.: LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 162-170. Springer, Heidelberg (2008)
4. Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT Solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 116-130. Springer, Heidelberg (2011)
5. Brown, C.E.: Solving for Set Variables in Higher-Order Theorem Proving. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 408-422. Springer, Heidelberg (2002)
6. Brown, C.E.: Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 147-161. Springer, Heidelberg (2011)
7. De Moura, L., Bjørner, N.: Satisfiability modulo theories: introduction and applications. Commununications of the ACM 54(9), 69-77 (2011)
8. Éen, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
9. McCarthy, J.: A Tough Nut for Proof Procedures. Stanford Artificial Intelligence Memo No. 16 (July 1964)
10. Sutcliffe, G.: The TPTP Problem Library and Associated Infrastructure: The FOF and CNF Parts, v3.5.0. Journal of Automated Reasoning 43(4), 337-362 (2009)
11. Sutcliffe, G.: The CADE-23 Automated Theorem Proving System Competition - CASC-23. AI Communications 25(1), 49-63 (2012)