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.
Author supplied keywords
Cite
CITATION STYLE
Howse, J., Molina, F., & Taylor, J. (2000). On the completeness and expressiveness of spider diagram systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1889, pp. 26–41). Springer Verlag. https://doi.org/10.1007/3-540-44590-0_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
