What can spider diagrams say?Stapleton, G., Howse, J., Taylor, J. and Thompson, S. (2004) What can spider diagrams say? In: Blackwell, A., Marriott, K. and Shimojima, A., ed. Diagrammatic representation and inference: third international conference, Diagrams 2004. Cambridge, UK, Mar 22-24: proceedings. Lecture notes in computer science, 2980/2004. Springer-Verlag, Berlin, Germany, pp. 112-127. ISBN 0302-9743 (Print) 1611-3349 (Online) Full text available as:
Official URL: http://dx.doi.org/10.1007/b95854 AbstractSpider 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.
Repository Staff Only: edit this item |
