A Decidable Constraint Diagram Reasoning System

Authors:
Gem Stapleton;John Howse;John Taylor
Affiliations:
Visual Modelling Group, University of Brighton, Brighton, BN2 4GJ, UK Email: g.e.stapleton@brighton.ac.uk, john.howse@brighton.ac.uk, john.taylor@brighton.ac.uk;Visual Modelling Group, University of Brighton, Brighton, BN2 4GJ, UK Email: g.e.stapleton@brighton.ac.uk, john.howse@brighton.ac.uk, john.taylor@brighton.ac.uk;Visual Modelling Group, University of Brighton, Brighton, BN2 4GJ, UK Email: g.e.stapleton@brighton.ac.uk, john.howse@brighton.ac.uk, john.taylor@brighton.ac.uk
Venue:
Journal of Logic and Computation
Year:
2005

Citing 0
Cited 10

Evaluating and generalizing constraint diagrams

Journal of Visual Languages and Computing
Diagrammatic Reasoning Systems

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Conceptual Spider Diagrams

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Visual Mathematics: Diagrammatic Formalization and Proof

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Diagrammatic Formal Specification of a Configuration Control Platform

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient on-line algorithms for Euler diagram region computation

Computational Geometry: Theory and Applications
Fragments of spider diagrams of order and their relative expressiveness

Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
A decision procedure for a decidable fragment of generalized constraint diagrams

Journal of Visual Languages and Computing
Visualizing and specifying ontologies using diagrammatic logics

AOW '09 Proceedings of the Fifth Australasian Ontology Workshop - Volume 112
On the expressiveness of spider diagrams and commutative star-free regular languages

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Constraint diagrams are a visual notation designed for use by software engineers to formally specify information systems. In this paper we formalize a fragment of the constraint diagram language. A set of reasoning rules are defined and we prove that this set is both sound and complete. Given constraint diagrams D1 and D2 such that D2 is a semantic consequence of D1, to prove completeness we construct a proof of D2 from D1. A decision procedure can be extracted from this proof construction process and it follows that the system is decidable.