A fuzzy structure processing mechanism for graph grammar

IF 0.7 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Journal of Logic and Computation Pub Date : 2023-08-01 DOI:10.1093/logcom/exad046

Yu-Feng Liu, Fan Yang, Jian Liu, Song Li

引用次数: 0

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.

查看原文本刊更多论文

一种图语法的模糊结构处理机制

严格的图匹配机制给图语法带来了规范性，但在处理模糊语法结构时却导致了图语法的不足。为了解决这个问题，本文提出了一种改进的图语法形式框架，使其能够有效地指定图模型的模糊性，同时保持规范性和直觉。首先，改进的框架定义了边的连接概率，并根据连接概率对边进行分类，作为图语法结构歧义的定量和定性描述;其次，定义了可信阈值、可信子图和候选子图的概念，调整了索引的约束条件，提高了图匹配过程的容错性;最后，重新设计语法操作，根据连接概率和可信度阈值为每个索引定义匹配权值，为多个索引的选择提供理论依据和实践指导。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Logic and Computation 工程技术-计算机：理论方法

CiteScore

1.90

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging. The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.