arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.11103cs.LO
收藏

ESOP形式的精确合成

Exact Synthesis of ESOP Forms

Heinz Riener, Rüdiger Ehlers, Bruno Schmitt, Giovanni De Micheli

摘要:

我们提出了一个精确的综合方法计算互斥或总和产品(ESOP)的形式与最小数量的产品条款使用布尔可满足性。我们的方法发现一个或多个ESOP形式为一个给定的布尔函数。该方法可以处理定义在多个布尔变量上的不完全指定的布尔函数,并且如果布尔函数可以仅用几个乘积项表示,则速度特别快。我们描述了一个固定数量的条款作为决策问题的ESOP合成问题的形式化,并提出了搜索程序,以确定ESOP形式的最小尺寸。我们进一步讨论了如何搜索程序可以放松,以找到在合理的时间内小规模的员工持股计划的形式。我们实验评估的性能完全和不完全指定的布尔函数的SAT为基础的合成程序。

英文摘要:

We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach can deal with incompletely-specified Boolean functions defined over many Boolean variables and is particularly fast if the Boolean function can be expressed with only a few product terms. We describe the formalization of the ESOP synthesis problem with a fixed number of terms as a decision problem and present search procedures for determining ESOP forms of minimum size. We further discuss how the search procedures can be relaxed to find ESOP forms of small sizes in reasonable time. We experimentally evaluate the performance of the SAT-based synthesis procedures on completely- and incompletely-specified Boolean functions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑