一句话：提出损伤/修复指示应用条件，用最弱条件刻画图变换的修复增益并排序以修复不一致图。
图与图变换被广泛用于系统建模，其中一致性通常被视为二值属性。近期工作将其扩展为分级属性，允许暂时不一致并在需要时修复。本文利用带“损伤指示”和“修复指示”应用条件的图变换规则来修复图中的不一致，并衡量规则应用带来的修复增益。这些条件可由给定的图约束导出。主定理表明，图变换一步前后实际约束违反数量之差，可由被违反的损伤指示与修复指示应用条件数量之差来刻画。该理论为带前瞻算法奠定基础，使其能根据修复潜力对图变换排序。评估显示，这些新型应用条件在有效性和可扩展性上能很好地支持图修复。
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of constraints, recent work has presented an approach to consistency as a graduated property. This allows living with inconsistencies for a while and repairing them when necessary. For repairing inconsistencies in a graph, we use graph transformation rules with so-called {\em impairment-indicating and repair-indicating application conditions} to understand how much repair gain certain rule applications would bring. Both types of conditions can be derived from given graph constraints. Our main theorem shows that the difference between the number of actual constraint violations before and after a graph transformation step can be characterised by the difference between the numbers of violated impairment-indicating and repair-indicating application conditions. This theory forms the basis for algorithms with look-ahead that rank graph transformations according to their potential for graph repair. An evaluation shows that graph repair can be well-supported by rules with these new types of application conditions in terms of effectiveness and scalability.
DOI 原文 · arXiv · PDF（开放获取） · DBLP
@article{FritscheLKST26,
title = {Using weakest application conditions to rank graph transformations for graph repair},
author = {Lars Fritsche and Alexander Lauer and Maximilian Kratz and Andy Schürr and Gabriele Taentzer},
journal = {Logical Methods in Computer Science},
volume = {Volume 22, Issue 1},
year = {2026},
doi = {10.46298/lmcs-22(1:10)2026}
}