DocumentCode
3199855
Title
Reasoning with spider diagrams
Author
Howse, John ; Molina, Fernando ; Taylor, John ; Kent, Stuart
Author_Institution
Sch. of Comput. & Math. Sci., Brighton Polytech., UK
fYear
1999
fDate
1999
Firstpage
138
Lastpage
145
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 (UML). 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 the 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
Keywords
diagrams; inference mechanisms; object-oriented languages; object-oriented methods; set theory; specification languages; visual languages; Euler circles; UML; Unified Modelling Language; Venn diagrams; diagram equivalence rule; diagrammatic reasoning; disjunctive diagrams; inference rules; object-oriented modelling notations; semantics; set constraints; set relationships; spider diagrams; syntax; visual formalisms; Gas insulated transmission lines; Hip; Jacobian matrices; Laboratories; Logic; Mathematics; Pressing; Programming; Read only memory; Unified modeling language;
fLanguage
English
Publisher
ieee
Conference_Titel
Visual Languages, 1999. Proceedings. 1999 IEEE Symposium on
Conference_Location
Tokyo
ISSN
1049-2615
Print_ISBN
0-7695-0216-4
Type
conf
DOI
10.1109/VL.1999.795885
Filename
795885
Link To Document