Parity games and propositional proofs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F14%3A00430389" target="_blank" >RIV/67985840:_____/14:00430389 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/2579822" target="_blank" >http://dx.doi.org/10.1145/2579822</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/2579822" target="_blank" >10.1145/2579822</a>

Result language
angličtina
Original language name
Parity games and propositional proofs
Original language description
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 gamesin which the second player has a positional winning strategy.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/IAA100190902" target="_blank" >IAA100190902: Mathematical logic, complexity, and algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)