Generating proofs with spider diagrams using heuristics
Flower, J., Masthoff, J. and Stapleton, G. (2004) Generating proofs with spider diagrams using heuristics In: Proceedings of 10th International Conference on Distributed Multimedia Systems, International Workshop on Visual Languages and Computing. Knowledge Systems Institute, pp. 91-98.
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.
Repository Staff Only: item control page