arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.01585cs.LOcs.CC
收藏

关于MCSAT的证明复杂性

On the proof complexity of MCSAT

Gereon Kremer, Erika Abraham, Vijay Ganesh

摘要:

可满足性模理论(SMT)和SAT求解器是许多正式软件工具中的关键组件,主要是因为它们能够轻松地解决具有数百万个变量和子句的逻辑问题实例。传统的复杂性理论认为,这些求解器解决的问题在最坏的情况下被认为是困难的。为了解决理论与实践之间的这种明显差异,理论家们提出了将这些求解器作为证明系统进行研究,以便能够建立适当的复杂性下限和上限。例如,近年来已经表明,SAT求解器(的理想化模型)多项式等价于命题逻辑的一般归结证明系统,并且使用CDCL(T)架构的SMT求解器多项式等价于Res*(T)证明系统。在本文中,我们扩展此程序的MCSAT方法SMT解决表明,MCSAT架构是多项式等价的Res*(T)证明系统。因此,我们从证明复杂性理论的角度建立了CDCL(T)和MCSAT之间的等价性。这是迈向更丰富的理论的第一步,也是必不可少的一步,可以帮助(参数化)描述基于MCSAT的SMT求解器可以很好地执行的公式类型。

英文摘要:

Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical problem instances with millions of variables and clauses. This efficiency of solvers is in surprising contrast to the traditional complexity theory position that the problems that these solvers address are believed to be hard in the worst case. In an attempt to resolve this apparent discrepancy between theory and practice, theorists have proposed the study of these solvers as proof systems that would enable establishing appropriate lower and upper bounds on their complexity. For example, in recent years it has been shown that (idealized models of) SAT solvers are polynomially equivalent to the general resolution proof system for propositional logic, and SMT solvers that use the CDCL(T) architecture are polynomially equivalent to the Res*(T) proof system. In this paper, we extend this program to the MCSAT approach for SMT solving by showing that the MCSAT architecture is polynomially equivalent to the Res*(T) proof system. Thus, we establish an equivalence between CDCL(T) and MCSAT from a proof-complexity theoretic point of view. This is a first and essential step towards a richer theory that may help (parametrically) characterize the kinds of formulas for which MCSAT-based SMT solvers can perform well.

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

↑