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

用相依序列消除量词消去

Quantifier Elimination by Dependency Sequents

Eugene Goldberg, Panagiotis Manolios

摘要:

研究合取范式(CNF)中布尔公式的存在性量词消去问题.我们提出了一种新的方法来解决这个问题称为依赖序列的推导(DDS)。依赖性-冗余度(D-冗余度)用于记录一组量化变量在部分分配下是冗余的。我们引入了一个类似于解析的操作,称为join,它从两个现有的D序列中产生一个新的D序列。我们还表明,DDS是合成的,即如果我们的输入公式是一个连接的独立公式,DDS自动识别和利用这些信息。我们介绍了一种基于DDS的算法,目前的实验结果表明其潜力。

英文摘要:

We consider the problem of existential quantifier elimination for Boolean formulas in Conjunctive Normal Form (CNF). We present a new method for solving this problem called Derivation of Dependency-Sequents (DDS). A Dependency-sequent (D-sequent) is used to record that a set of quantified variables is redundant under a partial assignment. We introduce a resolution-like operation called join that produces a new D-sequent from two existing D-sequents. We also show that DDS is compositional, i.e. if our input formula is a conjunction of independent formulas, DDS automatically recognizes and exploits this information. We introduce an algorithm based on DDS and present experimental results demonstrating its potential.

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

↑