arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.15524cs.AIcs.LG
收藏

用于枚举最小不可满足子集的图剪枝

Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets

Tufts University(塔夫茨大学)

Panagiotis Lymperopoulos, Liping Liu

AI总结:

本文提出一种基于图学习模型的公式剪枝方法,通过预测应剪枝部分并仅依赖可满足性检查来加速最小不可满足子集枚举,无需标注数据且可跨分布外推,实验证明其能显著提升枚举效率。

摘要:

寻找二元约束的最小不可满足子集(MUSes)是过约束系统不可行性分析中的常见问题。然而,由于该问题的搜索空间呈指数级增长,在实际应用中枚举 MUSes 极其耗时。本文提出利用学习模型对公式进行剪枝,以加速 MUS 枚举。我们将公式表示为图,并开发了一种基于图的学习模型来预测公式的哪些部分应当被剪枝。重要的是,我们的算法不需要数据标注,只需检查剪枝后公式的可满足性。它甚至不需要来自目标应用的训练数据,因为它可以外推到具有不同分布的数据上。在实验中,我们将该算法与现有的 MUS 枚举器相结合,并在多个基准上验证了其有效性,其中包括一组训练分布之外的真实世界问题。实验结果表明,我们的方法在这些基准问题上平均显著加速了 MUS 枚举。

英文摘要:

Finding Minimal Unsatisfiable Subsets (MUSes) of binary constraints is a common problem in infeasibility analysis of over-constrained systems. However, because of the exponential search space of the problem, enumerating MUSes is extremely time-consuming in real applications. In this work, we propose to prune formulas using a learned model to speed up MUS enumeration. We represent formulas as graphs and then develop a graph-based learning model to predict which part of the formula should be pruned. Importantly, our algorithm does not require data labeling by only checking the satisfiability of pruned formulas. It does not even require training data from the target application because it extrapolates to data with different distributions. In our experiments we combine our algorithm with existing MUS enumerators and validate its effectiveness in multiple benchmarks including a set of real-world problems outside our training distribution. The experiment results show that our method significantly accelerates MUS enumeration on average on these benchmark problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑