Stapleton, G. and Howse, J. and Taylor, J. and Thompson, Simon (2004) What Can Spider Diagrams Say? In: Blackwell, Alan and Marriott, Kim and Shimojima, Atsushi, eds. Diagrammatic Representation and Inference. Lecture Notes in Computer Science, 2980. Springer pp. 179-186. ISBN 3-540-21268-X.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Spider diagram expressiveness model theory|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:02|
|Last Modified:||25 Jun 2012 14:43|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/14197 (The current URI for this page, for reference purposes)|
- Depositors only (login required):