Regular resolution effectively simulates resolution (2402.15871v1)
Abstract: Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs in regular resolution while admitting polynomial-size proofs in resolution. Thus, with respect to the usual notion of simulation, regular resolution is separated from resolution. An alternative, and weaker, notion for comparing proof systems is that of an "effective simulation," which allows the translation of the formula along with the proof when moving between proof systems. We prove that regular resolution is equivalent to resolution under effective simulations. As a corollary, we recover in a black-box fashion a recent result on the hardness of automating regular resolution.
- On the automatizability of resolution and related propositional proof systems. Information and Computation, 189(2):182–201, 2004.
- An exponential separation between regular and general resolution. Theory of Computing, 3:81–102, 2007.
- Automating resolution is NP-hard. Journal of the ACM, 67(5):31:1–31:17, 2020.
- Zoë Bell. Automating regular or ordered resolution is NP-hard. Technical Report 105, Electronic Colloquium on Computational Complexity (ECCC), 2020.
- Resolution trees with lemmas: Resolution refinements that characterize DLL algorithms with clause learning. Logical Methods in Computer Science, 4(4:13):1–28, 2008.
- On linear resolution. Journal on Satisfiability, Boolean Modeling and Computation, 10(1):23–35, 2016.
- The complexity of resolution refinements. The Journal of Symbolic Logic, 72(4):1336–1352, 2007.
- DRAT and propagation redundancy proofs without new variables. Logical Methods in Computer Science, 17(2):12:1–12:31, 2021.
- The relative efficiency of propositional proof systems. The Journal of Symbolic Logic, 44(1):36–50, 1979.
- Andreas Goerdt. Regular resolution versus unrestricted resolution. SIAM Journal on Computing, 22(4):661–683, 1993.
- Clause learning can effectively p-simulate general propositional resolution. In Proceedings of the \nth23 AAAI Conference on Artificial Intelligence (AAAI), pages 283–290. AAAI Press, 2008.
- Formalizing dangerous SAT encodings. In Proceedings of the \nth10 International Conference on Theory and Applications of Satisfiability Testing (SAT), number 4501 in Lecture Notes in Computer Science, pages 159–172. Springer, 2007.
- The surprising power of constant depth algebraic proofs. In Proceedings of the \nth35 Symposium on Logic in Computer Science (LICS), pages 591–603. Association for Computing Machinery, 2020.
- Effectively polynomial simulations. In Proceedings of the \nth1 Innovations in Computer Science (ICS), pages 370–382. Tsinghua University Press, 2010.
- Pavel Pudlák. On reducibility and symmetry of disjoint NP pairs. Theoretical Computer Science, 295(1–3):323–339, 2003.
- Alasdair Urquhart. A near-optimal separation of regular and general resolution. SIAM Journal on Computing, 40(1):107–121, 2011.