A decidable constraint diagram reasoning system

Stapleton, G., Howse, J. and Taylor, J. (2005) A decidable constraint diagram reasoning system Journal of logic and computation, 15 (6). pp. 975-1008. ISSN 1465-363X

[img]PDF
Restricted to Repository staff only

353Kb

Official URL: http://dx.doi.org/doi:10.1093/logcom/exi041

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 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:Article
Additional Information:This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Journal of logic and computation following peer review. The definitive publisher-authenticated version is available to subscribers online at the above url
Uncontrolled Keywords:Visual logic, formal methods, diagrammatic reasoning
Subjects:G000 Computing and Mathematical Sciences > G400 Computing
Faculties:Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
ID Code:50
Deposited By:editor cmis
Deposited On:10 May 2007
Last Modified:08 Oct 2010 02:17

Repository Staff Only: item control page