Appendices for automated theorem proving in Euler diagram systems

Stapleton, G., Masthoff, J., Flower, J., Fish, A. and Southern, J. (2006) Appendices for automated theorem proving in Euler diagram systems University of Brighton, Brighton, UK. (Unpublished)

[img]
Preview
PDF
1344Kb

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.

Item Type:Other form of assessable output
Subjects:G000 Computing and Mathematical Sciences > G100 Mathematics
DOI (a stable link to the resource):VMG.06.2
Faculties:Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
ID Code:3000
Deposited By:Helen Webb
Deposited On:10 Nov 2007
Last Modified:13 Jul 2012 17:37

Repository Staff Only: item control page