Location of Repository

Generating proofs with spider diagrams using heuristics

By Jean Flower, Judith Masthoff and Gem Stapleton

Abstract

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

Topics: G000 Computing and Mathematical Sciences
Publisher: Knowledge Systems Institute
Year: 2004
OAI identifier: oai:eprints.brighton.ac.uk:2849

Suggested articles

Preview

Citations

  1. (1968). A formal basis for the heuristic determination of minimum cost paths. doi
  2. (2002). Artificial intelligence: Structures and strategies for complex problem solving. Fourth Edition.
  3. (2004). Automated Theorem Proving with Spider Diagrams. doi
  4. (1999). Formalising spider diagrams. doi
  5. (1985). Generalized best-first search strategies and the optimality of A∗. doi
  6. (2002). Generating Euler Diagrams. doi
  7. (2004). Generating Readable Proofs: A Heuristic Approach to Theorem Proving with Spider Diagrams. doi
  8. (2001). Reasoning with extended Venn-Peirce diagrammatic systems.
  9. (2004). Reasoning with Spider diagrams. Avaiable from www.cmis.brighton.ac.uk/research/vmg,
  10. (2000). SD2: A sound and complete diagrammatic reasoning system. doi
  11. (1994). The Logical Status of Diagrams. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.