{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:58Z","timestamp":1753889818155,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Ministry of Education, Science and Technological Development of Republic of Serbia","award":["174021"],"award-info":[{"award-number":["174021"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy for the chess KRK endgame. The final, machine verifiable, result presented in this paper is that there is a winning strategy for white in the KRK endgame generalized to $n \\times n$ board (for natural $n$ greater than $3$). We demonstrate that different approaches for computer-based theorem proving work best together and in synergy and that the technology currently available is powerful enough for providing significant help to humans deriving complex proofs.<\/jats:p>","DOI":"10.23638\/lmcs-15(1:34)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:36:14Z","timestamp":1743701774000},"source":"Crossref","is-referenced-by-count":0,"title":["Computer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture"],"prefix":"10.23638","volume":"Volume 15, Issue 1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8922-4948","authenticated-orcid":false,"given":"Predrag","family":"Jani\u010di\u0107","sequence":"first","affiliation":[]},{"given":"Filip","family":"Mari\u0107","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Malikovi\u0107","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,3,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1801.07528v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1801.07528v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:36:16Z","timestamp":1743701776000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(1:34)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1801.07528v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1801.07528v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1801.07528v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1801.07528","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1801.07528","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,3,29]]},"article-number":"4233"}}