arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.00973cs.LO
收藏

BAXMC:达到最大值# SAT的CEGAR方法

BAXMC: a CEGAR approach to Max#SAT

Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet

摘要:

Max#SAT是安全和程序合成中的一个重要问题,在许多应用中被证明是很难解决的。其定义为:给定一个参数化的无量词命题公式,计算参数使得公式的模型数最大。作为扩展,公式可以包括存在前缀。我们提出了一个基于CEGAR的算法及其改进,基于精确或近似模型计数,并证明了其正确性在这两种情况下。实验结果表明,该算法具有比现有算法更好的有效复杂度。

英文摘要:

Max#SAT is an important problem with multiple applications in security and program synthesis that is proven hard to solve. It is defined as: given a parameterized quantifier-free propositional formula compute parameters such that the number of models of the formula is maximal. As an extension, the formula can include an existential prefix. We propose a CEGAR-based algorithm and refinements thereof, based on either exact or approximate model counting, and prove its correctness in both cases. Our experiments show that this algorithm has much better effective complexity than the state of the art.

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

↑