Generalizing spiders

STAPLETON, GEM, HOWSE, JOHN and Toller, Kate (2006) Generalizing spiders In: Proceedings of the 4th International Conference, Diagrams 2006, Stanford, CA, USA, 28-30 June, 2006.

Full text not available from this repository.

Abstract

Recent times have seen various formal diagrammatic logics and reasoning systems emerging [1, 4, 5, 7]. Many of these logics are based on the popular and intuitive Euler diagrams; see [6] for an overview. The diagrams in figure 1 are all based on Euler diagrams and are examples of unitary diagrams. Compound diagrams are formed by joining unitary diagrams using connectives such as ‘or’. We generalize the syntax of spider diagrams (of which d 3 in figure 1 is an example), increasing the expressiveness of the unitary system. These generalizations give rise to a more natural way of expressing some statements because there is an explicit mapping from the statement to a generalized diagram. Our theoretical motivation is to provide the necessary underpinning required to develop efficient automated theorem proving techniques: developing such techniques for compound systems is challenging and enhancing the expressiveness of unitary diagrams will enable more theorems to be proved efficiently.

Item Type: Contribution to conference proceedings in the public domain ( Full Paper)
Additional Information: The original publication is available at www.springerlink.com
Subjects: G000 Computing and Mathematical Sciences
DOI (a stable link to the resource): 10.1007/11783183_19
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 24 Nov 2007
Last Modified: 08 May 2013 03:01
URI: http://eprints.brighton.ac.uk/id/eprint/3003

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year