Skip to main content
Article thumbnail
Location of Repository

Appendices for automated theorem proving in Euler diagram systems

By Gem Stapleton, J. Masthoff, J. Flower, Andrew Fish and J. Southern

Abstract

This report is a series of appendices to accompany the paper Automated Theorem Proving in Euler Diagram Systems. Here we include some details omitted from that paper and some additional discussions that may be of interest. In appendix A, we give an overview of the A* search algorithm in the context of theorem proving. We establish the expressiveness of Euler diagrams in appendix B. A complete worked example showing how to calculate the restrictive heuristic is given in appendix C. The proofs of the three theorems given in the paper are included in appendix D. The notion of clutter in Euler diagrams and how our tactics steer Edith towards proofs containing diagrams with low `clutter scores' is covered in appendix E. Details on how we generated proof tasks to evaluate Edith are given in appendix F. Finally, much of our evaluation is presented in appendix G, although the main results are included in the paper

Topics: G100 Mathematics
Publisher: University of Brighton
Year: 2006
OAI identifier: oai:eprints.brighton.ac.uk:3000

Suggested articles

Citations

  1. (2006). A Very Mathematical Dilemma. doi
  2. (2006). Automated Theorem Proving in Euler Diagram Systems. Submitted to Journal of Automated Reasoning, doi
  3. (2002). Corresponding Regions in Euler Diagrams. doi
  4. (2004). Dynamic Euler Diagram Drawing. doi
  5. (2004). English Summaries of Mathematical Proofs.
  6. (2004). Exact (Exponential) Algorithms for the Dominating Set Problem. doi
  7. (2006). Exploring the Notion of Clutter in Euler Diagrams. doi
  8. Fish and Gem Stapleton were partially supported by EPSRC grants GR/R63516 and GR/R63509 for the Reasoning with Diagrams project and EP/E011160 for the Visualization with Euler Diagrams project. Gem Stapleton is supported by a Leverhulme Trust Early
  9. (1985). Generalized Best-First Search Strategies and the Optimality of A∗. doi
  10. (2002). Generating Euler Diagrams. doi
  11. (2001). Implementing Euler/Venn Reasoning Systems, doi
  12. (2005). Measuring and Reducing Clutter in Euler Diagrams. doi
  13. Spider Diagrams. doi

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