Items where authors include "Beyersdorff, O"
Up a levelArticle
Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J and Mahajan, M (2021) Building Strategies into QBF Proofs. Journal of Automated Reasoning, 65 (2). pp. 125-154. ISSN 0168-7433
Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J, Chew, L et al. (2 more authors) (2019) Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning, 63 (3). pp. 597-623. ISSN 0168-7433
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2019) A game characterisation of tree-like Q-Resolution size. Journal of Computer and System Sciences, 104. pp. 82-101. ISSN 0022-0000
Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2018) Understanding cutting planes for QBFs. Information and Computation, 262 (1). pp. 141-161. ISSN 0890-5401
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2018) Are Short Proofs Narrow? QBF Resolution is not so Simple. ACM Transactions on Computational Logic, 19 (1). 1. ISSN 1529-3785
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2017) Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science, 13 (2). 7. ISSN 1860-5974
Beyersdorff, O orcid.org/0000-0002-2870-1648, Hirsch, EA, Krajíček, J et al. (1 more author) (2014) Optimal algorithms and proofs (Dagstuhl Seminar 14421). Dagstuhl Reports, 4 (10). pp. 51-68. ISSN 2192-5283
Beyersdorff, O, Galesi, N and Lauria, M (2013) Parameterized complexity of DPLL search procedures. ACM Transactions on Computational Logic, 14 (3). 20. ISSN 1529-3785
Beyersdorff, O, Datta, S, Krebs, A et al. (5 more authors) (2013) Verifying proofs in constant depth. ACM Transactions on Computation Theory (TOCT), 5 (1). 2. ISSN 1942-3454
Beyersdorff, O, Galesi, N and Lauria, M (2013) A characterization of tree-like resolution size. Information Processing Letters, 113 (18). 666 - 671. ISSN 0020-0190
Beyersdorff, O, Galesi, N, Lauria, M et al. (1 more author) (2012) Parameterized Bounded-Depth Frege Is not Optimal. ACM Transactions on Computation Theory, 4 (3). 7.1 - 7.16 . ISSN 1942-3454
Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2012) The complexity of reasoning for fragments of default logic. Journal of Logic and Computation, 22 (3). 587 - 604 . ISSN 0955-792X
Beyersdorff, O and Sadowski, Z (2011) Do there exist complete sets for promise classes? Mathematical logic quarterly, 57 (6). 535 - 550 . ISSN 0942-5616
Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2011) Proof complexity of propositional default logic. Archive for Mathematical Logic, 50 (7-8). 727 - 742 . ISSN 1432-0665
Beyersdorff, O, Koebler, J and Mueller, S (2011) Proof systems that take advice. Information and Computation, 209 (3). 320 - 332 . ISSN 0890-5401
Beyersdorff, O, Meier, A, Mundhenk, M et al. (3 more authors) (2011) Model Checking CTL is Amost Always Inherently Sequential. Logical Methods in Computer Science, 7 (2). ISSN 1860-5974
Beyersdorff, O, Galesi, N and Lauria, M (2010) A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Information Processing Letters, 110 (23). 1074 - 1077 . ISSN 0020-0190
Beyersdorff, O (2010) The Deduction Theorem for Strong Propositional Proof Systems. Theory of Computing Systems, 47 (1). 162 - 178 . ISSN 1432-4350
Beyersdorff, O and Mueller, S (2010) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. ACM Transactions on Computational Logic, 11 (4). ISSN 1529-3785
Beyersdorff, O (2009) Comparing axiomatizations of free pseudospaces. Archive for Mathematical Logic, 48 (7). 625 - 641 . ISSN 0933-5846
Beyersdorff, O, Koebler, J and Messner, J (2009) Nondeterministic functions and the existence of optimal proof systems. Theoretical Computer Science, 410 (38-40). 3839 - 3855 . ISSN 0304-3975
Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The complexity of propositional implication. Information Processing Letters, 109 (18). 1071 - 1077 . ISSN 0020-0190
Beyersdorff, O (2009) On the correspondence between arithmetic theories and propositional proof systems - a survey. Mathamatical Logic Quarterly, 55 (2). 116 - 137 . ISSN 0942-5616
Beyersdorff, O (2008) Tuples of disjoint NP-sets. Theory of Computing Systems, 43 (2). 118 - 135 . ISSN 1432-4350
Beyersdorff, O (2007) Classes of representable disjoint NP-pairs. Theoretical Computer Science, 377 (1-3). 93 - 109 . ISSN 0304-3975
Book Section
Beyersdorff, O and Kutz, O (2012) Proof complexity of non-classical logics. In: Bezhanishvili, N and Goranko, V, (eds.) Lectures on Logic and Computation ESSLLI 2010 Copenhagen, Denmark, August 2010, ESSLLI 2011, Ljubljana, Slovenia, August 2011, Selected Lecture Notes. Lecture Notes in Computer Science, 7388 . Springer Verlag , 1 - 54 . ISBN 978-3-642-31484-1
Beyersdorff, O and Köbler, J (2006) Von der Turingmaschine zum Quantencomputer - ein Gang durch die Geschichte der Komplexitätstheorie. In: Freytag, J and Reisig, W, (eds.) Themen der Informatik im historischen Kontext. Springer . ISBN 978-3540327424
Proceedings Paper
Beyersdorff, O orcid.org/0000-0002-2870-1648, Hinde, L and Pich, J (2018) Reasons for Hardness in QBF Proof Systems. In: 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017). 37th IARCS Annual Conference (FSTTCS 2017), 11-15 Dec 2017, Kanpur, India. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 14:1-14:15. ISBN 978-3-95977-055-2
Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J and Hinde, L (2018) Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. In: Karlin, AR, (ed.) LIPIcs : Leibniz International Proceedings in Informatics. 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 11-14 Jan 2018, Cambridge, MA, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-060-6
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2018) Genuine Lower Bounds for QBF Expansion. In: Niedermeier, R and Vallee, B, (eds.) Leibniz International Proceedings in Informatics (LIPIcs). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 12:1-12:15. ISBN 978-3-95977-062-0
Blinkhorn, J and Beyersdorff, O orcid.org/0000-0002-2870-1648 (2017) Shortening QBF Proofs with Dependency Schemes. In: Theory and Applications of Satisfiability Testing – SAT 2017 (Lecture Notes in Computer Science). International Conference on Theory and Applications of Satisfiability Testing, 28 Aug - 01 Sep 2017, Melbourne, Australia. Springer Nature , pp. 263-280. ISBN 978-3-319-66262-6
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2016) Understanding Cutting Planes for QBFs. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 13-15 Dec 2016, Chennai, India. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing , pp. 1-15.
Beyersdorff, O orcid.org/0000-0002-2870-1648, Creignou, N, Egly, U et al. (1 more author) (2016) Report from Dagstuhl Seminar 16381: SAT and Interactions. In: Dagstuhl Reports. Dagstuhl Seminar 16381, SAT and Interactions, 18-23 Sep 2016. Dagstuhl Publishing , pp. 74-93.
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2016) Dependency Schemes in QBF Calculi: Semantics and Soundness. In: Principles and Practice of Constraint Programming: Proceedings. 22nd International Conference (CP 2016), 05-09 Sep 2016, Toulouse, France. Lecture Notes in Computer Science (9892). Springer International Publishing , Cham, Switzerland , pp. 96-112. ISBN 978-3-319-44952-4
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Pich, J (2016) Understanding Gentzen and Frege Systems for QBF. In: LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 05-08 Jul 2016, New York, NY, USA. ACM , pp. 146-155. ISBN 978-1-4503-4391-6
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Schmidt, RA et al. (1 more author) (2016) Lifting QBF Resolution Calculi to DQBF. In: Theory and Applications of Satisfiability Testing – SAT 2016 ( Lecture Notes in Computer Science ). 19th International Conference on Theory and Applications of Satisfiability Testing, 05-08 Jul 2016, Bordeaux, France. Springer Verlag , pp. 490-499. ISBN 978-3-319-40969-6
Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2016) Are Short Proofs Narrow? QBF Resolution is not Simple. In: Ollinger, N and Vollmer, H, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS'16). Symposium on Theoretical Aspects of Computer Science (STACS'16), 17-20 Feb 2016, Orleans, France. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-001-9
Beyersdorff, O, Bonacina, I and Chew, L (2016) Lower bounds: from circuits to QBF proof systems. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ITCS '16, 14-16 Jan 2016, Cambridge, Massachusetts, USA. ACM , pp. 249-260. ISBN 978-1-4503-4057-1
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Janota, M (2016) Extension Variables in QBF Resolution. In: AAAI Workshop: Beyond NP. AAAI-16 workshop on Beyond NP, 12-13 Feb 2016, Phoenix, Arizona USA. Association for the Advancement of Artificial Intelligence .
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2015) Feasible interpolation for QBF resolution calculi. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15). 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 06-10 Jul 2015, Kyoto, Japan. Springer Verlag , pp. 180-192.
Beyersdorff, O, Chew, L and Janota, M (2015) Proof complexity of resolution-based QBF calculi. In: LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15). 32nd International Symposium on Theoretical Aspects of Computer Science, 04 Mar 2015. Schloss Dagstuhl - Leibniz International Proceedings in Informatics , 76 - 89. ISBN 9783939897781
Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2015) A game characterisation of tree-like Q-resolution size. In: Dediou, A-H, Formenti, E, Martín-Vide, C and Truthe, B, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. LATA'15, 02-06 Mar 2015, Nice, France. Springer , pp. 486-498. ISBN 978-3-319-15579-1
Beyersdorff, O orcid.org/0000-0002-2870-1648 and Chew, L (2014) The complexity of theorem proving in circumscription and minimal entailment. In: Demri, S, Kapur, D and Weidenbach, C, (eds.) Automated Reasoning 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. 7th International Joint Conference, IJCAR 2014, 19-22 Jul 2014, Vienna, Austria. Lecture Notes in Computer Science , 8562 L . Springer , pp. 403-417. ISBN 978-3-319-08586-9
Beyersdorff, O, Chew, L and Janota, M (2014) On unification of QBF resolution-based calculi. In: Csuhaj-Varjú, E, Dietzfelbinger, M and Ésik, Z, (eds.) Mathematical Foundations of Computer Science 2014 39th International Symposium, MFCS 2014, Part II, Proceedings. 39th International Symposium, MFCS 2014, 25-29 Aug 2014, Budapest, Hungary. Springer , 81 - 93. ISBN 978-3-662-44464-1
Beyersdorff, O and Kullmann, O (2014) Unified characterisations of resolution hardness measures. In: Sinz, C and Egly, U, (eds.) Theory and Applications of Satisfiability Testing – SAT 2014 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. 17th International Conference, Held as Part of the Vienna Summer of Logic, 14-17 Jul 2014, Vienna, Austria. Lecture Notes in Computer Science , 8561 L . Springer , 170 - 187.
Beyersdorff, O (2013) The complexity of theorem proving in autoepistemic logic. In: Järvisalo, M and Van Gelder, A, (eds.) Theory and Applications of Satisfiability Testing – SAT 2013, 16th International Conference, Proceedings. SAT 2013, 16th International Conference on Theory and Applications of Satisfiability Testing, 08-12 Jul 2013, Helsinki, Finland. Springer , 365 - 376.
Beyersdorff, O, Galesi, N, Lauria, M et al. (1 more author) (2011) Parameterized bounded-depth Frege is not optimal. In: Aceto, L, Henzinger, M and Sgall, J, (eds.) Automata, languages and programmes, proceedings ICALP. ICALP 2011, 04-08 Jul 2011, Zurich, Switzerland. Lecture Notes in Computer Science, 6755 (Part 1). Springer Verlag , 630 - 641 . ISBN 978-3-642-22005-0
Beyersdorff, O, Galesi, N and Lauria, M (2011) Parameterized complexity of DPLL search procedures. In: Sakallah, KA and Simon, L, (eds.) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011, 19-22 Jun 2011, Ann Arbor, MI, USA. Springer Verlag , 5 - 18 . ISBN 978-3-642-21580-3
Beyersdorff, O, Vollmer, H, Datta, S et al. (4 more authors) (2011) Verifying proofs in constant depth. In: Proceedings MFCS 2011. Mathematical Foundations of Computer Science 2011, 22-26 Aug 2011, Warsaw, Poland. Springer Verlag , 84 - 95 . ISBN 978-3-642-22992-3
Beyersdorff, O and Mueller, S (2010) Different Approaches to Proof Systems. In: Kratochvil, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Proceedings. 7th Annual Conference, TAMC 2010, 07-11 Jun 2010, Prague, Czech Republic. Springer Verlag , 50 - 59 . ISBN 978-3-642-13561-3
Beyersdorff, O (2010) Proof Complexity of Non-classical Logics. In: Kratochvíl, J, Li, A, Fiala, J and Kolman, P, (eds.) Theory and Applications of Models of Computation7th Annual Conference, TAMC 2010, Proceedings. Theory and Applications of Models of Computation, 7th Conference, 07-11 Jun 2010, Prague, Czech Republic. Lecture Notes in Computer Science, 108 (6). Springer , 15 - 27 . ISBN 978-3-642-13561-3
Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2010) Proof Complexity of Propositional Default Logic. In: Strichman, O and Szeider, S, (eds.) Theory and applications of satisfiability testing. SAT 2010, 11-14 Jul 2010, Edinburgh, UK. Lecture notes in computer science, 6175 . Springer Verlag , 30 - 43 . ISBN 978-3-642-14185-0
Beyersdorff, O and Nebesov, Y (2009) Edges as Nodes - a New Approach to Timetable Information. In: ATMOS 2009. Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS), 10 September 2009, University of Cophenhagen, Denmark. Dagstuhl Research Online Publication Server (DROPS) . ISBN 978-3-939897-11-8
Beyersdorff, O and Sadowski, Z (2009) Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. In: Frid, AE, Morozov, A, Rybalchenko, A and Wagner, KW, (eds.) CSR. UNSPECIFIED. Springer , 47 - 58 . ISBN 978-3-642-03350-6
Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The Complexity of Reasoning for Fragments of Default Logic. In: Theory and Applications of Satisfiability Testing 2009. 12th International Conference, SAT 2009, 30 Jun - 03 Jul 2009, Swansea. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 51 - 64 . ISBN 978-3-642-02776-5
Beyersdorff, O and Mueller, S (2009) Does Advice Help to Prove Propositional Tautologies? In: Kullmann, O, (ed.) Theory and Applications of Satisfiability Testing SAT 2009. 12th International Conference, SAT 2009, 30 Jun - 03 Jul 2009, Swansea, UK. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 65 - 72 . ISBN 978-3-642-02776-5
Beyersdorff, O, Meier, A, Thomas, M et al. (3 more authors) (2009) Model Checking CTL is Almost Always Inherently Sequential. In: Lutz, C and Raskin, J-F, (eds.) 16th International Symposium on Temporal Representation and Reasoning 2009. International Symposium on Temporal Representation and Reasoning, 23-25 Jul 2009, Bressanone, Brixen, Italy. IEEE , 21 - 28 . ISBN 978-0-7695-3727-6
Beyersdorff, O, Koebler, J and Mueller, S (2009) Nondeterministic Instance Complexity and Proof Systems with Advice. In: Dediu, AH, Ionescu, AM and Martin-Vide, C, (eds.) Language and Automata Theory and Applications. Third International Conference, LATA 2009, 02-08 Apr 2009, Tarragona, Spain. Lecture Notes in Computer Science, 5457 . Springer Verlag , 164 - 175 . ISBN 978-3-642-00981-5
Beyersdorff, O (2009) On the existence of complete disjoint NP-pairs. In: SYNASC 2009 - 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. 11th International Symposium on Symbolic & Numeric Algorithms for Scientific Computing, 26-29 Sep 2009, Timisoara, Romania. IEEE , 282 - 289 . ISBN 978-1-4244-5910-0
Beyersdorff, O (2008) Logical closure properties of propositional proof systems - (Extended abstract). In: Agrawal, M, Du, D, Duan, Z and Li, A, (eds.) Theory and Applications of Models of Computation. 5th International Conference on Theory and Applications of Models of Computation, 25-28 Apr 2009, Xi'an, China. Lecture Notes in Computer Science, 4978 (Lectur). Springer Verlag , Germany , 318 - 329 . ISBN 978-3-540-79227-7
Beyersdorff, O and Mueller, S (2008) A Tight Karp-Lipton Collapse Result in Bounded Arithmetic. In: Kaminiski, M and Martini, S, (eds.) Proceedings of Computer Science Logic. 17th Annual Conference of the EACSL, 16-19 Sep 2008, Bertinoro, Italy. Lecture Notes in Computer Science, 5213 . Springer Verlag , 199 - 214 . ISBN 978-3-540-87530-7
Beyersdorff, O (2007) The deduction theorem for strong propositional proof systems. In: Arvind, V and Prasad, S, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Foundations of software technology and theoretical computer science, 12-14 Dec 2007, New Delhi, India. Lecture Notes in Computer Science, 4855 . Springer Verlag , 241 - 252 .
Beyersdorff, O (2006) Disjoint NP-pairs from propositional proof systems. In: Cai, J, Cooper, SB and Li, A, (eds.) Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Proceedings. Third International Conference, TAMC, 15-20 May 2006, Bejing, China. Lecture Notes in Computer Science, 3959 . Springer Verlag , 236 - 247 . ISBN 3-540-34021-1
Beyersdorff, O (2006) Tuples of disjoint NP-sets. In: Grigoriev, D, Harrison, J and Hirsch, EA, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). First International Computer Science Symposium in Russia, 08-12 Jun 2006, St Petersburg, Russia. Lecture Notes in Computer Science, Lectur (3967). Springer Verlag , 80 - 91 .
Beyersdorff, O (2004) Representable Disjoint NP-Pairs. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. FSTITCS 2004, 16-18 Dec 2004, Chennai, India. Springer Verlag , 122 - 134 . ISBN 3-540-24058-6
Book
Beyersdorff, O (2012) Non-classical Aspects in Proof Complexity. Cuvillier Verlag , Göttingen . ISBN 9783954040360