{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:35:05Z","timestamp":1648928105680},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,9,24]],"date-time":"2013-09-24T00:00:00Z","timestamp":1379980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10270-013-0381-1","type":"journal-article","created":{"date-parts":[[2013,9,23]],"date-time":"2013-09-23T04:37:12Z","timestamp":1379911032000},"page":"1421-1453","source":"Crossref","is-referenced-by-count":3,"title":["Spider Graphs: a graph transformation system for spider diagrams"],"prefix":"10.1007","volume":"14","author":[{"given":"Paolo","family":"Bottoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Fish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Parisi Presicce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,24]]},"reference":[{"key":"381_CR1","unstructured":"Barwise, J., Etchemendy, J.: Hyperproof. CSLI (1994)"},{"key":"381_CR2","doi-asserted-by":"crossref","unstructured":"Barwise, J., Etchemendy, J.: Visual information and valid reasoning. In: Allwein, G., Barwise, J. (eds.) Logical Reasoning with Diagrams, pp. 3\u201325. Oxford University Press, New York (1996)","DOI":"10.1093\/oso\/9780195104271.003.0005"},{"key":"381_CR3","doi-asserted-by":"crossref","unstructured":"Bottoni, P., Fish, A.: Coloured Euler diagrams: a tool for visualizing dynamic systems and structured information. In: Proceeding Diagrams 2010, LNCS, vol. 6170, pp. 39\u201353 (2010)","DOI":"10.1007\/978-3-642-14600-8_8"},{"key":"381_CR4","doi-asserted-by":"crossref","unstructured":"Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: Consistency checking and visualization of OCL constraints. In: Proceedings of the UML 2000, LNCS, vol. 1939, pp. 294\u2013308 (2000)","DOI":"10.1007\/3-540-40011-7_21"},{"key":"381_CR5","doi-asserted-by":"crossref","unstructured":"Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: A visualization of OCL using collaborations. In: Gogolla, M., Kobryn, C. (eds.) Proceedings of the UML 2001, LNCS, vol. 2185, pp. 257\u2013271 (2001)","DOI":"10.1007\/3-540-45441-1_20"},{"key":"381_CR6","doi-asserted-by":"crossref","unstructured":"Bottoni, P., Sch\u00fcrr, A., Taentzer, G.: Efficient parsing of visual languages based on critical pair analysis (and contextual layered graph transformation. In: Proceedings of the IEEE-VL\u201900, pp. 59\u201361. IEEE CS Press (2000)","DOI":"10.1109\/VL.2000.874351"},{"key":"381_CR7","doi-asserted-by":"crossref","unstructured":"Cabot, J., Clariso, R., Riera, D.: Verification of UML\/OCL class diagrams using constraint programming. In: Proceedings of the ICSTW \u201908, pp. 73\u201380. IEEE CS Press (2008)","DOI":"10.1109\/ICSTW.2008.54"},{"key":"381_CR8","unstructured":"Chow, S.C.: Generating and drawing area-proportional Euler and Venn diagrams. Ph.D. thesis, University of Victoria (2007)"},{"key":"381_CR9","doi-asserted-by":"crossref","unstructured":"Cordasco, G., De Chiara, R., Fish, A.: Interactive visual classification with Euler diagrams. In: Proceedings of the VL\/HCC 2009, pp. 185\u2013192. IEEE CS Press (2009)","DOI":"10.1109\/VLHCC.2009.5295265"},{"key":"381_CR10","doi-asserted-by":"crossref","unstructured":"Corradini, A., Heindel, T., Hermann, F., K\u00f6nig, B.: Sesqui-pushout rewriting. In: Proceedings of the ICGT 2006, LNCS, vol. 4178, pp. 30\u201345. Springer, Berlin (2006)","DOI":"10.1007\/11841883_4"},{"issue":"1","key":"381_CR11","first-page":"135","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Theory of constraints and application conditions: from graphs to high-level structures. Fundam. Inform. 74(1), 135\u2013166 (2006)","journal-title":"Fundam. Inform."},{"issue":"1","key":"381_CR12","first-page":"31","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories. Fundam. Inform. 74(1), 31\u201361 (2006)","journal-title":"Fundam. Inform."},{"key":"381_CR13","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Berlin (2006)"},{"key":"381_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/9789812384720_0004","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations","author":"H Ehrig","year":"1997","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation\u2014part II: single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pp. 247\u2013312. World Scientific, Singapore (1997)"},{"key":"381_CR15","doi-asserted-by":"crossref","unstructured":"Ehrig, K., K\u00fcster, J.M., Taentzer, G., Winkelmann, J.: Generating instance models from meta models. In: Proceedings of the FMOODS 2006, LNCS, vol. 4037, pp. 156\u2013170. Springer, Berlin (2006)","DOI":"10.1007\/11768869_13"},{"key":"381_CR16","doi-asserted-by":"crossref","unstructured":"Ehrig, K., Winkelmann, J.: Model transformation from VisualOCL to OCL using graph transformation. In: Proceedings of the GT-VMT 2006, ENTCS, vol. 152, pp. 23\u201337 (2006)","DOI":"10.1016\/j.entcs.2006.01.012"},{"key":"381_CR17","unstructured":"Euler, L.: Lettres a une Princesse d\u2019Allemagne sur divers sujets de physique et de philosophie. Letters 2, 102\u2013108 (1775). Berne, Soci\u00e9t\u00e9 Typographique"},{"key":"381_CR18","unstructured":"Fish, A.: Euler diagram transformations. In: Proceedings of the GT-VMT 2009, ECEASST, vol. 18. EASST (2009)"},{"key":"381_CR19","doi-asserted-by":"crossref","unstructured":"Fish, A., Flower, J.: Investigating reasoning with constraint diagrams. In: Proceedings of the VLFM 2004, ENTCS, vol. 127, pp. 53\u201369. Elsevier (2005)","DOI":"10.1016\/j.entcs.2004.08.047"},{"key":"381_CR20","first-page":"541","volume":"16","author":"A Fish","year":"2005","unstructured":"Fish, A., Flower, J., Howse, J.: The semantics of augmented constraint diagrams. JVLC 16, 541\u2013573 (2005)","journal-title":"JVLC"},{"key":"381_CR21","doi-asserted-by":"crossref","unstructured":"Fish, A., John, C., Taylor, J.: A normal form for Euler diagrams with shading. In: Proceedings of the diagrams 2008, LNCS, vol. 5223, pp. 206\u2013221. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87730-1_20"},{"key":"381_CR22","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.jvlc.2008.01.004","volume":"19","author":"J Flower","year":"2008","unstructured":"Flower, J., Fish, A., Howse, J.: Euler diagram generation. J. Vis. Lang. Comput. 19, 675\u2013694 (2008)","journal-title":"J. Vis. Lang. Comput."},{"key":"381_CR23","unstructured":"Flower, J., Masthoff, J., Stapleton, G.: Generating proofs with spider diagrams using heuristics. In: Proceedings of DMS-VLC, pp. 279\u2013285. Knowledge Systems Institute (2004)"},{"key":"381_CR24","doi-asserted-by":"crossref","unstructured":"Flower, J., Masthoff, J., Stapleton, G.: Generating readable proofs: a heuristic approach to theorem proving with spider diagrams. In: Proceedings of Diagrams 2004, LNAI, vol. 2980, pp. 166\u2013181. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-25931-2_17"},{"key":"381_CR25","doi-asserted-by":"crossref","unstructured":"Flower, J., Stapleton, G.: Automated theorem proving with spider diagrams. In: Proceedings of Computing: The Australasian Theory Symposium, ENTCS, vol. 91, pp. 116\u2013132. Elsevier (2004)","DOI":"10.1016\/j.entcs.2003.12.016"},{"key":"381_CR26","doi-asserted-by":"crossref","unstructured":"Goedicke, M., Meyer, T., Taentzer, G.: Viewpoint-oriented software development by distributed graph transformation: towards a basis for living with inconsistencies. In: Proceedings of IEEE RE\u201999, pp. 92\u201399 (1999)","DOI":"10.1109\/ISRE.1999.777989"},{"issue":"3,4","key":"381_CR27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundam. Inform. 26(3,4), 287\u2013313 (1996)","journal-title":"Fundam. Inform."},{"issue":"2","key":"381_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"key":"381_CR29","doi-asserted-by":"crossref","unstructured":"Hammer, E., Shin, S.J.: Euler\u2019s visual logic. History and Philosophy of Logic, pp. 1\u201329 (1998)","DOI":"10.1080\/01445349808837293"},{"key":"381_CR30","doi-asserted-by":"crossref","unstructured":"Hausmann, J.H., Heckel, R., Taentzer, G.: Detection of conflicting functional requirements in a use case-driven approach: a static analysis technique based on graph transformation. In: Proceedings of ICSE \u201902, pp. 105\u2013115. ACM Press (2002)","DOI":"10.1145\/581352.581355"},{"key":"381_CR31","doi-asserted-by":"crossref","unstructured":"Heckel, R., K\u00fcster, J.M., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Proceedings of ICGT \u201902, LNCS, vol. 2505, pp. 161\u2013176. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45832-8_14"},{"issue":"3","key":"381_CR32","first-page":"299","volume":"12","author":"J Howse","year":"2001","unstructured":"Howse, J., Molina, F., Taylor, J., Kent, S., Gil, J.: Spider diagrams: a diagrammatic reasoning system. JVLC 12(3), 299\u2013324 (2001)","journal-title":"JVLC"},{"key":"381_CR33","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1112\/S1461157000000942","volume":"8","author":"J Howse","year":"2005","unstructured":"Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS J. Comput. Math. 8, 145\u2013194 (2005)","journal-title":"LMS J. Comput. Math."},{"key":"381_CR34","unstructured":"Jamnik, M.: Mathematical reasoning with diagrams: from intuition to automation. CSLI (2001)"},{"key":"381_CR35","doi-asserted-by":"crossref","unstructured":"Kent, S.: Constraint diagrams: visualizing invariants in object-oriented models. In: Proceedings of OOPSLA \u201997, pp. 327\u2013341. ACM Press (1997)","DOI":"10.1145\/263698.263756"},{"issue":"4","key":"381_CR36","first-page":"479","volume":"7","author":"HJ Kreowski","year":"1997","unstructured":"Kreowski, H.J., Kuske, S., Sch\u00fcrr, A.: Nested graph transformation units. Int. J. SEKE 7(4), 479\u2013502 (1997)","journal-title":"Int. J. SEKE"},{"key":"381_CR37","doi-asserted-by":"crossref","unstructured":"de Lara, J., Taentzer, G.: Automated model transformation and its validation using AToM3 and AGG. In: Proceedings of Diagrams\u201904, LNCS, vol. 2980, pp. 182\u2013198 (2004)","DOI":"10.1007\/978-3-540-25931-2_18"},{"key":"381_CR38","doi-asserted-by":"crossref","unstructured":"M\u00fcnch, M., Sch\u00fcrr, A., Winter, A.J.: Integrity constraints in the multi-paradigm language PROGRES. In: Selected Papers from TAGT\u201998, LNCS, vol. 1764, pp. 338\u2013351. Springer, Berlin (2000)","DOI":"10.1007\/978-3-540-46464-8_24"},{"key":"381_CR39","unstructured":"OMG: Meta Object Facility (MOF) 2.0 Query\/View\/ Transformation, v1.1. http:\/\/www.omg.org\/spec\/QVT\/1.1\/PDF\/ (2011)"},{"key":"381_CR40","doi-asserted-by":"crossref","unstructured":"Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Proceedings of FASE 2008, LNCS, vol. 4961, pp. 179\u2013198. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78743-3_14"},{"key":"381_CR41","doi-asserted-by":"crossref","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Proceedings of ICGT 2004, LNCS, vol. 3256, pp. 319\u2013335. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30203-2_23"},{"key":"381_CR42","doi-asserted-by":"crossref","unstructured":"Rensink, A., Schmidt, \u00c1., Varr\u00f3, D.: Model checking graph transformations: a comparison of two approaches. In: Proceedings of ICGT 2004, LNCS, vol. 3256, pp. 226\u2013241 (2004)","DOI":"10.1007\/978-3-540-30203-2_17"},{"key":"381_CR43","unstructured":"Ruskey, F.: A survey of Venn diagrams. Electron. J. Comb. (1997). www.combinatorics.org\/Surveys\/ds5\/VennEJC.html"},{"key":"381_CR44","doi-asserted-by":"crossref","unstructured":"Shin, S.J.: The Logical Status of Diagrams. CUP, Cambridge (1994)","DOI":"10.1017\/CBO9780511574696"},{"key":"381_CR45","volume-title":"Conceptual Structures: Information Processing in Mind and Machine","author":"J Sowa","year":"1984","unstructured":"Sowa, J.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, London (1984)"},{"issue":"6","key":"381_CR46","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1093\/logcom\/exi041","volume":"15","author":"G Stapleton","year":"2005","unstructured":"Stapleton, G., Howse, J., Taylor, J.: A decidable constraint diagram reasoning system. J. Log. Comput. 15(6), 975\u20131008 (2005)","journal-title":"J. Log. Comput."},{"issue":"4","key":"381_CR47","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10817-007-9069-y","volume":"39","author":"G Stapleton","year":"2007","unstructured":"Stapleton, G., Masthoff, J., Flower, J., Fish, A., Southern, J.: Automated theorem proving in Euler diagram systems. J. Autom. Reason. 39(4), 431\u2013470 (2007)","journal-title":"J. Autom. Reason."},{"issue":"6","key":"381_CR48","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1093\/logcom\/14.6.857","volume":"14","author":"G Stapleton","year":"2004","unstructured":"Stapleton, G., Thompson, S., Howse, J., Taylor, J.: The expressiveness of spider diagrams. J. Log. Comput. 14(6), 857\u2013880 (2004)","journal-title":"J. Log. Comput."},{"issue":"2","key":"381_CR49","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/s10270-003-0044-8","volume":"3","author":"N Swoboda","year":"2004","unstructured":"Swoboda, N., Allwein, G.: Using DAG transformations to verify Euler\/Venn homogeneous and Euler\/Venn FOL heterogeneous rules of inference. J. Soft. Syst. Model. 3(2), 136\u2013149 (2004)","journal-title":"J. Soft. Syst. Model."},{"key":"381_CR50","volume-title":"Parallel and distributed graph transformation\u2014formal description and application to communication-based systems","author":"G Taentzer","year":"1996","unstructured":"Taentzer, G.: Parallel and distributed graph transformation\u2014formal description and application to communication-based systems. Berichte aus der Informatik, Shaker (1996)"},{"key":"381_CR51","doi-asserted-by":"crossref","unstructured":"Thi\u00e9vre, J., Viaud, M.L., Verroust-Blondet, A.: Using Euler diagrams in traditional library environments. In: Proceedings of Euler Diagrams\u20192004, ENTCS, vol. 134, pp. 189\u2013202 (2005)","DOI":"10.1016\/j.entcs.2005.02.024"},{"key":"381_CR52","doi-asserted-by":"crossref","unstructured":"Urbas, M., Jamnik, M., Stapleton, G., Flower, J.: Speedith: a diagrammatic reasoner for spider diagrams. In: Proceedings of Diagrams 2012, LNCS, vol. 7352, pp. 163\u2013177. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-31223-6_19"},{"key":"381_CR53","volume-title":"The Object Constraint Language: Precise Modeling with UML","author":"J Warmer","year":"1999","unstructured":"Warmer, J., Kleppe, A.: The Object Constraint Language: Precise Modeling with UML. Addison-Wesley, London (1999)"},{"issue":"6","key":"381_CR54","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1070\/RM1974v029n06ABEH001303","volume":"29","author":"A Zykov","year":"1974","unstructured":"Zykov, A.: Hypergraphs. Russ. Math. Surv. 29(6), 89\u2013156 (1974)","journal-title":"Russ. Math. Surv."}],"container-title":["Software & Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-013-0381-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10270-013-0381-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-013-0381-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T16:37:13Z","timestamp":1646584633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10270-013-0381-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,24]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["381"],"URL":"https:\/\/doi.org\/10.1007\/s10270-013-0381-1","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,24]]}}}