Euler diagram generation

Journal of Visual Languages and Computing

Volumn 19, Issue 6, 2008, Pages 675-694

  Flower, J ^a   Fish, A ^a   Howse, J ^a  

^a UNIVERSITY OF BRIGHTON   (United Kingdom)

Author keywords

Automatic generation; Data representation; Drawability; Euler diagrams; Logic visualization

Indexed keywords

EID: 55149113990     PISSN: 1045926X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jvlc.2008.01.004     Document Type: Article

References (36)

1. L. Euler, Lettres a une Princesse d'Allemagne sur divers sujets de physique et de philosophie, Letters 2 102-108 (Berne, Socit Typographique, 1775).
2. Venn J. On the diagrammatic and mechanical representation of propositions and reasonings. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 9 (1880) 1-18
3. Harel D. On visual formalisms. In: Glasgow J., Narayan N.H., and Chandrasekaran B. (Eds). Diagrammatic Reasoning (1988), MIT Press, Cambridge, MA 235-271
4. Howse J., Stapleton G., and Taylor J. Spider diagrams. LMS Journal of Computation and Mathematics 8 (2005) 145-194
5. S. Kent, Constraint diagrams: visualizing invariants in object oriented models, in: Proceedings of OOPSLA 1997, ACM SIGPLAN Notices, vol. 32, 1997, pp. 327-341.
6. J. Thièvre, M. Viaud, A. Verroust-Blondet, Using Euler diagrams in Traditional Library Environments, in: Proceedings of Euler Diagrams 2004, Electronic Notes in Theoretical Computer Science, vol. 134, 2005, pp. 189-202.
7. A. Verroust, M. Viaud, Ensuring the drawability of extended Euler diagrams for up to 8 sets, in: Proceedings of Diagrams 2004, Lecture Notes in Artificial Intelligence, vol. 2980, 2004, pp.128-141.
8. Lemon O., and Pratt I. Spatial logic and the complexity of diagrammatic reasoning. Journal of Machine Graphics and Vision 6 1 (1997) 89-109
9. Kuratowski K. Sur le probleme des courbes gauches en topologie. Fundamenta Mathematicae 15 (1930) 271-283
10. S. Chow, F. Ruskey, Drawing area proportional Venn and Euler diagrams, in: Proceedings of Graph Drawing 2003, Lecture Notes in Computer Science, vol. 2912, 2004, pp. 466-477.
11. S. Chow, F. Ruskey, Towards a general solution to drawing area-proportional Euler diagrams, in: Proceedings of Euler Diagrams 2004, Electronic Notes in Theoretical Computer Science, vol. 134, 2005, pp. 3-18.
12. Kestler H., Müller A., Gress T.M., and Buchholz M. Generalized Venn diagrams: a new method of visualizing complex genetic set relations. Bioinformatics 21 8 (2005) 1592-1595
13. R. De Chiara, U. Erra, V. Scarano, A system for virtual directories using euler diagrams, in: Proceedings of Euler Diagrams 2004, Electronic Notes in Theoretical Computer Science, vol. 134, 2005, pp. 33-53.
14. De Chiara R., Erra U., and Scarano V. VennFS: a Venn diagram file manager. Proceedings of Information Visualisation 2003, IEEE Computer Society (2003), Silver Spring, MD 120-126
15. R. P. Clark, Failure mode modular de-composition using spider diagrams, in: Proceedings of Euler Diagrams 2004, Electronic Notes in Theoretical Computer Science, vol. 134, 2005, pp. 19-31.
16. Shin S.-J. The Logical Status of Diagrams (1994), CUP, Cambridge
17. A. Fish, J. Flower, Investigating reasoning with constraint diagrams, in: Proceedings of Visual Languages and Formal Methods 2004, Electronic Notes in Theoretical Computer Science, vol. 127(4), 2005, pp. 53-69.
18. Hammer E. Logic and Visual Information (1995), CSLI Publications
19. Stapleton G., Thompson S., Howse J., and Taylor J. The expressiveness of spider diagrams. Journal of Logic and Computation 24 6 (2004) 857-880
20. Swoboda N., and Allwein G. Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference. Journal of Software and System Modeling 3 2 (2004) 136-149
21. Flower J., Masthoff J., and Stapleton G. Generating readable proofs: a heuristic approach to theorem proving with spider diagrams. Proceeding of Diagrams 2004, Lecture Notes in Computer Science vol. 2980 (2004), Springer, Berlin 166-181
22. Stapleton G., Masthoff J., Flower J., Fish A., and Southern J. Automated theorem proving in Euler diagram systems. Journal of Automated Reasoning 39 4 (2007) 431-470
23. Fish A., Flower J., and Howse J. The semantics of augmented constraint diagrams. Journal of Visual Languages and Computing 16 6 (2005) 541-573
24. Howse J., and Schuman S. Precise visual modelling. Journal of Software and Systems Modeling 4 3 (2005) 310-325
25. J. Flower, J. Howse, Generating Euler diagrams, in: Proceedings of Diagrams 2002, Lecture Notes in Artificial Intelligence, vol. 2317, 2002, pp. 61-75.
26. Johnson D.S., and Pollak H.O. Hypergraph planarity and the complexity of drawing Venn diagrams. Journal of Graph Theory 11 3 (1987) 309-325
27. Grünbaum B. The construction of Venn diagrams. The College Mathematics Journal 15 3 (1984) 238-247
28. F. Ruskey, A survey of Venn diagrams, The Electronic Journal of Combinatorics (2001), At: 〈http://www.combinatorics.org/Surveys/ds5/VennEJC.html〉.
29. Schaefer M., and Štefanikovič D. Decidability of string graphs. Proceedings of the 33rd ACM Symposium on the Theory of Computing (2001), ACM Press, New York 241-246
30. Schaefer M., Sedgwick E., and Štefanikovič D. Recognizing string graphs in NP. Journal of Computer and System Sciences 67 (2003) 365-380
31. Di Battista G., Eades P., Tamassia R., and Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs (1999), Prentice-Hall, Englewood Cliffs, NJ
32. A. Fish, J. Flower, Abstractions of Euler diagrams, in: Proceedings of Euler Diagrams 2004, Electronic Notes in Theoretical Computer Science, vol. 134, 2005, pp. 77-101.
33. J. Howse, F. Molina, S.-J. Shin, J. Taylor, On diagram tokens and types, in: Proceedings of Diagrams 2002, Lecture Notes in Artificial Intelligence, vol. 2317, 2002, pp. 146-160.
34. Euler diagram drawing tool, Available at 〈http://www.cmis.brighton.ac.uk/research/vmg/download_GED. html〉.
35. Flower J., Howse J., and Taylor J. Nesting in Euler diagrams: syntax, semantics and construction. Journal of Software and Systems Modeling 3 (2004) 55-67
36. Reasoning with Constraint Diagrams tool, Available at 〈http://www.cs.kent.ac.uk/projects/rwd/tools.html〉.