[Proof Complexity] Workshop on Proof Complexity at FLoC in Lisbon -- 2nd call for presentations

[Olaf Beyersdorff]

FLoC workshop on proof complexity - Call for Presentations
----------------------------------------------------------

Lisbon, 18/19 July 2026
https://proofcomplexityworkshop.gitpages.uni-jena.de

The workshop will be part of FLoC (https://www.floc26.org) and affiliated with the conference SAT'26 (https://satisfiability.org/SAT26/).


=== Important Dates ===

15 May 2026 ........ Abstract submission
20 May 2026 ........ Notification to authors
1 June 2026 ........ Early registration deadline
18-19 July 2026 .... Workshop in Lisbon

=== Scope ===

Proof complexity is the study of the complexity of theorem proving procedures. The central question in proof complexity is: given a theorem F (e.g. a propositional tautology) and a proof system P (i.e., a formalism usually comprised of axioms and rules), what is the size of the smallest proof of F in the system P?  Moreover, how difficult is it to construct a small proof? Many ingenious techniques have been developed to try to answer these questions, which bare tight relations to intricate theoretical open problems from computational complexity (such as the celebrated P vs. NP problem), mathematical logic (e.g. separating theories of Bounded Arithmetic) as well as to practical problems in SAT solving.

=== Invited Speakers ===

Noah Fleming (University of Lund)
Jan Pich (University of Oxford)
Benjamin Böhm (University of Jena): invited speaker in the joint session with the QBF workshop
Dmitry Sokolov (University of Montreal)

=== Submissions ===

We welcome 1-2-page abstracts presenting (finished, ongoing, or if clearly stated even recently published) work on proof complexity. Particular topics of interest are

 *  Proof Complexity
 *  Bounded Arithmetic
 *  Relations to SAT solving
 *  Relations to Computational Complexity

=== Joint session with the QBF Workshop ===

As part of the workshop we plan a joint session with the International Workshop on Quantified Boolean Formulas and Beyond. Submissions on proof complexity of QBF (and other logics involving quantification) are very welcome.

=== Submission Guidelines ===

Abstracts are invited of ongoing, finished, or (if clearly stated) even recently published work on a topic relevant to the workshop. Abstracts (at most 2 pages) are to be submitted electronically in PDF via

https://submissions.floc26.org/pc/

Accepted communications must be presented at the workshop by one of the authors.

=== Student travel bursaries available ===

Bursaries for travel support will be available for students, who want to attend the workshop and combine this with a visit to SAT. Details will be announced on the SAT'26 websites in due time.


=== Organizers ===

Olaf Beyersdorff (University of Jena)
Massimo Lauria (Sapienza Rome)
Jan Johannsen (LMU Munich)

—
Professor Olaf Beyersdorff
Institute of Computer Science
University of Jena
Inselplatz 5, 07743 Jena, Germany
Phone: +49 (0)3641 946321
Email: olaf.beyersdorff at uni-jena.de
https://www.ti1.uni-jena.de