Spider diagrams of order

CEUR Workshop Proceedings

Volumn 274, Issue , 2007, Pages 27-39

  Delaney, Aidan ^a   Stapleton, Gem ^a  

^a UNIVERSITY OF BRIGHTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; FORMALISATION; ORDER RELATION; PIECEWISE TESTABLE LANGUAGES; SPIDER DIAGRAMS; VISUAL LOGIC;

SEMANTICS; VISUAL LANGUAGES;

GRAPHIC METHODS;

EID: 79952059035     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. R. Clark. Failure mode modular de-composition using spider diagrams. In Proc. of Euler Diagrams 2004, Volume 134 of Electronic Notes in Theoretical Computer Science, pages 19-31, 2005. (Pubitemid 40682566)
2. R. DeChiara, U. Erra, and V. Scarano. A system for virtual directories using Euler diagrams. In Proc. of Euler Diagrams 04, Volume 134 of Electronic Notes in Theoretical Computer Science, pages 33-53, 2005. (Pubitemid 40682567)
3. Aidan Delaney and Gem Stapleton. On the descriptional complexity of a diagrammatic notation (to appear). In Visual Languages and Computing, 2007.
4. Volker Diekert and Yves Métivier. Partial Communication and Traces, pages 457-531. Springer-Verlag New York, Inc., 1997.
5. A. Fish, J. Flower, and J. Howse. The semantics of augmented constraint diagrams. J. of Visual Languages and Computing, 16:541-573, 2005. (Pubitemid 41644449)
6. E. Hammer. Logic and Visual Information. CSLI Publications, 1995.
7. Pierre-Cyrille Héam. On shuffle ideals. Theoretical Informatics and Applications, 36:359-384, 2002.
8. J. Howse, G. Stapleton, and J. Taylor. Spider diagrams. LMS J. of Computation and Mathematics, 8:145-194, 2005.
9. J. Lovdahl. Towards a Visual Editing Environment for the Languages of the Semantic Web. PhD thesis, Linkoping University, 2002.
10. Jean-Eric Pin. Syntactic semigroups, pages 679-746. Springer-Verlag New York, Inc., 1997.
11. Jean-Eric Pin and Pascal Weil. Polynomial closure and unambiguous product. Theoretical Computer Science, 30: 1-39, 1997.
12. Alexander Rabinovich. Star free expressions over the reals. Theor. Comput. Sci., 233(1-2):233-245, 2000.
13. Kai Salomaa and Sheng Yu. Synchronization expressions and lanugages. J. of Universal Computer Science, 5(9), 1999.
14. S.-J. Shin. The Logical Status of Diagrams. Cambridge University Press, 1994.
15. G. Stapleton and J. Howse. Enhancing the expressiveness of spider diagram systems. In Proc. of Distributed Multimedia Systems, Intl. Workshop on Visual Languages and Computings, pages 129-138. Knowledge Systems Institute, 2006.
16. G. Stapleton, S. Thompson, J. Howse, and J. Taylor. The expressiveness of spider diagrams. J. of Logic and Computation, 14(6): 857-880, 2004. (Pubitemid 40009826)
17. N. Swoboda and G. Allwein. Heterogeneous reasoning with Euler/Venn diagrams containing named constants and FOL. In Proc. of Euler Diagrams 2004, Volume 134 of ENTCS. Elsevier Science, 2005.
18. J. Thièvre, M. Viaud, and A. Verroust-Blondet. Using euler diagrams in traditional library environments. In Euler Diagrams 2004, Volume 134 of ENTCS, pages 189-202. ENTCS, 2005. (Pubitemid 40682573)
19. Wolfgang Thomas. Languages, automata, and logic, pages 389-455. Springer-Verlag New York, Inc., 1997.