{"title":"形式化蜘蛛图","authors":"J. Gil, J. Howse, S. Kent","doi":"10.1109/VL.1999.795884","DOIUrl":null,"url":null,"abstract":"Geared to complement UML and the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive Venn diagrams and Euler circles. The language design emphasizes scalability and expressiveness while retaining intuitiveness. In this paper, we describe spider diagrams from a mathematical standpoint and show how their formal semantics can be made in terms of logical expressions. We also claim that all spider diagrams are self-consistent.","PeriodicalId":113128,"journal":{"name":"Proceedings 1999 IEEE Symposium on Visual Languages","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"72","resultStr":"{\"title\":\"Formalizing spider diagrams\",\"authors\":\"J. Gil, J. Howse, S. Kent\",\"doi\":\"10.1109/VL.1999.795884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Geared to complement UML and the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive Venn diagrams and Euler circles. The language design emphasizes scalability and expressiveness while retaining intuitiveness. In this paper, we describe spider diagrams from a mathematical standpoint and show how their formal semantics can be made in terms of logical expressions. We also claim that all spider diagrams are self-consistent.\",\"PeriodicalId\":113128,\"journal\":{\"name\":\"Proceedings 1999 IEEE Symposium on Visual Languages\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1999 IEEE Symposium on Visual Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VL.1999.795884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1999 IEEE Symposium on Visual Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VL.1999.795884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Geared to complement UML and the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive Venn diagrams and Euler circles. The language design emphasizes scalability and expressiveness while retaining intuitiveness. In this paper, we describe spider diagrams from a mathematical standpoint and show how their formal semantics can be made in terms of logical expressions. We also claim that all spider diagrams are self-consistent.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
