Tactical diagrammatic reasoning
Electronic Proceedings in Theoretical Computer Science, EPTCS
MetadataShow full item record
Linker, S., Burton, J., & Jamnik, M. (2017). Tactical diagrammatic reasoning. Electronic Proceedings in Theoretical Computer Science, EPTCS, 239 29-42. https://doi.org/10.4204/EPTCS.239.3
© S. Linker, J. Burton & M. Jamnik. Although automated reasoning with diagrams has been possible for some years, tools for diagrammatic reasoning are generally much less sophisticated than their sentential cousins. The tasks of exploring levels of automation and abstraction in the construction of proofs and of providing explanations of solutions expressed in the proofs remain to be addressed. In this paper we take an interactive proof assistant for Euler diagrams, Speedith, and add tactics to its reasoning engine, providing a level of automation in the construction of proofs. By adding tactics to Speedith's repertoire of inferences, we ease the interaction between the user and the system and capture a higher level explanation of the essence of the proof. We analysed the design options for tactics by using metrics which relate to human readability, such as the number of inferences and the amount of clutter present in diagrams. Thus, in contrast to the normal case with sentential tactics, our tactics are designed to not only prove the theorem, but also to support explanation.
External DOI: https://doi.org/10.4204/EPTCS.239.3
This record's URL: https://www.repository.cam.ac.uk/handle/1810/277821