A decidable constraint diagram reasoning system

Stapleton, Gem, Howse, John and Taylor, John (2005) A decidable constraint diagram reasoning system Journal of Logic and Computation, 15 (6). pp. 975-1008. ISSN 0955-792X

Full text not available from this repository.


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 D_1 and D_2 such that D_2 is a semantic consequence of D_1, to prove completeness we construct a proof of D_2 from D_1. A decision procedure can be extracted from this proof construction process and it follows that the system is decidable

Item Type: Journal article
Uncontrolled Keywords: Visual logic; formal methods; diagrammatic reasoning
Subjects: G000 Computing and Mathematical Sciences > G400 Computing
DOI (a stable link to the resource): 10.1093/logcom/exi041
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 10 May 2007
Last Modified: 20 Apr 2015 15:54
URI: http://eprints.brighton.ac.uk/id/eprint/50

Actions (login required)

View Item View Item


Downloads per month over past year