### Abstract

Original language | English |
---|---|

Publisher | University of Brighton |

Number of pages | 35 |

Place of Publication | Brighton, UK |

Publication status | Published - 2006 |

### Fingerprint

### Bibliographical note

VMG.06.2### Cite this

*Brighton, UK: University of Brighton*.

}

*Appendices for automated theorem proving in Euler diagram systems*. University of Brighton, Brighton, UK.

**Appendices for automated theorem proving in Euler diagram systems.** / Stapleton, Gem; Masthoff, J.; Flower, J.; Fish, Andrew; Southern, J.

Research output: Other contribution › Research

TY - GEN

T1 - Appendices for automated theorem proving in Euler diagram systems

AU - Stapleton, Gem

AU - Masthoff, J.

AU - Flower, J.

AU - Fish, Andrew

AU - Southern, J.

N1 - VMG.06.2

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

M3 - Other contribution

PB - University of Brighton

CY - Brighton, UK

ER -