Reasoning with Spider Diagrams. - John Howse; Fernando Molina; John Taylor 001; Stuart Kent 001 (VL, 1999)

A Sound and Complete Diagrammatic Reasoning System. - John Howse; Fernando Molina; John Taylor 001 (Artificial Intelligence and Soft Computing, 2000)

On the Completeness and Expressiveness of Spider Diagram Systems. - John Howse; Fernando Molina; John Taylor 001 (Diagrams, 2000)

Projections in Venn-Euler Diagrams. - Joseph Gil; John Howse; Stuart Kent 001; John Taylor 001 (VL, 2000)

SD2: A Sound and Complete Diagrammatic Reasoning System. - John Howse; Fernando Molina; John Taylor 001 (VL, 2000)

Type-syntax and token-syntax in diagrammatic systems. - John Howse; Fernando Molina; John Taylor 001; Sun-Joo Shin (FOIS, 2001)

Spider Diagrams: A Diagrammatic Reasoning System. - John Howse; Fernando Molina; John Taylor 001; Stuart Kent 001; Joseph Gil (J. Vis. Lang. Comput., 2001)

On Diagram Tokens and Types. - John Howse; Fernando Molina; Sun-Joo Shin; John Taylor 001 (Diagrams, 2002)

Corresponding Regions in Euler Diagrams. - John Howse; Gemma Stapleton; Jean Flower; John Taylor 001 (Diagrams, 2002)

A Visual Framework for Modelling with Heterogeneous Notations. - Jean Flower; John Howse; John Taylor 001; Stuart Kent 001 (HCC, 2002)

Nesting in Euler Diagrams. - Jean Flower; John Howse; John Taylor 001 (GT-VMT@ICGT, 2002)

What Can Spider Diagrams Say? - Gem Stapleton; John Howse; John Taylor 001; Simon J. Thompson (Diagrams, 2004)

The Expressiveness of Spider Diagrams. - Gem Stapleton; John Howse; John Taylor 001; Simon J. Thompson (J. Log. Comput., 2004)

Nesting in Euler Diagrams: syntax, semantics and construction. - Jean Flower; John Howse; John Taylor 001 (Softw. Syst. Model., 2004)

A New Language for the Visualization of Logic and Reasoning. - Gem Stapleton; Simon J. Thompson; Andrew Fish; John Howse; John Taylor 001 (DMS, 2005)

Spider Diagrams. - John Howse; Gem Stapleton; John Taylor 001 (LMS J. Comput. Math., 2005)

A Decidable Constraint Diagram Reasoning System. - Gem Stapleton; John Howse; John Taylor 001 (J. Log. Comput., 2005)

Exploring the Notion of 'Clutter' in Euler Diagrams. - Chris John; Andrew Fish; John Howse; John Taylor 001 (Diagrams, 2006)

Properties of Euler Diagrams. - Gem Stapleton; Peter Rodgers 001; John Howse; John Taylor 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2007)

Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages. - Aidan J. Delaney; John Taylor 001; Simon J. Thompson (Diagrams, 2008)

A Normal Form for Euler Diagrams with Shading. - Andrew Fish; Chris John; John Taylor 001 (Diagrams, 2008)

The expressiveness of spider diagrams augmented with constants. - Gem Stapleton; John Taylor 001; Simon J. Thompson; John Howse (J. Vis. Lang. Comput., 2009)

Fragments of Spider Diagrams of Order and Their Relative Expressiveness. - Aidan J. Delaney; Gem Stapleton; John Taylor 001; Simon J. Thompson (Diagrams, 2010)

On the Completeness of Spider Diagrams Augmented with Constants. - Gem Stapleton; John Howse; Simon J. Thompson; John Taylor 001; Peter Chapman (Visual Reasoning with Diagrams, 2013)

On the expressiveness of spider diagrams and commutative star-free regular languages. - Aidan J. Delaney; Gem Stapleton; John Taylor 001; Simon J. Thompson (J. Vis. Lang. Comput., 2013)

Equivalences in Euler-based diagram systems through normal forms. - Andrew Fish; John Taylor 001 (LMS J. Comput. Math., 2014)

A normal form for spider diagrams of order. - Aidan J. Delaney; Gem Stapleton; John Taylor 001; Simon J. Thompson (J. Vis. Lang. Comput., 2014)