%0 Journal Article
%T 应用不可满足子式的解码电路综合优化方法
%A 张建民
%A 黎铁军
%A 马柯帆
%A 肖立权&lt
%A /br&gt
%A ZHANG Jianmin
%A LI Tiejun
%A MA Kefan
%A XIAO Liquan
%J 国防科技大学学报
%D 2016
%R 10.11887/j.cn.201605001
%X 解释布尔公式不可满足的原因在很多领域都具有实际的应用需求，而最小不可满足子式能够为诸如电路的自动综合等应用领域中的不可满足原因提供最精确的解释。因此，将两种能够高效求解最小不可满足子式的算法——分支-限界算法与贪心遗传算法，集成到解码电路的自动综合工具中。采用通信领域的标准编码电路作为测试集，将两种算法进行对比。实验结果表明，在运行时间与每秒剔除的短句数方面，贪心遗传算法优于分支-限界算法；不可满足子式在解码电路的自动综合过程中发挥重要作用。</br>Explaining the causes of unsatisfiability of the Boolean formulas has many real applications in various fields. The minimum unsatisfiable subformulas can provide most accurate explanations for the causes of infeasibility in many application fields such as the automatic circuits' synthesis. Therefore, two best algorithms of extracting the minimum unsatisfiable subformulas, respectively called the branch-and-bound algorithm and greedy genetic algorithm, were integrated into the automatic synthesis tool of decoding circuits. Adopting the standard encoding circuits in communication fields as the benchmarks, the study compared and analyzed the two algorithms. The experimental results show that the greedy genetic algorithm outperforms the branch-and-bound algorithm on runtime and removed clauses per second. The results also show that the unsatisfiable subformulas play an important role in the process of synthesizing automatically the decoding circuits.
%K 电路综合 形式化方法 可满足性求解 不可满足子式&lt
%K /br&gt
%K circuit synthesis formal method satisfiability solving unsatisfiable subformula
%U http://journal.nudt.edu.cn/gfkjdxxb/ch/reader/view_abstract.aspx?file_no=201605001&flag=1