The expressiveness of spider diagrams augmented with constants

Stapleton, Gem and Taylor, John and Thompson, Simon and Howse, John (2009) The expressiveness of spider diagrams augmented with constants. Journal of Visual Languages and Computing, 20 . pp. 30-49. (doi:https://doi.org/10.1016/j.jvlc.2008.01.005) (Full text available)

PDF
Download (535kB) Preview	Preview
Official URL http://dx.doi.org/10.1016/j.jvlc.2008.01.005

Abstract

Spider diagrams are a visual language for expressing logical statements or constraints. Several sound and complete spider diagram systems have been developed and it has been shown that they are equivalent in expressive power to monadic first order logic with equality. However, these sound and complete spider diagram systems do not contain syntactic elements analogous to constants in first order predicate logic. We extend the spider diagram language to include constant spiders which represent specific individuals. Formal semantics are given for the extended diagram language. We prove that this extended system is equivalent in expressive power to the language of spider diagrams without constants and, hence, equivalent to monadic first order logic with equality.

Item Type:	Article
Uncontrolled keywords:	spider diagram Euler logic visual reasoning constant expressiveness
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	29 Mar 2010 12:09 UTC
Last Modified:	22 Aug 2014 20:52 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/23977 (The current URI for this page, for reference purposes)