Equivalences in Euler-based diagram systems through normal forms

AbstractThe form of information presented can influence its utility for the conveying of knowledge by affecting an interpreter’s ability to reason with the information. There are distinct types of representational systems (for example, symbolic versus diagrammatic logics), various sub-systems (for example, propositional versus predicate logics), and even within a single representational system there may be different means of expressing the same piece of information content. Thus, to display information, choices must be made between its different representations, depending upon many factors such as: the context, the reasoning tasks to be considered, user preferences or desires (for example, for short symbolic sentences or minimal clutter within diagrammatic systems). The identification of all equivalent representations with the same information content is a sensible precursor to attempts to minimise a metric over this class. We posit that defining notions of semantic redundancy and identifying the syntactic properties that encapsulate redundancy can help in achieving the goal of completely identifying equivalences within a single notational system or across multiple systems, but that care must be taken when extending systems, since refinements of redundancy conditions may be necessary even for conservative system extensions. We demonstrate this theory within two diagrammatic systems, which are Euler-diagram-based notations. Such notations can be used to represent logical information and have applications including visualisation of database queries, social network visualisation, statistical data visualisation, and as the basis of more expressive diagrammatic logics such as constraint languages used in software specification and reasoning. The development of the new associated machinery and concepts required is important in its own right since it increases the growing body of knowledge on diagrammatic logics. In particular, we consider Euler diagrams with shading, and then we conservatively extend the system to include projections, which allow for a much greater degree of flexibility of representation. We give syntactic properties that encapsulate semantic equivalence in both systems, whilst observing that the same semantic concept of redundancy is significantly more difficult to realise as syntactic properties in the extended system with projections.</jats:p

Extending Spider Diagrams for policy definition

Spider Diagrams (SDs) are a well-established visual language used to specify sets, their relationships, and constraints on their cardinalities. We propose two extensions allowing their use in the definition of temporal policies. Firstly, Timed SDs (TSDs) enable the expression of temporal constraints. We adopt an interval-based model of calendar time, permitting diagram elements to be specified to exist only over some interval. We introduce basic TSDs, where time constraints refer to an entire diagram rather than individual elements, as a canonical form for TSDs, and decompose complex TSDs into comic strip-like sequences of basic TSDs. Secondly, we introduce an innovative usage of SDs by specialising and adapting them to an OO-modelling context: in type-SDs a spider represents a type, whereas in instance-SDs a spider represents a specific object of a given type. A notion of conformance of an instance-SD to a type-SD ensues and we extend the concepts to instance-TSDs and type-TSDs. Finally, we combine extensions to allow the specification of temporal policies, which define permissible states for instances of some given type over a period without temporal gaps in it, and introduce a notion of conformance to a policy for a sequence of time-annotated instances. (C) 2012 Elsevier Ltd. All rights reserved