Generalized constraint diagrams: the classical decision problem in a diagrammatic reasoning system

Research output: ThesisDoctoral ThesisResearch

Abstract

Constraint diagrams are part of the family of visual logics based on Euler diagrams. They have been studied since the 1990s, when they were first proposed by Kent as a means of describing formal constraints within software models. Since that time, constraint diagrams have evolved in a number of ways; a crucial re- finement came with the recognition of the need to impose a reading order on the quantifiers represented by diagrammatic syntax. This resulted first in augmented constraint diagrams and, most recently, generalized constraint diagrams (GCDs), which are composed of one or more unitary diagrams in a connected graph. The design of GCDs includes several syntactic features that bring increased expressivity but which also make their metatheory more complex than is the case with preceding constraint diagram notations. In particular, GCDs are given a second order semantics.
Original languageEnglish
QualificationDoctor of Philosophy
Awarding Institution
  • University of Brighton
Publication statusPublished - May 2011

Fingerprint

Syntactics
Semantics

Bibliographical note

Copyright © and Moral Rights for this thesis are retained by the author and/or other copyright owners.

Cite this

@phdthesis{323ab5aed87c470faa7520f2ef9aa4ac,
title = "Generalized constraint diagrams: the classical decision problem in a diagrammatic reasoning system",
abstract = "Constraint diagrams are part of the family of visual logics based on Euler diagrams. They have been studied since the 1990s, when they were first proposed by Kent as a means of describing formal constraints within software models. Since that time, constraint diagrams have evolved in a number of ways; a crucial re- finement came with the recognition of the need to impose a reading order on the quantifiers represented by diagrammatic syntax. This resulted first in augmented constraint diagrams and, most recently, generalized constraint diagrams (GCDs), which are composed of one or more unitary diagrams in a connected graph. The design of GCDs includes several syntactic features that bring increased expressivity but which also make their metatheory more complex than is the case with preceding constraint diagram notations. In particular, GCDs are given a second order semantics.",
author = "James Burton",
note = "Copyright {\circledC} and Moral Rights for this thesis are retained by the author and/or other copyright owners.",
year = "2011",
month = "5",
language = "English",
school = "University of Brighton",

}

TY - THES

T1 - Generalized constraint diagrams: the classical decision problem in a diagrammatic reasoning system

AU - Burton, James

N1 - Copyright © and Moral Rights for this thesis are retained by the author and/or other copyright owners.

PY - 2011/5

Y1 - 2011/5

N2 - Constraint diagrams are part of the family of visual logics based on Euler diagrams. They have been studied since the 1990s, when they were first proposed by Kent as a means of describing formal constraints within software models. Since that time, constraint diagrams have evolved in a number of ways; a crucial re- finement came with the recognition of the need to impose a reading order on the quantifiers represented by diagrammatic syntax. This resulted first in augmented constraint diagrams and, most recently, generalized constraint diagrams (GCDs), which are composed of one or more unitary diagrams in a connected graph. The design of GCDs includes several syntactic features that bring increased expressivity but which also make their metatheory more complex than is the case with preceding constraint diagram notations. In particular, GCDs are given a second order semantics.

AB - Constraint diagrams are part of the family of visual logics based on Euler diagrams. They have been studied since the 1990s, when they were first proposed by Kent as a means of describing formal constraints within software models. Since that time, constraint diagrams have evolved in a number of ways; a crucial re- finement came with the recognition of the need to impose a reading order on the quantifiers represented by diagrammatic syntax. This resulted first in augmented constraint diagrams and, most recently, generalized constraint diagrams (GCDs), which are composed of one or more unitary diagrams in a connected graph. The design of GCDs includes several syntactic features that bring increased expressivity but which also make their metatheory more complex than is the case with preceding constraint diagram notations. In particular, GCDs are given a second order semantics.

M3 - Doctoral Thesis

ER -