Generating proofs with spider diagrams using heuristics

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.

PDF - Submitted Version

Official URL:


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
ID Code:2849
Deposited By:Converis
Deposited On:25 Nov 2007
Last Modified:31 Jul 2013 04:01

Repository Staff Only: item control page