Thompson, Simon, Delaney, Aidan, Stapleton, Gem, Taylor, John (2014) A normal form for spider diagrams of order. Journal of Visual Languages and Computing, 25 (6). pp. 935-944. ISSN 1045-926X. (doi:10.1016/j.jvlc.2014.10.029) (KAR id:42350)
PDF
Publisher pdf
Language: English |
|
Download this file (PDF/1MB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1016/j.jvlc.2014.10.029 |
Abstract
We develop a reasoning system for an Euler diagram based visual logic, called spider diagrams of order. We de- fine a normal form for spider diagrams of order and provide an algorithm, based on the reasoning system, for producing diagrams in our normal form. Normal forms for visual log- ics have been shown to assist in proving completeness of associated reasoning systems. We wish to use the reasoning system to allow future direct comparison of spider diagrams of order and linear temporal logic.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/j.jvlc.2014.10.029 |
Uncontrolled keywords: | Spider diagrams; Logic; Normal form; Euler diagrams; |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 9 Formal systems, logics |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | S. Thompson |
Date Deposited: | 16 Aug 2014 14:45 UTC |
Last Modified: | 05 Nov 2024 10:26 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/42350 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):