约束图默认读取的实验研究

A. Fish, J. Masthoff
{"title":"约束图默认读取的实验研究","authors":"A. Fish, J. Masthoff","doi":"10.1109/VLHCC.2005.17","DOIUrl":null,"url":null,"abstract":"Constraint diagrams (Kent, 1997) are a complex diagrammatic notation designed to express logical statements especially for use in software specification and reasoning. Not surprisingly, since this is an expressive language, there are some difficulties in reading the semantics of a diagram unambiguously. Some extra annotations (in the form of a reading tree) disambiguate the diagrams. However, this extra requirement (of drawing a reading tree) places a burden on the user. An attempt to remove the need for such a reading tree (or perhaps to automatically generate a reading tree, which could be altered by a user if they wished to) has been given via an algorithm to generate a default reading from the diagram. This algorithm is based on a number of principles - most of which are properties of the diagram. We wish to know whether these principles are intuitive and whether the default reading reflects a good proportion of users' intuitions, and we have performed a user-based study to test this.","PeriodicalId":241986,"journal":{"name":"2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An experimental study into the default reading of constraint diagrams\",\"authors\":\"A. Fish, J. Masthoff\",\"doi\":\"10.1109/VLHCC.2005.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Constraint diagrams (Kent, 1997) are a complex diagrammatic notation designed to express logical statements especially for use in software specification and reasoning. Not surprisingly, since this is an expressive language, there are some difficulties in reading the semantics of a diagram unambiguously. Some extra annotations (in the form of a reading tree) disambiguate the diagrams. However, this extra requirement (of drawing a reading tree) places a burden on the user. An attempt to remove the need for such a reading tree (or perhaps to automatically generate a reading tree, which could be altered by a user if they wished to) has been given via an algorithm to generate a default reading from the diagram. This algorithm is based on a number of principles - most of which are properties of the diagram. We wish to know whether these principles are intuitive and whether the default reading reflects a good proportion of users' intuitions, and we have performed a user-based study to test this.\",\"PeriodicalId\":241986,\"journal\":{\"name\":\"2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VLHCC.2005.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLHCC.2005.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

约束图(Kent, 1997)是一种复杂的图解符号,用于表达逻辑语句,特别是在软件规范和推理中使用。毫不奇怪,由于这是一种表达性语言,因此在明确地阅读图的语义方面存在一些困难。一些额外的注释(以阅读树的形式)消除了图的歧义。然而,这个额外的需求(绘制读取树)给用户带来了负担。通过从图中生成默认读取的算法,已经尝试消除对这种读取树的需求(或者可能自动生成一个读取树,如果用户愿意,可以对其进行修改)。该算法基于许多原则,其中大部分是图的属性。我们想知道这些原则是否直观,默认读数是否很好地反映了用户的直觉,我们进行了一项基于用户的研究来测试这一点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An experimental study into the default reading of constraint diagrams
Constraint diagrams (Kent, 1997) are a complex diagrammatic notation designed to express logical statements especially for use in software specification and reasoning. Not surprisingly, since this is an expressive language, there are some difficulties in reading the semantics of a diagram unambiguously. Some extra annotations (in the form of a reading tree) disambiguate the diagrams. However, this extra requirement (of drawing a reading tree) places a burden on the user. An attempt to remove the need for such a reading tree (or perhaps to automatically generate a reading tree, which could be altered by a user if they wished to) has been given via an algorithm to generate a default reading from the diagram. This algorithm is based on a number of principles - most of which are properties of the diagram. We wish to know whether these principles are intuitive and whether the default reading reflects a good proportion of users' intuitions, and we have performed a user-based study to test this.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信