Generating readable proofs: a heuristic approach to theorum proving with spider diagrams

Flower, Jean, Masthoff, Judith and STAPLETON, GEM (2004) Generating readable proofs: a heuristic approach to theorum proving with spider diagrams In: Proceedings of the Third International Conference, Diagrams 2004, Cambridge, UK, March 22-24, 2004.

Full text not available from this repository.

Abstract

An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express logical statements. Ideally, automatically generated proofs should be short and easy to understand. An existing proof generator for spider diagrams successfully writes proofs, but they can be long and unwieldy. In this paper, we present a new approach to proof writing in diagrammatic systems, which is guaranteed to find shortest proofs and can be extended to incorporate other readability criteria. We apply the A* algorithm and develop an admissible heuristic function to guide automatic proof construction. We demonstrate the effectiveness of the heuristic used. The work has been implemented as part of a spider diagram reasoning tool.

Item Type: Contribution to conference proceedings in the public domain ( Full Paper)
Uncontrolled Keywords: Visual languages; Spider diagrams; Heuristics
Subjects: G000 Computing and Mathematical Sciences
DOI (a stable link to the resource): 10.1007/978-3-540-25931-2_17
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 26 Nov 2007
Last Modified: 04 Oct 2013 08:51
URI: http://eprints.brighton.ac.uk/id/eprint/2876

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year