@inproceedings{05ca839f38304515a0b3bf9d2b79480e,

title = "Generalizing spiders",

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 {\textquoteleft}or{\textquoteright}. 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.",

author = "Gem Stapleton and John Howse and Kate Toller",

note = "The original publication is available at www.springerlink.com; Proceedings of the 4th International Conference, Diagrams 2006 ; Conference date: 01-01-2006",

year = "2006",

month = jan,

day = "1",

doi = "10.1007/11783183_19",

language = "English",

isbn = "9783540356233",

volume = "4045",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "148--150",

booktitle = "Proceedings of the 4th International Conference, Diagrams 2006",

}