Abstract
Logics that extend the syntax of Euler diagrams include Venn-II, Euler/Venn, spider diagrams and constraint diagrams, which are first-order. We show that concept diagrams can quantify over sets and binary relations, so they are second-order. Thus, concept diagrams are highly expressive compared with other diagrammatic logics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hammer, E.: Logic and Visual Information. CSLI Publications (1995)
Kent, S.: Constraint diagrams: Visualizing invariants in object oriented modelling. In: Proceedings of OOPSLA 1997, pp. 327–341. ACM Press (1997)
Mineshima, K., Okada, M., Sato, Y., Takemura, R.: Diagrammatic Reasoning System with Euler Circles: Theory and Experiment Design. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrams 2008. LNCS (LNAI), vol. 5223, pp. 188–205. Springer, Heidelberg (2008)
Oliver, I., Howse, J., Stapleton, G., Nuutila, E., Törma, S.: A proposed diagrammatic logic for ontology specification and visualization. In: International Semantic Web Conference (2009)
Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press (1994)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stapleton, G., Howse, J., Chapman, P., Oliver, I., Delaney, A. (2012). What Can Concept Diagrams Say?. In: Cox, P., Plimmer, B., Rodgers, P. (eds) Diagrammatic Representation and Inference. Diagrams 2012. Lecture Notes in Computer Science(), vol 7352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31223-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-31223-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31222-9
Online ISBN: 978-3-642-31223-6
eBook Packages: Computer ScienceComputer Science (R0)