A Resolution-Based Interactive Proof System for UNSAT

Author:

Czerner PhilippORCID,Esparza JavierORCID,Krasotin ValentinORCID

Abstract

AbstractModern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless $$\textsf{NP}=\textsf{coNP}$$ NP = coNP ), and at recent SAT competitions the largest certificates of unsatisfiability are starting to reach terabyte size.Recently, Couillard, Czerner, Esparza, and Majumdar have suggested to replace certificates with interactive proof systems based on the $$\textsf {IP}=\textsf {PSPACE}$$ IP = PSPACE theorem. They have presented an interactive protocol between a prover and a verifier for an extension of QBF. The overall running time of the protocol is linear in the time needed by a standard BDD-based algorithm, and the time invested by the verifier is polynomial in the size of the formula. (So, in particular, the verifier never has to read or process exponentially long certificates). We call such an interactive protocol competitive with the BDD algorithm for solving QBF.While BDD-algorithms are state-of-the-art for certain classes of QBF instances, no modern (UN)SAT solver is based on BDDs. For this reason, we initiate the study of interactive certification for more practical SAT algorithms. In particular, we address the question whether interactive protocols can be competitive with some variant of resolution. We present two contributions. First, we prove a theorem that reduces the problem of finding competitive interactive protocols to finding an arithmetisation of formulas satisfying certain commutativity properties. (Arithmetisation is the fundamental technique underlying the $$\textsf {IP}=\textsf {PSPACE}$$ IP = PSPACE theorem.) Then, we apply the theorem to give the first interactive protocol for the Davis-Putnam resolution procedure.

Publisher

Springer Nature Switzerland

Reference18 articles.

1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2006), https://theory.cs.princeton.edu/complexity/book.pdf

2. Babai, L.: Trading group theory for randomness. In: Sedgewick, R. (ed.) Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA. pp. 421–429. ACM (1985). https://doi.org/10.1145/22145.22192, https://doi.org/10.1145/22145.22192

3. Barbosa, H., Reynolds, A., Kremer, G., Lachnitt, H., Niemetz, A., Nötzli, A., Ozdemir, A., Preiner, M., Viswanathan, A., Viteri, S., Zohar, Y., Tinelli, C., Barrett, C.W.: Flexible proof production in an industrial-strength SMT solver. In: Blanchette, J., Kovács, L., Pattinson, D. (eds.) Automated Reasoning - 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13385, pp. 15–35. Springer (2022). https://doi.org/10.1007/978-3-031-10769-6_3, https://doi.org/10.1007/978-3-031-10769-6_3

4. Buss, S.R., Turán, G.: Resolution proofs of generalized pigeonhole principles. Theor. Comput. Sci. 62(3), 311–317 (1988)

5. Couillard, E., Czerner, P., Esparza, J., Majumdar, R.: Making $$\sf IP=\sf PSPACE$$ practical: Efficient interactive protocols for BDD algorithms. In: Enea, C., Lal, A. (eds.) Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part III. Lecture Notes in Computer Science, vol. 13966, pp. 437–458. Springer (2023). https://doi.org/10.1007/978-3-031-37709-9_21, https://doi.org/10.1007/978-3-031-37709-9_21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3