Automated theorem proving with spider diagrams

Flower, Jean and STAPLETON, GEM (2004) Automated theorem proving with spider diagrams Electronic Notes in Theoretical Computer Science, 91 . pp. 246-263. ISSN 1571-0661

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

Abstract

Spider diagrams are a visual notation for expressing logical statements. In this paper we describe a tool that supports reasoning with a sound and complete spider diagram system. The tool allows the construction of diagrams and proofs by users. We present an algorithm which the tool uses to determine whether one diagram semantically entails another. If the premise diagram does semantically entail the conclusion diagram then a proof is presented to the user. Otherwise it gives a counterexample: a model for the premise that is not a model for the conclusion. The proof of completeness given in [Howse, J., G. Stapleton and J. Taylor, Spider diagrams, In preparation, to appear: www.cmis.brighton.ac.uk/research/vmg] can be used to create an alternative proof writing algorithm. The algorithm described here improves upon this by providing counterexamples and significantly shorter proofs.

Item Type:Journal article
Uncontrolled Keywords:spider diagrams; diagrammatic reasoning; automated reasoning; proof writing
Subjects:G000 Computing and Mathematical Sciences
DOI (a stable link to the resource):10.1016/j.entcs.2003.12.016
Faculties:Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
ID Code:2879
Deposited By:Converis
Deposited On:26 Nov 2007
Last Modified:02 Jul 2013 04:02

Repository Staff Only: item control page