CoAPI:一种基于核引导过近似覆盖的两阶段非子句公式素编译算法
CoAPI: An Efficient Two-Phase Algorithm Using Core-Guided Over-Approximate Cover for Prime Compilation of Non-Clausal Formulae
摘要:
主编译,即,公式的所有素蕴涵或蕴涵(简称素蕴涵)的生成是人工智能的一个突出的基本问题。近年来,非小句公式的素编译受到了极大的关注。最先进的方法生成所有素数以及使用双轨编码由素数蕴涵构造的素数覆盖。然而,双轨编码潜在地扩展了搜索空间。此外,构造一个素覆盖,这是必要的,他们的方法,是耗时的。为了解决这些问题,我们提出了一种新的两阶段方法- CoAPI。这两个阶段是在不使用双轨编码的情况下构造覆盖的关键。具体而言,给定一个非小句公式,我们首先提出了一个核心引导的方法,在第一阶段将非小句公式重写成由过近似蕴涵构造的覆盖。然后,我们在第二阶段根据覆盖生成所有素数。为了减小覆盖的大小,我们提出了一种基于多阶的收缩方法,在小尺寸和效率之间进行了很好的权衡,从而大大压缩了覆盖的大小。实验结果表明,CoAPI优于最先进的方法。特别地,对于生成所有素数隐含,CoAPI消耗的时间少了大约一个数量级。
英文摘要:
Prime compilation, i.e., the generation of all prime implicates or implicants (primes for short) of formulae, is a prominent fundamental issue for AI. Recently, the prime compilation for non-clausal formulae has received great attention. The state-of-the-art approaches generate all primes along with a prime cover constructed by prime implicates using dual rail encoding. However, the dual rail encoding potentially expands search space. In addition, constructing a prime cover, which is necessary for their methods, is time-consuming. To address these issues, we propose a novel two-phase method -- CoAPI. The two phases are the key to construct a cover without using dual rail encoding. Specifically, given a non-clausal formula, we first propose a core-guided method to rewrite the non-clausal formula into a cover constructed by over-approximate implicates in the first phase. Then, we generate all the primes based on the cover in the second phase. In order to reduce the size of the cover, we provide a multi-order based shrinking method, with a good tradeoff between the small size and efficiency, to compress the size of cover considerably. The experimental results show that CoAPI outperforms state-of-the-art approaches. Particularly, for generating all prime implicates, CoAPI consumes about one order of magnitude less time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。