Generalizing spiders

Gem Stapleton, John Howse, Kate Toller

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBNpeer-review


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.
Original languageEnglish
Title of host publicationProceedings of the 4th International Conference, Diagrams 2006
Place of PublicationBerlin Heidelberg
Number of pages3
ISBN (Electronic)9783540356240
ISBN (Print)9783540356233
Publication statusPublished - 1 Jan 2006
EventProceedings of the 4th International Conference, Diagrams 2006 - Stanford, CA, USA, 28-30 June, 2006
Duration: 1 Jan 2006 → …

Publication series

NameLecture Notes in Computer Science


ConferenceProceedings of the 4th International Conference, Diagrams 2006
Period1/01/06 → …

Bibliographical note

The original publication is available at


Dive into the research topics of 'Generalizing spiders'. Together they form a unique fingerprint.

Cite this