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

布尔函数综合的知识编译

Knowledge Compilation for Boolean Functional Synthesis

S. Akshay, Jatin Arora, Supratik Chakraborty, S. Krishna, Divya Raghunathan, Shetal Shah

摘要:

给定一个布尔公式F(X,Y),其中X是一个输出向量,Y是一个输入向量,布尔函数综合问题要求我们为X计算一个Skolem函数向量G(Y),使得只要\exists X F(X,Y)成立,F(G(Y),Y)就成立。本文研究了规格说明F(X,Y)的表示与综合复杂度之间的关系。我们引入了一个新的范式的布尔公式,称为SynNNF,保证多项式时间的合成,也多项式时间存在量化的一些顺序的变量。我们发现,几个范式研究的知识汇编文献中的SynNNF的包容,虽然SynNNF可以超多项式比他们更简洁。受这些结果的启发,我们提出了一个算法转换CNF的规格SynNNF,目的是解决布尔函数综合问题。一个原型实现的实验表明,这种方法解决了几个基准超出了国家的最先进的工具。

英文摘要:

Given a Boolean formula F(X,Y), where X is a vector of outputs and Y is a vector of inputs, the Boolean functional synthesis problem requires us to compute a Skolem function vector G(Y)for X such that F(G(Y),Y) holds whenever \exists X F(X,Y) holds. In this paper, we investigate the relation between the representation of the specification F(X,Y) and the complexity of synthesis. We introduce a new normal form for Boolean formulas, called SynNNF, that guarantees polynomial-time synthesis and also polynomial-time existential quantification for some order of quantification of variables. We show that several normal forms studied in the knowledge compilation literature are subsumed by SynNNF, although SynNNFcan be super-polynomially more succinct than them. Motivated by these results, we propose an algorithm to convert a specification in CNF to SynNNF, with the intent of solving the Boolean functional synthesis problem. Experiments with a prototype implementation show that this approach solves several benchmarks beyond the reach of state-of-the-art tools.

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

↑