通过局部搜索改进MUC提取
Improving MUC extraction thanks to local search
摘要:
从不可满足约束网络中提取MUCs(MinimalUnsatisfiableCores)是一个非常有用的过程,它可以帮助我们了解网络不可满足的原因,从而使网络可以被重新设计和放松,使其变得可满足。尽管有糟糕的最坏情况计算复杂性结果,但已经提出了对于许多现实生活实例似乎易于处理的各种MUC发现方法。其中许多是基于所谓的过渡约束的连续识别。在这方面,我们展示了如何本地搜索可以用来提取额外的过渡约束在每个主要的迭代步骤。该方法优于基于从SAT相关技术导入的模型旋转形式的技术,并且还表现出额外的transi- tion约束。我们广泛的计算实验表明,这种增强也提高了最先进的DC(WCORE)类MUC提取器的性能。
英文摘要:
ExtractingMUCs(MinimalUnsatisfiableCores)fromanunsatisfiable constraint network is a useful process when causes of unsatisfiability must be understood so that the network can be re-engineered and relaxed to become sat- isfiable. Despite bad worst-case computational complexity results, various MUC- finding approaches that appear tractable for many real-life instances have been proposed. Many of them are based on the successive identification of so-called transition constraints. In this respect, we show how local search can be used to possibly extract additional transition constraints at each main iteration step. The approach is shown to outperform a technique based on a form of model rotation imported from the SAT-related technology and that also exhibits additional transi- tion constraints. Our extensive computational experimentations show that this en- hancement also boosts the performance of state-of-the-art DC(WCORE)-like MUC extractors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。