Generating proofs with spider diagrams using heuristics


As of July 2018 University of Brighton Repository is no longer updated. Please see our new repository at

Flower, Jean, Masthoff, Judith and Stapleton, Gem (2004) Generating proofs with spider diagrams using heuristics In: 10th International Conference on Distributed Multimedia Systems, International Workshop on Visual Languages and Computing, Oak Brook, Illinois, USA.

VLc04.pdf - Submitted Version

Download (156kB) | Preview


We apply the A¤ algorithm to guide a diagrammatic theorem proving tool. The algorithm requires a heuristic function, which provides a metric on the search space. In this paper we present a collection of metrics between two spider diagrams. We combine these metrics to give a heuristic function that provides a lower bound on the length of a shortest proof from one spider diagram to another, using a collection of sound reasoning rules. We compare the effectiveness of our approach with a breadth- first search for proofs.

Item Type: Contribution to conference proceedings in the public domain ( Full Paper)
Subjects: G000 Computing and Mathematical Sciences
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 25 Nov 2007
Last Modified: 21 Apr 2015 10:47

Actions (login required)

View Item View Item


Downloads per month over past year