Reasoning with Spider Diagrams
نویسندگان
چکیده
Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can usefully be used in conjunction with object-oriented modelling notations such as the Unified Modelling Language. This paper summarises the main syntax and semantics of spider diagrams and introduces four inference rules for reasoning with spider diagrams and a rule governing the equivalence of Venn and Euler forms of spider diagrams. This paper also details rules for combining two spider diagrams to produce a single diagram which retains as much of their combined semantic information as possible and discusses disjunctive diagrams as one possible way of enriching the system in order to combine spider diagrams so that no semantic information is lost.
منابع مشابه
A Normal Form for Spider Diagrams of Order
We develop a reasoning system for an Euler diagram based visual logic, called spider diagrams of order. We define a normal form for spider diagrams of order and provide an algorithm, based on the reasoning system, for producing diagrams in our normal form. Normal forms for visual logics have been shown to assist in proving completeness of associated reasoning systems. We wish to use the reasoni...
متن کاملSpider Diagrams Augmented with Constants: A Complete System
The use of visual languages in computing is varied, ranging from system modelling to the display of data analyzed in computation processes. A prominent example of a visual notation is the Unified Modelling Language (UML), designed for use by software engineers. Constraint diagrams were proposed as an alternative to the UML’s Object Constraint Language. Spider diagrams form a fragment of constra...
متن کاملOn the Completeness of Spider Diagrams Augmented with Constants
Diagrammatic reasoning can be described formally by a number of diagrammatic logics; spider diagrams are one of these, and are used for expressing logical statements about set membership and containment. Here, existing work on spider diagrams is extended to include constant spiders that represent specific individuals. We give a formal syntax and semantics for the extended diagram language befor...
متن کاملHeterogeneous Proofs: Spider Diagrams Meet Higher-Order Provers
We present an interactive heterogeneous theorem proving framework, which performs formal reasoning by arbitrarily mixing diagrammatic and sentential proof steps. We use Isabelle to enable formal reasoning with either traditional sentences or spider diagrams. We provide a mechanisation of the theory of abstract spider diagrams and establish a formal link between diagrammatic concepts and the exi...
متن کاملReasoning with constraint diagrams
There is a range of visual languages which express logical statements, for example Euler diagrams. The effective use of such languages relies on knowledge about whether a diagram is contradictory and whether reasoning can be performed to transform one diagram into another. It is also desirable to know the expressiveness of such languages. Knowing what a language can and cannot express is import...
متن کامل