Skip to main content

Reasoning with Spider Diagrams

Howse, John, Molina, Fernando, Taylor, John, Kent, Stuart (1999) Reasoning with Spider Diagrams. In: Proceedings of IEEE Symposium on Visual Languages (VL99). . pp. 138-145. IEEE Computer Society Press (doi:10.1109/VL.1999.795885) (KAR id:21742)

Language: English
Click to download this file (97kB)
[thumbnail of reasoning_with_spider_diagrams_howse.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1109/VL.1999.795885
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 05 Sep 2009 09:37 UTC
Last Modified: 16 Nov 2021 10:00 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.