Howse, J. and Molina, F. and Taylor, J. and Kent, S. and Gil, J. (2001) Spider Diagrams: A Diagrammatic Reasoning System. Journal of Visual Languages and Computing, 12 (3). pp. 299-324. ISSN 1045-926X .
|
Download (342Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Official URL http://dx.doi.org/10.1006/jvlc.2000.0210 |
||
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 be used in conjunction with object-oriented modelling notations such as the Unified Modeling Language. This paper summarises the main syntax and semantics of spider diagrams. It also introduces inference rules for reasoning with spider diagrams and a rule for combining spider diagrams. This system is shown to be sound but not complete. Disjunctive diagrams are considered as one way of enriching the system to allow combination of diagrams so that no semantic information is lost. The relationship of this system of spider diagrams to other similar systems, which are known to be sound and complete, is explored briefly.
| Item Type: | Article |
|---|---|
| Additional information: | Event title: IEEE Symposium on Visual Languages (VL99); Event location: Tokyo, Japan; Event dates: 1999 |
| Uncontrolled keywords: | diagrammatic reasoning; visual formalisms |
| 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: | 24 Nov 2008 17:59 |
| Last Modified: | 06 Sep 2011 01:11 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/13604 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
