Proving Correctness of a KRK Chess Endgame Strategy by Using Isabelle/HOL and Z3
暂无分享,去创建一个
[1] Predrag Janicic. URSA: A System for Uniform Reduction to SAT , 2012 .
[2] Marko Maliković,et al. Formalization of a Strategy for the KRK Chess Endgame , 2012 .
[3] Marko Maliković,et al. What Were the Last Moves , 2010 .
[4] Clemens Ballarin,et al. Interpretation of Locales in Isabelle: Theories and Proof Contexts , 2006, MKM.
[5] Predrag Janicic,et al. Proving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving , 2013, J. Int. Comput. Games Assoc..
[6] S. Edelkamp. Symbolic Exploration in Two-Player Games: Preliminary Results , 2002 .
[7] Guy Haworth,et al. Data Assurance in Opaque Computations , 2009, ACG.
[8] Slavka Krautzeka,et al. Formalization of a Strategy for the KRK Chess Endgame , 2012 .
[9] Sascha Böhme,et al. Fast LCF-Style Proof Reconstruction for Z3 , 2010, ITP.
[10] Ken Thompson,et al. Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..
[11] Ivan Bratko,et al. Proving Correctness of Strategies in the AL1 Assertional Language , 1978, Information Processing Letters.
[12] Benjamin Grégoire,et al. A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses , 2011, CPP.
[13] Klaus Schneider,et al. Theorem Proving in Higher Order Logics - Emerging Trends , 2007 .