On the readability of diagrammatic proofs

Stapleton, Gem, Jamnik, M. and Masthoff, J. (2009) On the readability of diagrammatic proofs In: Automated Reasoning Workshop, 21-22 April 2009, Liverpool, UK.

Full text not available from this repository.


Recently, much effort has been placed on developing diagrammatic logics, with a focus on obtaining sound and complete reasoning systems. A hypothesis of the diagrammatic reasoning community is that many people find diagrammatic proofs easier to read than symbolic proofs. This hypothesis has not been thoroughly tested, although significant effort has been directed towards understanding what makes diagrams more readable than symbolic formulae. We are interested in how to automatically find readable diagrammatic proofs. To achieve this aim, significant research is required that builds on the existing state-of-the-art. This extended abstract summarizes our plans for research on this topic.

Item Type: Contribution to conference proceedings in the public domain (Abstract)
Subjects: G000 Computing and Mathematical Sciences > G100 Mathematics
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: editor cmis
Date Deposited: 21 Feb 2012 12:04
Last Modified: 21 Apr 2015 10:35
URI: http://eprints.brighton.ac.uk/id/eprint/9858

Actions (login required)

View Item View Item


Downloads per month over past year