Parity Games and Propositional Proofs
A propositional proof system is weakly automatizable if there is a polynomial time algorithm which separates satisfiable formulas from formulas which 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 also define a 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.
KeywordsPolynomial Time Algorithm Proof System Outgoing Edge Winning Strategy Propositional Formula
Unable to display preview. Download preview PDF.
- 4.Buresh-Oppenheim, J., Morioka, T.: Relativized NP search problems and propositional proof systems. In: Proceedings of the 19th IEEE Annual Conference on Computational Complexity, pp. 54–67. IEEE (2004)Google Scholar
- 5.Buss, S.R.: Bounded arithmetic, Studies in Proof Theory. Lecture Notes, vol. 3. Bibliopolis, Naples (1986)Google Scholar
- 6.Condon, A.: On algorithms for simple stochastic games. In: Advances in Computational Complexity Theory (New Brunswick, NJ, 1990). DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol. 13, pp. 51–71. Amer. Math. Soc., Providence (1993)Google Scholar
- 9.Friedmann, O.: An exponential lower bound for the latest deterministic strategy iteration algorithms. Log. Methods Comput. Sci. 7(3), 3:19, 42 (2011)Google Scholar
- 13.Juba, B.: On the Hardness of Simple Stochastic Games. Master’s thesis, Carnegie Mellon University (2005)Google Scholar
- 19.Puri, A.: Theory of hybrid systems and discrete event structures. Ph.D. thesis, University of California, Berkeley (1995)Google Scholar
- 20.Razborov, A.A.: On provably disjoint NP-pairs. Tech. Rep. RS-94-36, Basic Research in Computer Science Center, Aarhus, Denmark (November 1994)Google Scholar
- 21.Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer (2001)Google Scholar