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

指数DPLL(T)证明的并发问题

A Concurrency Problem with Exponential DPLL(T) Proofs

Liana Hadarean, Alex Horn, Tim King

摘要:

许多可满足性模理论求解器实现DPLL(T)框架的变体,其将理论特定推理与公式的命题抽象上的推理分离。这样的求解者得出结论,一旦他们了解了足够多的理论冲突来推导出一个命题矛盾,一个公式就是不可满足的。然而,有些问题,如钻石问题,需要学习指数许多冲突。我们给出了一个一般的标准,建立下界的理论冲突的数量在任何DPLL(T)证明一个给定的问题。我们将我们的标准应用于简单但具有代表性的并发问题的两种不同的最先进的符号偏序编码。即使其中一个编码是渐近小于其他的,我们建立了相同的指数下界证明复杂性。我们的实验证实了这一理论下限在多个求解器和理论组合。

英文摘要:

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is unsatisfiable once they have learned enough theory conflicts to derive a propositional contradiction. However some problems, such as the diamonds problem, require learning exponentially many conflicts. We give a general criterion for establishing lower bounds on the number of theory conflicts in any DPLL(T ) proof for a given problem. We apply our criterion to two different state-of-the-art symbolic partial-order encodings of a simple, yet representative concurrency problem. Even though one of the encodings is asymptotically smaller than the other, we establish the same exponential lower bound proof complexity for both. Our experiments confirm this theoretical lower bound across multiple solvers and theory combinations.

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

↑