A reading algorithm for constraint diagrams
A reading algorithm for constraint diagrams
复制标题
一种约束图的读取算法
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
J. Howse
中科院分区：
文献类型：
--
作者：
A. Fish;Jean Flower;J. Howse
约束图是一种视觉符号，旨在补充软件系统开发中的统一建模语言。它们概括了维恩图和欧拉圆，并包括用于量化和关系导航的设施。他们的设计强调可扩展性和表现力，同时保留直观性。约束图的形式化并非易事：之前的尝试已经揭示了与视觉语言中符号顺序有关的微妙之处。因此，一些约束图有不止一种直观的解读。我们开发了约束图的依赖图的概念。从依赖图中，我们获得了一组阅读树。阅读树为图表的某些语法元素提供了部分排序。给定约束图的阅读树，我们提出了一种提供独特语义阅读的算法。
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. The formalization of constraint diagrams is non-trivial: previous attempts have exposed subtleties concerned with the ordering of symbols in the visual language. Consequently, some constraint diagrams have more than one intuitive reading. We develop the concept of the dependence graph for a constraint diagram. From the dependence graph, we obtain a set of reading trees. A reading tree provides a partial ordering for some syntactic elements of the diagram. Given a reading tree for a constraint diagram, we present an algorithm that delivers a unique semantic reading.