School of Computing

Reasoning with Spider Diagrams

J Howse, F Molina, J Taylor, and S Kent

In Proceedings of IEEE Symposium on Visual Languages (VL99), pages 182-196. IEEE Computer Society Press, December 1999.

Abstract

Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can usefully be used in conjunction with object-oriented modelling notations such as the Unified Modelling Language. This paper summarises the main syntax and semantics of spider diagrams and introduces four inference rules for reasoning with spider diagrams and a rule governing the equivalence of Venn and Euler forms of spider diagrams. This paper also details rules for combining two spider diagrams to produce a single diagram which retains as much of their combined semantic information as possible and discusses disjunctive diagrams as one possible way of enriching the system in order to combine spider diagrams so that no semantic information is lost.

Download publication 95 kbytes (PDF)

Bibtex Record

@inproceedings{982,
author = {J Howse and F Molina and J Taylor and S Kent},
title = {{Reasoning with Spider Diagrams}},
month = {December},
year = {1999},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1999/982},
    booktitle = {Proceedings of IEEE Symposium on Visual Languages (VL99)},
    publication_type = {inproceedings},
    publisher = {IEEE Computer Society Press},
    submission_id = {9978_950004142},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014