Advanced visual modeling (tutorial session): beyond UML
Proceedings of the 22nd international conference on Software engineering
Formal methods for distributed processing
Advanced visual modelling: beyond UML
Proceedings of the 24th International Conference on Software Engineering
The Metamodelling Language Calculus: Foundation Semantics for UML
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Engineering Modelling Languages: A Precise Meta-Modelling Approach
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
On the Completeness and Expressiveness of Spider Diagram Systems
Diagrams '00 Proceedings of the First International Conference on Theory and Application of Diagrams
Workshop on Graph Transformation and Visual Modeling Techniques
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Constraint Diagrams: A Step Beyond UML
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Diagrammatic Reasoning Systems
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
A Survey of Reasoning Systems Based on Euler Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Consistency checking and visualization of OCL constraints
UML'00 Proceedings of the 3rd international conference on The unified modeling language: advancing the standard
Syllogisms in Rudimentary Linear Logic, Diagrammatically
Journal of Logic, Language and Information
| Hi-index | 0.00 |
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 modeling notations such as the Unified Modeling Language. This paper summaries 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.