Abstract
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive normal form for formulae of propositional logic or prenex normal form for formulae of predicate logic. There are algorithms for ‘reducing’ a given formula to a semantically equivalent formula in normal form. Normal forms are used in a variety of contexts including proofs of completeness, automated theorem proving, logic programming etc. In this paper, we develop a normal form for unitary Euler diagrams with shading. We give an algorithm for reducing a given Euler diagram to a semantically equivalent diagram in normal form and hence a decision procedure for determining whether two Euler diagrams are semantically equivalent. Potential applications of the normal form include clutter reduction and automated theorem proving in systems based on Euler diagrams.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Harel, D.: On visual formalisms. In: Glasgow, J., Narayan, N.H., Chandrasekaran, B. (eds.) Diagrammatic Reasoning, pp. 235–271. MIT Press, Cambridge (1998)
Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS Journal of Computation and Mathematics 8, 145–194 (2005)
Swoboda, N., Allwein, G.: Using DAG transformations to verify Euler/Venn homogeneous and Euler/Venn FOL heterogeneous rules of inference. Journal on Software and System Modeling 3(2), 136–149 (2004)
Kent, S.: Constraint diagrams: Visualizing invariants in object oriented modelling. In: Proceedings of OOPSLA 1997, October 1997, pp. 327–341. ACM Press, New York (1997)
Ruskey, F.: A survey of Venn diagrams. Electronic Journal of Combinatorics (1997, updated 2001, 2005), www.combinatorics.org/Surveys/ds5/VennEJC.html
DeChiara, R., Erra, U., Scarano, V.: VennFS: A Venn diagram file manager. In: Proceedings of Information Visualisation, pp. 120–126. IEEE Computer Society, Los Alamitos (2003)
Thièvre, J., Viaud, M., Verroust-Blondet, A.: Using euler diagrams in traditional library environments. In: Euler Diagrams 2004. ENTCS, vol. 134, pp. 189–202 (2005)
Howse, J., Schuman, S.: Precise visual modelling. Journal of Software and Systems Modeling 4, 310–325 (2005)
Flower, J., Fish, A., Howse, J.: Euler diagram generation. Journal of Visual Languages and Computing (to appear, 2008), http://dx.doi.org/10.1016/j.jvlc.2008.01.004
John, C., Fish, A., Howse, J., Taylor, J.: Exploring the notion of clutter in Euler diagrams. In: Barker-Plummer, D., Cox, R., Swoboda, N. (eds.) Diagrams 2006. LNCS (LNAI), vol. 4045, pp. 267–282. Springer, Heidelberg (2006)
Stapleton, G., Masthoff, J.: Incorporating negation into visual logics: A case study using Euler diagrams. In: Visual Languages and Computing 2007, Knowledge Systems Institute, pp. 187–194 (2007)
Howse, J., Molina, F., Shin, S.J., Taylor, J.: Type-syntax and token-syntax in diagrammatic systems. In: Proceedings of 2nd International Conference on Formal Ontology in Information Systems, Maine, USA, pp. 174–185. ACM Press, New York (2001)
Flower, J., Howse, J., Taylor, J.: Nesting in Euler diagrams: syntax, semantics and construction. Software and Systems Modelling 3, 55–67 (2004)
John, C.: Measuring and Reducing Clutter in Spider Diagrams with Projections. Ph.D thesis, University of Brighton (2006)
Gil, J., Howse, J., Kent, S., Taylor, J.: Projections in Venn-Euler diagrams. In: Proc. IEEE Symposium on Visual Languages, September 2000, pp. 119–126. IEEE Computer Society Press, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fish, A., John, C., Taylor, J. (2008). A Normal Form for Euler Diagrams with Shading. In: Stapleton, G., Howse, J., Lee, J. (eds) Diagrammatic Representation and Inference. Diagrams 2008. Lecture Notes in Computer Science(), vol 5223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87730-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-87730-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87729-5
Online ISBN: 978-3-540-87730-1
eBook Packages: Computer ScienceComputer Science (R0)