Howse, J. and Molina, F. and Taylor, J. and Kent, S. (1999) Reasoning with Spider Diagrams. In: Proceedings of IEEE Symposium on Visual Languages (VL99), Sep 13-16, 1999, Tokyo, Japan.
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)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||05 Sep 2009 09:37|
|Last Modified:||06 Sep 2011 04:03|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21742 (The current URI for this page, for reference purposes)|
- Depositors only (login required):