Proving correctness of a KRK chess endgame strategy by using isabelle/HOL and Z3

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an executable specification and a total correctness proof of a King and Rook vs King (KRK) chess endgame strategy within the proof assistant Isabelle/HOL. This work builds upon a previous computer-assisted correctness analysis performed using the constraint solver URSA. The distinctive feature of the present machine verifiable formalization is that all central properties have been automatically proved by the SMT solver Z3 integrated into Isabelle/HOL, after being suitably expressed in linear integer arithmetic. This demonstrates that the synergy between the state-of-the-art automated and interactive theorem proving is mature enough so that very complex conjectures from various AI domains can be proved almost in a “push-button” manner, yet in a rich logical framework offered by the modern ITP systems.

Cite

CITATION STYLE

APA

Marić, F., Janičić, P., & Maliković, M. (2015). Proving correctness of a KRK chess endgame strategy by using isabelle/HOL and Z3. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9195, pp. 256–271). Springer Verlag. https://doi.org/10.1007/978-3-319-21401-6_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free