Stapleton, Gem, Taylor, John, Thompson, Simon, Howse, John (2009) The expressiveness of spider diagrams augmented with constants. Journal of Visual Languages and Computing, 20 . pp. 30-49. (doi:10.1016/j.jvlc.2008.01.005) (KAR id:23977)
PDF
Language: English |
||
Download (535kB)
Preview
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
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 |
---|---|
DOI/Identification number: | 10.1016/j.jvlc.2008.01.005 |
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: | 23 Jan 2020 04:04 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/23977 (The current URI for this page, for reference purposes) |
Thompson, Simon: | ![]() |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):