Parity games and propositional proofs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00422131" target="_blank" >RIV/67985840:_____/13:00422131 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-40313-2_12" target="_blank" >http://dx.doi.org/10.1007/978-3-642-40313-2_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-40313-2_12" target="_blank" >10.1007/978-3-642-40313-2_12</a>
Alternative languages
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 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
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
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science 2013
ISBN
978-3-642-40312-5
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
111-122
Publisher name
Springer
Place of publication
Berlin
Event location
Klosterneuburg
Event date
Aug 26, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—