Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
Beitrag zu einer Konferenz
Faculties
Fakultät für Ingenieurwissenschaften, Informatik und PsychologieInstitutions
Institut für Theoretische InformatikPublished in
37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) / Paul, Christophe ; Bläser, Markus (Hrsg.). - Saarbrücken/Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. - (Leibniz International Proceedings in Informatics ; 154). - Art.-Nr. UNSP 60. - ISBN 978-3-95977-140-5. - ISSN 1868-8969
Link to publication
https://dx.doi.org/10.4230/LIPIcs.STACS.2020.60Conference
37th International Symposium on Theoretical Aspects of Computer Science (STACS), 2020-03-10 - 2020-03-13, Montpellier, France
Funding information
Deutsche Forschungsgemeinschaft (DFG) [430150230]
Keywords
Proof Complexity; Resolution; Tree-like Resolution; Pebble Game; Reversible Pebbling; Prover-Delayer Game; Raz-McKenzie Game; Clause Space; Variable Space; OPTIMAL SEPARATION; SHORT PROOFS; TIME; COMPLEXITY; BOUNDSDewey Decimal Group
DDC 000 / Computer science, information & general worksDDC 510 / Mathematics