Arnold Beckmann
Abstract
A propositional proof system is weakly automatizable if there is a polynomial time algorithm that separates satisfiable formulas from formulas that have a short refutation in the system, with respect to a given length bound. We show that if the resolution proof system is weakly automatizable, then parity games can be decided in polynomial time. We give simple proofs that the same holds for depth-1 propositional calculus (where resolution has depth 0) with respect to mean payoff and simple stochastic games. We define a new type of combinatorial game and prove that resolution is weakly automatizable if and only if one can separate, by a set decidable in polynomial time, the games in which the first player has a positional winning strategy from the games in which the second player has a positional winning strategy. Our main technique is to show that a suitable weak bounded arithmetic theory proves that both players in a game cannot simultaneously have a winning strategy, and then to translate this proof into propositional form.
- Michael Alekhnovich and Alexander A. Razborov. 2008. Resolution is not automatizable unless W{P} is tractable. SIAM J. Comput. 38, 4, 1347--1363. Google Scholar
Digital Library
- Albert Atserias and María Luisa Bonet. 2004. On the automatizability of resolution and related propositional proof systems. Inform. and Comput. 189, 2, 182--201. Google ScholarDigital Library
- Albert Atserias and Elitza Maneva. 2011. Mean-payoff games and propositional proofs. Inform. Comput. 209, 4, 664--691. Google ScholarDigital Library
- Eli Ben-Sasson and Avi Wigderson. 2001. Short proofs are narrow—resolution made simple. J. ACM 48, 2, 149--169. Google ScholarDigital Library
- Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, and Toniann Pitassi. 2004. Non-automatizability of bounded-depth Frege proofs. Comput. Complexity 13, 1--2, 47--68. Google ScholarDigital Library
- Joshua Buresh-Oppenheim and Tsuyoshi Morioka. 2004. Relativized NP search problems and propositional proof systems. In Proceedings of the 19th IEEE Annual Conference on Computational Complexity. IEEE, 54--67. DOI: http://dx.doi.org/10.1109/CCC.2004.1313795 Google ScholarDigital Library
- Samuel R. Buss. 1986. Bounded Arithmetic. Studies in Proof Theory. Lecture Notes, Vol. 3, Bibliopolis.Google Scholar
- Samuel R. Buss. 1998. First-order proof theory of arithmetic. In Handbook of Proof Theory, Studies in the Logic Foundation of Mathematics, Vol. 137, North-Holland, Amsterdam, 79--147.Google Scholar
- Samuel R Buss, Leszek Ko&lslash;odziejczyk, and Neil Thapen. 2012. Fragments of approximate counting. Manuscript, http://www.math.cas.cz/˜thapen/.Google Scholar
- Anne Condon. 1992. The complexity of stochastic games. Inform. Comput. 96, 2 (1992), 203--224. Google ScholarDigital Library
- Anne Condon. 1993. On algorithms for simple stochastic games. In Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, American Mathematical Society, Providence, RI, 51--71.Google Scholar
- Andrzej Ehrenfeucht and Jan Mycielski. 1979. Positional strategies for mean payoff games. Internat. J. Game Theory 8, 2, 109--113.Google ScholarCross Ref
- E. Allen Emerson. 1985. Automata, tableaux, and temporal logics. In Logics of Programs, Lecture Notes in Computer Science, Vol. 193, Springer, 79--88. Google ScholarDigital Library
- E. Allen Emerson and Charanjit S. Jutla. 1991. Tree automata, Mu-Calculus and determinacy. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (SFCS'91). IEEE 368--377. DOI: http://dx.doi.org/10.1109/SFCS.1991.185392 Google ScholarDigital Library
- Oliver Friedmann. 2011a. An exponential lower bound for the latest deterministic strategy iteration algorithms. Log. Methods Comput. Sci. 7, 3, 3:19, 42.Google Scholar
- Oliver Friedmann. 2011b. Recursive algorithm for parity games requires exponential time. RAIRO Theor. Inform. Appl. 45, 4, 449--457.Google ScholarCross Ref
- Erich Grädel, Wolfgang Thomas, and Thomas Wilke Eds. 2002. Automata, Logics, and Infinite Games. Lecture Notes in Computer Science, vol. 2500, Springer.Google Scholar
- Lei Huang and Toniann Pitassi. 2011. Automatizability and simple stochastic games. In Automata, Languages and Programming, Part I, Lecture Notes in Computer Science, vol. 6755, Springer, 605--617. Google ScholarDigital Library
- Brendan Juba. 2005. On the hardness of simple stochastic games. Master's thesis, Carnegie Mellon University.Google Scholar
- Jan Krajíček. 1994. Lower bounds to the size of constant-depth frege proofs. J. Symbolic Logic 59, 73--86. Google ScholarDigital Library
- Jan Krajíček. 1997. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbolic Logic 62, 457--486.Google ScholarCross Ref
- Jan Krajíček. 2001. On the weak pigeonhole principle. Fund. Math. 170, 1--2, 123--140.Google ScholarCross Ref
- Jan Krajíček, Alan Skelley, and Neil Thapen. 2007. NP search problems in low fragments of bounded arithmetic. J. Symbolic Logic 72, 2, 649--672.Google ScholarCross Ref
- Oliver Kullmann. 2004. Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems. Ann. Math. Artif. Intell. 40, 3--4, 303--352. Google ScholarDigital Library
- Jeff Paris and Alex Wilkie. 1985. Counting problems in bounded arithmetic. In Methods in Mathematical Logic, Lecture Notes in Mathemaics, vol. 1130, Springer, 317--340.Google Scholar
- Pavel Pudlák. 2003. On reducibility and symmetry of disjoint NP pairs. Theoret. Comput. Sci. 295, 1--3, 323--339. Google ScholarDigital Library
- Anuj Puri. 1995. Theory of hybrid systems and discrete event structures. Ph.D. Dissertation. University of California, Berkeley. Google ScholarDigital Library
- Alexander A. Razborov. 1994. On provably disjoint NP-pairs. Technical Report RS-94-36. Basic Research in Computer Science Center, Aarhus, Denmark.Google Scholar
- Lloyd S. Shapley. 1953. Stochastic games. Proc. Nat. Acad. Sci. 39, 1095--1100.Google ScholarCross Ref
- Alan Skelley and Neil Thapen. 2011. The provably total search problems of bounded arithmetic. Proc. London Math. Soc. (3) 103, 1, 106--138.Google ScholarCross Ref
- Colin Stirling. 2001. Modal and Temporal Properties of Processes. Springer. Google ScholarDigital Library
- George Wilmers. 1985. Bounded existential induction. J. Symbolic Logic 50, 1, 72--90.Google ScholarCross Ref
- Uri Zwick and Mike Paterson. 1996. The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158, 1--2, 343--359. Google ScholarDigital Library
Index Terms
- Parity Games and Propositional Proofs
Recommendations
The NP Search Problems of Frege and Extended Frege Proofs
We study consistency search problems for Frege and extended Frege proofs—namely the NP search problems of finding syntactic errors in Frege and extended Frege proofs of contradictions. The input is a polynomial time function, or an oracle, describing a ...
Mean-payoff games and propositional proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in ...
On the complexity of parity games
VoCS'08: Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic ConferenceParity games underlie the model checking problem for the modal µ-calculus, the complexity of which remains unresolved after more than two decades of intensive research. The community is split into those who believe this problem - which is known to be ...
Comments