{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T00:16:32Z","timestamp":1721780192369},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,24]]},"abstract":"Abstract<\/jats:title>\n A strict graph-matching mechanism brings normativeness to graph grammar but leads to graph grammar insufficiency when processing fuzzy grammatical structures. To address this issue, the current paper proposes an improved formal framework for graph grammar that enables it to effectively specify the ambiguity of graph models while maintaining normativeness and intuition. First, the improved framework defines the connection probability for edges and classifies the edges based on the connection probability, which is used as the quantitative and qualitative description of the graph grammar structure\u2019s ambiguity. Second, the concepts of credibility threshold, credible subgraphs and candidate subgraphs are defined, and the constraints on the redex are adjusted to increase the fault tolerance of the graph-matching process. Finally, the grammatical operation is redesigned, with a matching weight defined for each redex based on the connection probability and the credibility threshold, thereby providing a theoretical basis and practical guidance for the selection of multiple redexes.<\/jats:p>","DOI":"10.1093\/logcom\/exad046","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T06:58:20Z","timestamp":1691045900000},"page":"963-976","source":"Crossref","is-referenced-by-count":0,"title":["A fuzzy structure processing mechanism for graph grammar"],"prefix":"10.1093","volume":"34","author":[{"given":"Yufeng","family":"Liu","sequence":"first","affiliation":[{"name":"Nanjing University of Finance and Economics College of Information Engineering, , Nanjing, 210023, China"}]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[{"name":"Nanjing University of Finance and Economics College of Information Engineering, , Nanjing, 210023, China"}]},{"given":"Jian","family":"Liu","sequence":"additional","affiliation":[{"name":"Nanjing University of Finance and Economics College of Information Engineering, , Nanjing, 210023, China"}]},{"given":"Song","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University of Finance and Economics College of Information Engineering, , Nanjing, 210023, China"}]}],"member":"286","published-online":{"date-parts":[[2023,8,1]]},"reference":[{"key":"2024072308354789000_ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJSSOE.300782","article-title":"A graph transformation approach for modeling UML diagrams","volume":"12","author":"Hachichi","year":"2022","journal-title":"International Journal of Systems and Service-Oriented Engineering"},{"key":"2024072308354789000_ref2","first-page":"183","article-title":"Ensuring user interface adaptation consistency through triple graph grammars","volume":"1398","author":"Biermeier","year":"2022","journal-title":"IFIP Conference on Human\u2013Computer Interaction, Lecture Notes in Computer Science"},{"key":"2024072308354789000_ref3","first-page":"3143","article-title":"Graph grammar-based automatic design for heterogeneous fleets of underwater robots","volume":"2022","author":"Zhao","year":"2022","journal-title":"International Conference on Robotics and Automation"},{"key":"2024072308354789000_ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3414685.3417831","article-title":"RoboGrammar: graph grammar for terrain-optimized robot design","volume":"39","author":"Zhao","year":"2020","journal-title":"ACM Transactions on Graphics"},{"key":"2024072308354789000_ref5","first-page":"1321","article-title":"GLSO: grammar-guided latent space optimization for sample-efficient robot design automation","volume":"205","author":"Hu","year":"2023","journal-title":"International Conference on Robot Learning,\n Proceedings of Machine Learning Research"},{"key":"2024072308354789000_ref6","doi-asserted-by":"crossref","DOI":"10.1016\/j.bpj.2022.11.1610","article-title":"Simulating actin networks in synaptic spine heads using dynamical graph grammars","volume":"122","author":"Hur","year":"2023","journal-title":"Biophysical Journal"},{"key":"2024072308354789000_ref7","article-title":"Data-efficient graph grammar learning for molecular generation","author":"Guo","year":"2022"},{"key":"2024072308354789000_ref8","doi-asserted-by":"crossref","first-page":"103480","DOI":"10.1016\/j.cad.2023.103480","article-title":"Semantic-driven graph transformations in floor plan design","volume":"158","author":"\u015alusarczyk","year":"2023","journal-title":"Computer-Aided Design"},{"key":"2024072308354789000_ref9","doi-asserted-by":"crossref","first-page":"103288.1","DOI":"10.1016\/j.autcon.2020.103288","article-title":"Generating layout designs from high-level specifications","volume":"119","author":"Wang","year":"2020","journal-title":"Automation in Construction"},{"key":"2024072308354789000_ref10","first-page":"137","article-title":"A graph grammar approach to the design and validation of floor plans","volume":"63","author":"Wang","year":"2019","journal-title":"The Computer Journal"},{"key":"2024072308354789000_ref11","first-page":"424","article-title":"On-line handwritten flowchart recognition based on logical structure and graph grammar","author":"Chen","year":"2015","journal-title":"International Conference on Information Science & Technology"},{"key":"2024072308354789000_ref12","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/TPAMI.2017.2731842","article-title":"Attribute and-or grammar for joint parsing of human pose, parts and attributes","volume":"40","author":"Park","year":"2018","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"2024072308354789000_ref13","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/978-3-319-25751-8_53","article-title":"Top-down online handwritten mathematical expression parsing with graph grammar","volume":"9432","author":"Julcaaguilar","year":"2015","journal-title":"BeroAmerican Congress on Pattern Recognition, Lecture Notes in Computer Science"},{"key":"2024072308354789000_ref14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","article-title":"Graph grammars with neighbourhood-controlled embedding","volume":"21","author":"Janssens","year":"1982","journal-title":"Theoretical Computer Science"},{"key":"2024072308354789000_ref15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/9789812384720_0002","article-title":"Hyperedge replacement graph grammars","volume":"1","author":"Drewes","year":"1997","journal-title":"In Handbook Of Graph Grammars And Computing By Graph Transformation."},{"key":"2024072308354789000_ref16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","article-title":"Defining and parsing visual languages with layered graph grammars","volume":"8","author":"Rekers","year":"1997","journal-title":"Journal of Visual Languages and Computing"},{"key":"2024072308354789000_ref17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1093\/comjnl\/44.3.186","article-title":"A context-sensitive graph grammar formalism for the specification of visual languages","volume":"44","author":"Zhang","year":"2001","journal-title":"The Computer Journal"},{"key":"2024072308354789000_ref18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.18293\/VLSS2018-028","article-title":"Edge-based graph grammar: theory and support system","volume":"4","author":"Zeng","year":"2018","journal-title":"Journal of Visual Languages and Sentient Systems"},{"key":"2024072308354789000_ref19","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1109\/NAFIPS.1996.534770","article-title":"The use of fuzzy graph grammars for recognizing noisy two-dimensional images","author":"Watkins","year":"1996","journal-title":"North American fuzzy Information Processing Society"},{"key":"2024072308354789000_ref20","first-page":"445","article-title":"Fuzzy logic based guidance to graph grammar framework for automated analog circuit design","author":"Das","year":"2009","journal-title":"Proceedings of International Conference on VLSI design"},{"key":"2024072308354789000_ref21","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10559-006-0094-3","article-title":"Categorical approach to the construction of fuzzy graph grammars","volume":"42","author":"Parasyuk","year":"2006","journal-title":"Cybernetics and Systems Analysis"},{"key":"2024072308354789000_ref22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0165-0114(98)00292-9","article-title":"An inference method for fuzzy tree grammars","volume":"112","author":"Shu","year":"2000","journal-title":"Fuzzy Sets and Systems"},{"key":"2024072308354789000_ref23","first-page":"748","article-title":"A fuzzy hierarchical attributed graph approach for handwritten hieroglyphs description","volume-title":"International Conference on Computer analysis of images and patterns, Lecture Notes in Computer Science","author":"Arrivault","year":"2005"},{"key":"2024072308354789000_ref24","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1093\/logcom\/exab055","article-title":"EGG+: a graph grammar formalism with uncertain structure processing mechanism","volume":"31","author":"Liu","year":"2021","journal-title":"Journal of Logic and Computation"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/5\/963\/58611858\/exad046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/34\/5\/963\/58611858\/exad046.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T08:36:37Z","timestamp":1721723797000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/34\/5\/963\/7234485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,1]]},"references-count":24,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,8,1]]},"published-print":{"date-parts":[[2024,7,24]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exad046","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,7]]},"published":{"date-parts":[[2023,8,1]]}}}