关于DPLL(T)的两个模拟
Two simulations about DPLL(T)
摘要:
在本文中,我们涉及不同的公式的DPLL(T)过程。第一个公式是基于重写规则系统,我们表示为DPLL(T)。第二个公式是的推理系统,我们记为LKDPLL(T)。第三个公式是标准的证明搜索机制在这里介绍的微积分LKP(T)中的应用。我们将从DPLL(T)到LKDPLL(T)的编码形式化,据我们所知,这从未明确给出,并且在DPLL(T)扩展有回跳和引理学习的情况下,甚至从未隐式给出。我们还正式从LKDPLL(T)到LKp(T)的编码,建立在Ivan Gazeau以前的工作基础上:我们扩展了他的工作,我们处理SAT模理论的“模理论”方面,通过扩展微积分来允许调用理论求解器(被视为黑盒)。我们还扩展了他的工作,因为我们处理DPLL的高级功能,如backjumping和引理学习等。最后,我们通过开始正式化模拟的定量方面来改进方法:保留复杂性(构建完整证明的步骤数)。其他方面仍有待形式化(搜索的非确定性/搜索空间的宽度)。
英文摘要:
In this paper we relate different formulations of the DPLL(T) procedure. The first formulation is based on a system of rewrite rules, which we denote DPLL(T). The second formulation is an inference system of, which we denote LKDPLL(T). The third formulation is the application of a standard proof-search mechanism in a sequent calculus LKp(T) introduced here. We formalise an encoding from DPLL(T) to LKDPLL(T) that was, to our knowledge, never explicitly given and, in the case where DPLL(T) is extended with backjumping and Lemma learning, never even implicitly given. We also formalise an encoding from LKDPLL(T) to LKp(T), building on Ivan Gazeau's previous work: we extend his work in that we handle the "-modulo-Theory" aspect of SAT-modulo-theory, by extending the sequent calculus to allow calls to a theory solver (seen as a blackbox). We also extend his work in that we handle advanced features of DPLL such as backjumping and Lemma learning, etc. Finally, we re fine the approach by starting to formalise quantitative aspects of the simulations: the complexity is preserved (number of steps to build complete proofs). Other aspects remain to be formalised (non-determinism of the search / width of search space).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。