PC — PROGRAM

Days: Saturday, 18 July 2026 Sunday, 19 July 2026

Saturday, 18 July 2026
10:00-11:00 Coffee Break PC
Location: C5.09
11:00-11:40 Invited Talk 1 PC
Session Chair:
Olaf Beyersdorff
Location: C5.09
11:00-11:40
Limits of Lifting (abstract) 40 min
Jan Pich1
1 University of Oxford
11:40-12:00 Contributed Talks 1 PC
Session Chair:
Olaf Beyersdorff
Location: C5.09
11:40-12:00
Size-degree inequalities in Sherali-Adams and Sum-of-Squares made simple (abstract) 20 min
Ilario Bonacina1
1 Universitat Politecnica de Catalunya
12:00-14:00 Lunch PC
Location: C5.09
14:00-14:40 Invited Talk 2 PC
Session Chair:
Jan Johannsen
Location: C5.09
14:00-14:40
Lower Bounds via Friedman-Pippenger Technique (abstract) 40 min
Dmitry Sokolov1
1 EPFL, Lausanne
14:40-15:20 Contributed Talks 2 PC
Session Chair:
Jan Johannsen
Location: C5.09
14:40-15:00
Lower Bounds against the Ideal Proof System in Finite Fields (abstract) 20 min
Tal Elbaz1, Nashlen Govindasamy1, Jiaqi Lu1, Iddo Tzameret1
1 Imperial College London
15:00-15:20
Symmetric Proofs in the Ideal Proof System (abstract) 20 min
Anuj Dawar1
1 University of Cambridge
15:30-16:30 Coffee Break PC
Location: C5.09
16:30-17:30 Contributed Talks 3 PC
Session Chair:
Jan Johannsen
Location: C5.09
16:30-16:50
Cardinality Constraints are Hard for Resolution (abstract) 20 min
Ilario Bonacina1, Jordi Levy2, Ion Mikel Liberal2
1 Universitat Politecnica de Catalunya
2 IIIA-CSIC
16:50-17:10
Cutting Planes with Cover Cuts (abstract) 20 min
Jake Anderson1, Wietze Koops2, Massimo Lauria3, Marc Vinyals1
1 University of Auckland
2 Lund University and University of Copenhagen
3 Sapienza Università di Roma
17:10-17:30
Cardinality Cuts & Saturation (abstract) 20 min
Jake Anderson1, Marc Vinyals1, Massimo Lauria2, Wietze Koops3
1 University of Auckland
2 Sapienza Università di Roma
3 Lund University & University of Copenhagen
Sunday, 19 July 2026
09:20-10:00 Contributed Talks 4 PC
Session Chair:
Massimo Lauria
Location: C5.09
09:20-09:40
Toward a Characterization of Simulation Between Arithmetic Theories (abstract) 20 min
Hunter Monroe1
1 International Monetary Fund (retired)
09:40-10:00
Towards a positive version of Cook’s PV (abstract) 20 min
Adriana Baldacchino1, Anupam Das1
1 University of Birmingham
10:00-11:00 Coffee Break PC
Location: C5.09
11:00-11:40 Invited Talk 3 PC
Session Chair:
Massimo Lauria
Location: C5.09
11:00-11:40
Provable Reductions (abstract) 40 min
Noah Fleming1
1 Lund University
11:40-12:00 Contributed Talks 5 PC
Session Chair:
Massimo Lauria
Location: C5.09
11:40-12:00
Proof Systems Based on Structured Circuits (abstract) 20 min
Matthäus Micun1, Christoph Berkholz1
1 Technical University of Ilmenau
12:00-14:00 Lunch PC
Location: C5.09
14:00-14:40 QBF Joint Invited Talk PC
Session Chair:
Lea Kasche
Location: C5.09
14:00-14:40
The Complexity of Quantified CDCL (abstract) 40 min
Benjamin Böhm1
1 Friedrich Schiller University Jena
14:40-15:40 QBF Joint Contrib Talks 1 PC
Session Chair:
Lea Kasche
Location: C5.09
14:40-15:00
Quantified CDCL and Dependency Schemes: A proof-theoretic study (abstract) 20 min
Abhimanyu Choudhury1, Meena Mahajan1
1 IMSc Chennai
15:00-15:20
A Boolean static proof system for Quantified Boolean Formulas (abstract) 20 min
Jan Johannsen1, Marc Vinyals2
1 Ludwig-Maximilians-Universität München
2 University of Auckland
15:20-15:40
A QBF-like Fragment of EPR (abstract) 20 min
Leroy Chew1, Mikoláš Janota2, Martin Suda2, Miroslav Olšák3
1 TU Wien
2 CIIRC, Prague
3 Charles University, Prague
15:40-16:30 Coffee Break PC
Location: C5.09
16:30-16:50 QBF Joint Contrib Talks 2 PC
Location: C5.09
16:30-16:50
A Boolean static proof system for Quantified Boolean Formulas (abstract) 20 min
Jan Johannsen1, Marc Vinyals2
1 Ludwig-Maximilians-Universität München
2 University of Auckland
Designed and Developed by EventKey | Copyright 2026 EventKey Last updated:
🔍 ↑