On the readability of diagrammatic proofs

Gem Stapleton, M. Jamnik, J. Masthoff

Research output: Contribution to conferenceAbstractpeer-review


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.
Original languageEnglish
Number of pages2
Publication statusPublished - 2009
EventAutomated Reasoning Workshop - Liverpool, UK
Duration: 1 Jan 2009 → …


WorkshopAutomated Reasoning Workshop
Period1/01/09 → …


Dive into the research topics of 'On the readability of diagrammatic proofs'. Together they form a unique fingerprint.

Cite this