Computing reading trees for constraint diagrams

Andrew Fish, John Howse

Research output: Chapter in Book/Conference proceeding with ISSN or ISBNConference contribution with ISSN or ISBN

Abstract

Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler circles, and include facilities for quantification and navigation of relations. Their design emphasizes scalability and expressiveness while retaining intuitiveness. Due to subtleties concerned with the ordering of symbols in this visual language, the formalization of constraint diagrams is non-trivial; some constraint diagrams have more than one intuitive reading. A reading algorithm, which associates a unique semantic interpretation to a constraint diagram, with respect to a reading tree, has been developed. A reading tree provides a partial ordering for syntactic elements of the diagram. Reading trees are obtainable from a partially directed graph, called the dependence graph of the diagram. In this paper we describe a tree-construction algorithm, which utilizes graph transformations in order to produce all possible reading trees from a dependence graph. This work will aid the production of tools which will allow an advanced user to choose from a range of semantic interpretations of a diagram.
Original languageEnglish
Title of host publicationProceedings of the Second International Workshop, AGTIVE 2003
EditorsJ. Hosking, P. Cox
Place of PublicationBerlin, Germany
PublisherSpringer
Pages260-274
Number of pages15
Volume3062
ISBN (Electronic)9783540259596
ISBN (Print)9783540221203
DOIs
Publication statusPublished - 1 Jan 2004
EventProceedings of the Second International Workshop, AGTIVE 2003 - Charlottesville, VA, USA, 22 September - 1 October, 2003
Duration: 1 Jan 2004 → …

Publication series

NameLecture Notes in Computer Science

Workshop

WorkshopProceedings of the Second International Workshop, AGTIVE 2003
Period1/01/04 → …

Bibliographical note

The original publication is available at www.springerlink.com

Fingerprint Dive into the research topics of 'Computing reading trees for constraint diagrams'. Together they form a unique fingerprint.

  • Cite this

    Fish, A., & Howse, J. (2004). Computing reading trees for constraint diagrams. In J. Hosking, & P. Cox (Eds.), Proceedings of the Second International Workshop, AGTIVE 2003 (Vol. 3062, pp. 260-274). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-540-25959-6_19