Satallax: An Automatic Higher-Order Prover
暂无分享,去创建一个
[1] Christoph Benzmüller,et al. Equality and extensionality in automated higher order theorem proving , 1999 .
[2] J. McCarthy. A Tough Nut for Proof Procedures , 1964 .
[3] Lawrence C. Paulson,et al. Extending Sledgehammer with SMT Solvers , 2011, CADE.
[4] Nikolaj Bjørner,et al. Satisfiability modulo theories , 2011, Commun. ACM.
[5] Geoff Sutcliffe. The CADE-23 Automated Theorem Proving System Competition - CASC-23 , 2012, AI Commun..
[6] Chad E. Brown,et al. Analytic Tableaux for Higher-Order Logic with Choice , 2010, Journal of Automated Reasoning.
[7] Lawrence C. Paulson,et al. LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) , 2008, IJCAR.
[8] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[9] Chad E. Brown. Solving for Set Variables in Higher-Order Theorem Proving , 2002, CADE.
[10] Armando Tacchella,et al. Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .
[11] Geoff Sutcliffe. The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.
[12] Chad E. Brown. Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems , 2013, Journal of Automated Reasoning.
[13] Nikolaj Bjørner,et al. Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings , 2011, CADE.
[14] Larry Wos,et al. What Is Automated Reasoning? , 1987, J. Autom. Reason..
[15] Andrei Voronkov,et al. Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.