STAPLETON, GEM, HOWSE, JOHN, TAYLOR, JOHN and Thompson, Simon (2004) What can spider diagrams say? In: Proceedings of the 3rd International Conference, Diagrams 2004, Cambridge, UK, 22-24 March, 2004.Full text not available from this repository.
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalent in expressive power to the spider diagram language. The language ESD is monadic and includes equality but has no constants or function symbols. To show this equivalence, in one direction, for each diagram we construct a sentence in ESD that expresses the same information. For the more challenging converse we show there exists a finite set of models for a sentence S that can be used to classify all the models for S. Using these classifying models we show that there is a diagram expressing the same information as S.
|Item Type:||Contribution to conference proceedings in the public domain ( Full Paper)|
|Subjects:||G000 Computing and Mathematical Sciences > G400 Computing|
|DOI (a stable link to the resource):||10.1007/978-3-540-25931-2_12|
|Faculties:||Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling|
|Date Deposited:||12 Nov 2007|
|Last Modified:||08 May 2013 08:41|
Actions (login required)
Downloads per month over past year