On the Completeness and Expressiveness of Spider Diagram Systems

  • Authors:
  • John Howse;Fernando Molina;John Taylor

  • Affiliations:
  • -;-;-

  • Venue:
  • Diagrams '00 Proceedings of the First International Conference on Theory and Application of Diagrams
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations in the specification of large software systems they can be used to reason diagrammatically about sets, their cardinalities and their relationships with other sets. A set of reasoning rules for a spider diagram system is shown to be sound and complete. We discuss the extension of this result to diagrammatically richer notations and also consider their expressiveness. Finally, we show that for a rich enough system we can diagrammatically express the negation of any diagram.