View in EDS HTML Full Text PDF Full Text

A fuzzy structure processing mechanism for graph grammar.

Saved in:
Bibliographic Details
Title: A fuzzy structure processing mechanism for graph grammar.
Authors: Liu, Yufeng1 (AUTHOR) yfengliu28@126.com, Yang, Fan1 (AUTHOR), Liu, Jian1 (AUTHOR), Li, Song1 (AUTHOR)
Source: Journal of Logic & Computation. Jul2024, Vol. 34 Issue 5, p963-976. 14p.
Subjects: Graph grammars, Fuzzy graphs, Fault tolerance (Engineering), Subgraphs
Abstract: 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's 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. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 178650308
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A fuzzy structure processing mechanism for graph grammar.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Liu%2C+Yufeng%22">Liu, Yufeng</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> yfengliu28@126.com</i><br /><searchLink fieldCode="AR" term="%22Yang%2C+Fan%22">Yang, Fan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Liu%2C+Jian%22">Liu, Jian</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Li%2C+Song%22">Li, Song</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Jul2024, Vol. 34 Issue 5, p963-976. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+grammars%22">Graph grammars</searchLink><br /><searchLink fieldCode="DE" term="%22Fuzzy+graphs%22">Fuzzy graphs</searchLink><br /><searchLink fieldCode="DE" term="%22Fault+tolerance+%28Engineering%29%22">Fault tolerance (Engineering)</searchLink><br /><searchLink fieldCode="DE" term="%22Subgraphs%22">Subgraphs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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's 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. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=178650308
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/exad046
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 963
    Subjects:
      – SubjectFull: Graph grammars
        Type: general
      – SubjectFull: Fuzzy graphs
        Type: general
      – SubjectFull: Fault tolerance (Engineering)
        Type: general
      – SubjectFull: Subgraphs
        Type: general
    Titles:
      – TitleFull: A fuzzy structure processing mechanism for graph grammar.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Liu, Yufeng
      – PersonEntity:
          Name:
            NameFull: Yang, Fan
      – PersonEntity:
          Name:
            NameFull: Liu, Jian
      – PersonEntity:
          Name:
            NameFull: Li, Song
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 34
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1