可调在线MUS/MSS枚举
Tunable Online MUS/MSS Enumeration
摘要:
在计算机科学的各个领域中,出现了处理一组约束的问题。如果约束的集合是不可满足的,则可以要求对这种不可满足性的原因的最小描述。最小不可满足子集(MUSes)和最大可满足子集(MSSes)是两类这样的最小描述。这项工作的目标是枚举MUSes和MSSes为一个给定的约束系统。由于这种完整的枚举可能是棘手的一般情况下,我们专注于建立一个在线算法,它产生MUSes/MSSes在一个飞行的方式,只要他们被发现。这个问题之前甚至在其在线版本中也曾被研究过。然而,我们的算法使用了一种新的方法,能够优于当前最先进的在线MUS/MSS枚举算法。此外,我们的算法的性能可以调整使用可调参数。我们评估了一组基准的算法。
英文摘要:
In various areas of computer science, the problem of dealing with a set of constraints arises. If the set of constraints is unsatisfiable, one may ask for a minimal description of the reason for this unsatisifi- ability. Minimal unsatisifable subsets (MUSes) and maximal satisifiable subsets (MSSes) are two kinds of such minimal descriptions. The goal of this work is the enumeration of MUSes and MSSes for a given constraint system. As such full enumeration may be intractable in general, we focus on building an online algorithm, which produces MUSes/MSSes in an on-the-fly manner as soon as they are discovered. The problem has been studied before even in its online version. However, our algorithm uses a novel approach that is able to outperform current state-of-the art algorithms for online MUS/MSS enumeration. Moreover, the performance of our algorithm can be adjusted using tunable parameters. We evaluate the algorithm on a set of benchmarks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。