License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITP.2021.16
URN: urn:nbn:de:0030-drops-139112
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13911/
De Lon, Adrian ;
Koepke, Peter ;
Lorenzen, Anton
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche
Abstract
Naproche is an emerging natural proof assistant that accepts input in a controlled natural language for mathematics, which we have integrated with LaTeX for ease of learning and to quickly produce high-quality typeset documents. We present a self-contained formalization of the Mutilated Checkerboard Problem in Naproche, following a proof sketch by John McCarthy. The formalization is embedded in detailed literate style comments. We also briefly describe the Naproche approach.
BibTeX - Entry
@InProceedings{delon_et_al:LIPIcs.ITP.2021.16,
author = {De Lon, Adrian and Koepke, Peter and Lorenzen, Anton},
title = {{A Natural Formalization of the Mutilated Checkerboard Problem in Naproche}},
booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)},
pages = {16:1--16:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-188-7},
ISSN = {1868-8969},
year = {2021},
volume = {193},
editor = {Cohen, Liron and Kaliszyk, Cezary},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13911},
URN = {urn:nbn:de:0030-drops-139112},
doi = {10.4230/LIPIcs.ITP.2021.16},
annote = {Keywords: checkerboard, formalization, formal mathematics, controlled language}
}
Keywords: |
|
checkerboard, formalization, formal mathematics, controlled language |
Collection: |
|
12th International Conference on Interactive Theorem Proving (ITP 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
21.06.2021 |
Supplementary Material: |
|
Software (Source Code): https://github.com/naproche/naproche |