.png){kind=icon}
返回
Accelerating MUS enumeration by inconsistency graph partitioning
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-019-9881-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of finding minimal unsatisfiable subsets (MUSes) has been studied frequently because of its theoretical importance and wide range of applications in domains such as electronic design automation, software, and integrated circuit verification. In this paper, a method for accelerating the enumeration of MUSes based on inconsistency graph partitioning is proposed. First, an inconsistency graph of a set of clauses is constructed by extracting the inconsistency relations between literals of different clauses. In this paper, we show that by partitioning the inconsistency graph into small connected components through a vertex cut, the enumeration of MUSes in different components becomes independent and it is possible to compute them separately. Moreover, the MUSes of the original clause set can be constructed by merging the unit clauses in the MUSes of these connected components back into the clauses in the vertex cut. Experiments show that by integrating the acceleration method into the MARCO MUSes enumerator, there is a 2-3 times improvement in the average runtime of solved instances for randomly generated benchmarks. By integrating the acceleration method into itself as an MUS enumerator, there is another 3-4 times improvement when compared with the accelerated MARCO.
Keyword:
minimal unsatisfiable subsets
inconsistency graph
graph partition
SAT
UNSAT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
查看更多内容