理解证明复杂性中的空间:通过替换的分离和权衡
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
摘要:
对于当前最先进的DPLL SAT解算器,两个主要瓶颈是所使用的时间和存储器量。在证明复杂性中,这些资源对应于归结证明的长度和空间。已经有一个长期的研究调查这些证明复杂性的措施,但虽然强有力的结果已经建立了长度,我们的理解空间,以及它如何与长度仍然相当差。特别是,分辨率证明是否可以同时针对长度和空间进行优化,或者这两种措施之间是否存在权衡,这个问题基本上仍然是开放的。在本文中,我们纠正这种情况,证明了主机的长度空间权衡结果的决议。我们的权衡集合几乎涵盖了公式的空间复杂度的整个值范围,并且大多数权衡都是超多项式的,甚至是指数的,并且本质上是紧的。使用类似的技术,我们表明,这些权衡,实际上扩展到指数更强的k-DNF分辨率证明系统,其中操作的析取范式公式与有界arity k项。我们还回答了开放的问题是否k-DNF决议系统形成一个严格的层次结构,相对于空间的肯定。我们的关键技术贡献是下面这个有点令人惊讶的定理:任何CNF公式F都可以通过简单的变量替换转换成新的公式F ',使得如果F具有正确的性质,则F'可以以与F基本相同的长度被证明,而另一方面,在F '的任何证明中,需要同时在存储器中保持的最小行数较低-在F的任何证明中同时需要的变量的最小数量的限制。应用这个定理,所谓的卵石公式定义的卵石游戏的有向无环图,我们得到我们的结果。
英文摘要:
For current state-of-the-art DPLL SAT-solvers the two main bottlenecks are the amounts of time and memory used. In proof complexity, these resources correspond to the length and space of resolution proofs. There has been a long line of research investigating these proof complexity measures, but while strong results have been established for length, our understanding of space and how it relates to length has remained quite poor. In particular, the question whether resolution proofs can be optimized for length and space simultaneously, or whether there are trade-offs between these two measures, has remained essentially open. In this paper, we remedy this situation by proving a host of length-space trade-off results for resolution. Our collection of trade-offs cover almost the whole range of values for the space complexity of formulas, and most of the trade-offs are superpolynomial or even exponential and essentially tight. Using similar techniques, we show that these trade-offs in fact extend to the exponentially stronger k-DNF resolution proof systems, which operate with formulas in disjunctive normal form with terms of bounded arity k. We also answer the open question whether the k-DNF resolution systems form a strict hierarchy with respect to space in the affirmative. Our key technical contribution is the following, somewhat surprising, theorem: Any CNF formula F can be transformed by simple variable substitution into a new formula F' such that if F has the right properties, F' can be proven in essentially the same length as F, whereas on the other hand the minimal number of lines one needs to keep in memory simultaneously in any proof of F' is lower-bounded by the minimal number of variables needed simultaneously in any proof of F. Applying this theorem to so-called pebbling formulas defined in terms of pebble games on directed acyclic graphs, we obtain our results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。