Affiliation:
1. KTH Royal Institute of Technology, Stockholm, Sweden
Abstract
This paper is intended as an informal and accessible survey of proof complexity for non-experts, focusing on some comparatively weak proof systems of particular interest in connection with SAT solving. We review resolution, polynomial calculus, and cutting planes (related to conflict-driven clause learning, Gröbner basis computations, and pseudo-Boolean solving, respectively) and some complexity measures that have been studied for these proof systems. We also discuss briefly to what extent proof complexity could provide insights into SAT solver performance, and how concerns related to applied SAT solving can give rise to interesting complexity-theoretic questions. Along the way, we highlight a number of current research challenges.
Publisher
Association for Computing Machinery (ACM)
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hard QBFs for Merge Resolution;ACM Transactions on Computation Theory;2023-12-22
2. Hardness Characterisations and Size-width Lower Bounds for QBF Resolution;ACM Transactions on Computational Logic;2023-01-27
3. Proof Complexity of Modal Resolution;Journal of Automated Reasoning;2021-10-13
4. Resolution with Counting: Dag-Like Lower Bounds and Different Moduli;computational complexity;2021-01-08
5. On Dedicated CDCL Strategies for PB Solvers;Theory and Applications of Satisfiability Testing – SAT 2021;2021