Skip to main content
Article thumbnail
Location of Repository

Enhancing the expressiveness of spider diagram systems

By Gem Stapleton and John Howse

Abstract

Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority are monadic and some include equality. Spider diagrams are one such language, being equivalent in expressive power to monadic first order logic with equality. Spiders are used to represent the existence of elements or specific individuals and distinct spiders represent distinct elements. Logical connectives are used to join diagrams, increasing the expressiveness of the language. Spider diagrams that do not incorporate logical connectives are called unitary diagrams. In this paper we explore generalizations of the spider diagram system. We consider the effects of these generalizations on the expressiveness of unitary spider diagrams and on conciseness

Topics: G000 Computing and Mathematical Sciences
Publisher: Knowledge Systems Institute
Year: 2006
OAI identifier: oai:eprints.brighton.ac.uk:3269

Suggested articles

Citations

  1. (2003). A constraint diagram reasoning system.
  2. (2005). A decidable constraint diagram reasoning system. doi
  3. (2005). A new language for the visualisation of logic and reasoning.
  4. (2004). Automated theorem proving with spider diagrams. doi
  5. (2005). Collaborative knowledge capture in ontologies. doi
  6. (1933). Collected Papers, doi
  7. (1997). Constraint diagrams: Visualizing invariants in object oriented modelling. doi
  8. (2004). Dr Doodle: A diagrammatic theorem prover. doi
  9. (2003). Drawing area-proportional Venn and Euler diagrams. doi
  10. Drawing graphs in Euler diagrams. doi
  11. (2004). Dynamic Euler diagram drawing. doi
  12. (2004). Ensuring the drawability of Euler diagrams for up to eight sets. doi
  13. (2005). Euler diagrams for visualizing annotated gene expression data.
  14. (2004). Failure mode modular de-composition using spider diagrams. doi
  15. (1999). Formalising spider diagrams. doi
  16. (2002). Generating Euler diagrams. doi
  17. (2004). Generating proofs with spider diagrams using heuristics. doi
  18. (2004). Generating readable proofs: A heuristic approach to theorem proving with spider diagrams. doi
  19. (2004). Investigating reasoning with constraint diagrams. doi
  20. (2003). Layout metrics for Euler diagrams. doi
  21. (1995). Logic and Visual Information. doi
  22. (2001). Mathematical Reasoning with Diagrams.
  23. (2005). Precise visual modelling. doi
  24. (2005). Spider diagrams. doi
  25. (2005). Tableaux for diagrammatic reasoning.
  26. (2004). The expressiveness of spider diagrams augmented with constants. doi
  27. (2004). The expressiveness of spider diagrams. doi
  28. (1994). The Logical Status of Diagrams. doi
  29. (2005). The semantics of augmented constraint diagrams. doi
  30. (2005). Towards a general solution to drawing area-proportional Euler diagrams. doi
  31. (2002). Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of interence. doi
  32. (2003). VennFS: A Venn diagram file manager. doi
  33. (1999). Visualization of formal specifications. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.