BriefGPT.xyz
Feb, 2024
图剪枝用于枚举最小不可满足子集
Graph Pruning for Enumeration of Minimal Unsatisfiable Subsets
HTML
PDF
Panagiotis Lymperopoulos, Liping Liu
TL;DR
以图形为基础的学习模型加速枚举最小不可满足子集(MUSes)的问题,通过对超约束系统的不可行性分析中的公式进行修剪,并且在多个基准测试中验证了方法的有效性。
Abstract
Finding
minimal unsatisfiable subsets
(MUSes) of binary constraints is a common problem in
infeasibility analysis
of
over-constrained systems
→