Stapleton, G. and Taylor, J. and Thompson, Simon and Howse, J. (2009) The expressiveness of spider diagrams augmented with constants. Journal of Visual Languages and Computing, 20 . pp. 30-49.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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.
|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 > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||29 Mar 2010 12:09|
|Last Modified:||25 Jun 2012 14:45|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/23977 (The current URI for this page, for reference purposes)|
- Depositors only (login required):