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

阈值综合问题的两种算法实现

Implementations of two Algorithms for the Threshold Synthesis Problem

Jan-Georg Smaus, Christian Schilling, Fabian Wenzelmann

摘要:

线性伪布尔约束(LPB)是$a_1 \cdot \ell_1 + \dots + a_m \cdot \ell_m \geq d$形式的表达式,其中每个$\ell_i$是一个文字(它假定值为1或0,取决于命题变量$x_i$是真还是假),$a_1, \dots, a_m, d$是自然数。一个LPB表示一个布尔函数,并且那些可以由恰好一个LPB表示的布尔函数被称为阈值函数。如果可能的话,找到布尔函数的LPB表示的问题被称为阈值识别问题或阈值合成问题。该问题有一个使用线性规划的$O(m^7 t^5)$算法,其中$m$是维数,$t$是DNF输入中的项数。它一直是一个悬而未决的问题,是否可以通过一个完全组合的过程来识别阈值函数。Smaus已经开发了这样一个过程来实现这一点,它通过分解DNF和“计数”其中的变量出现来工作。我们在此报告这一经验。最重要的见解是,不幸的是,Smaus的算法是不完整的。

英文摘要:

A linear pseudo-Boolean constraint (LPB) is an expression of the form $a_1 \cdot \ell_1 + \dots + a_m \cdot \ell_m \geq d$, where each $\ell_i$ is a literal (it assumes the value 1 or 0 depending on whether a propositional variable $x_i$ is true or false) and $a_1, \dots, a_m, d$ are natural numbers. An LPB represents a Boolean function, and those Boolean functions that can be represented by exactly one LPB are called threshold functions. The problem of finding an LPB representation of a Boolean function if possible is called threshold recognition problem or threshold synthesis problem. The problem has an $O(m^7 t^5)$ algorithm using linear programming, where $m$ is the dimension and $t$ the number of terms in the DNF input. It has been an open question whether one can recognise threshold functions through an entirely combinatorial procedure. Smaus has developed such a procedure for doing this, which works by decomposing the DNF and "counting" the variable occurrences in it. We have implemented both algorithms as a thesis project. We report here on this experience. The most important insight was that the algorithm by Smaus is, unfortunately, incomplete.

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

↑