Conference

Submission guidelines

Submitted papers must be in English and must provide sufficient detail to allow the Program Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers’ discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC.

The papers should be submitted via easychair.

The conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs).

Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal.

Papers authored or co-authored by members of the PC are not allowed.

At least one of the authors of each accepted paper is expected to register for the conference and attend it in person or online, in order to present their papers.

List of topics

  • automated deduction and interactive theorem proving
  • constructive mathematics and type theory
  • equational logic and term rewriting
  • automata and games, game semantics
  • modal and temporal logic
  • model checking
  • decision procedures
  • logical aspects of computational complexity
  • finite model theory
  • computational proof theory
  • logic programming and constraints
  • lambda calculus and combinatory logic
  • domain theory
  • categorical logic and topological semantics
  • database theory
  • specification, extraction and transformation of programs
  • logical aspects of quantum computing
  • logical foundations of programming paradigms
  • verification and program analysis
  • linear logic
  • higher-order logic
  • nonmonotonic reasoning

Helena Rasiowa award

The Helena Rasiowa Award is the best student paper award for the CSL conference series, starting from CSL 2022. The award will be given to the best paper (as decided by the PC) written solely by students or for which students were the main contributors. A student in this context is any person who is currently studying for a degree or whose PhD award date is less than one year prior to the first day of the conference.

Read more about the contribution of Helena Rasiowa to logic and computer science, and their interplay, here.

The name is Polish, but exceptionally not so difficult to pronounce.

Invited speakers

Program committee

Matteo Acclavio (University of Luxembourg, Luxembourg)
Patricia Bouyer-Decitre (LSV, CNRS & ENS Paris-Saclay, France)
Agata Ciabattoni (TU Wien, Austria)
Diana Costa (University of Lisbon, Portugal)
Alejandro Díaz-Caro (Univ. N. de Quilmes & CONICET-Univ. de Buenos Aires, Argentina)
Martín Escardó (University of Birmingham, UK)
Rajeev Goré (The Australian National University, Australia)
Giulio Guerrieri (Huawei Edinburgh Research Centre, UK)
Shin-ya Katsumata (National Institute of Informatics, Japan)
Delia Kesner (Université Paris Cité, France)
Sandra Kiefer (Max Planck Institute for Software Systems, Germany)
Bartek Klin (University of Oxford, UK, co-chair)
Naoki Kobayashi (The University of Tokyo, Japan)
Stepan Kuznetsov (Steklov Mathematical Institute of RAS, Russia)
Martin Lück (Leibniz Universität Hannover, Germany)
Meena Mahajan (The Institute of Mathematical Sciences, HBNI, India)
Filip Murlak (University of Warsaw, Poland)
Daniele Nantes (University of Brasília, Brazil)
Elaine Pimentel (UCL, UK, co-chair)
Paolo Pistone (University of Bologna, Italy)
Ana Sokolova (University of Salzburg, Austria)
Lutz Straßburger (Inria Saclay – Île-de-France, France)
Pascal Schweitzer (TU Darmstadt, Germany)
Martin Zimmermann (Aalborg University, Denmark)
Yoni Zohar (Bar Ilan University, Israel)

Previous editions

CSL 2022, CSL 2021, CSL 2020

Accepted papers

  • Hiromi Tanaka. Tower-Complete Problems in Contraction-Free Substructural Logics
  • Émile Hazard and Denis Kuperberg. Explorable Automata
  • Benedikt Pago. Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
  • Paul Wilson, Dan Ghica and Fabio Zanasi. String diagrams for non-strict monoidal categories
  • Julien Grange. Order-Invariance in the Two-Variable Fragment of First-Order Logic
  • Pablo Barenbaum and Eduardo Bonelli. Reductions in Higher-Order Rewriting and Their Equivalence
  • Thiago Felicissimo, Frédéric Blanqui and Ashish Kumar Barnawal. Translating proofs from an impredicative type system to a predicative one
  • Dominik Kirst and Benjamin Peters. Gödel’s Theorem Without Tears: Essential Incompleteness in Synthetic Computability
  • Ian Pratt-Hartmann and Lidia Tendera. Adding Transitivity and Counting to the Fluted Fragment
  • Paolo Baldan, Richard Eggert, Barbara König and Tommaso Padoan. A Lattice-Theoretical View of Strategy Iteration
  • Yannick Forster and Felix Jahn. Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-one and Truth-table Reducibility in Coq
  • Nikolay Bazhenov and Dariusz Kalociński. Degree spectra, and relative acceptability of notations
  • Thorsten Wißmann. Supported Sets – A New Foundation For Nominal Sets And Automata
  • Luigi Santocanale and Cédric de Lacroix. Frobenius structures in star-autonomous categories
  • Reijo Jaakkola. Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability
  • Harsh Beohar, Sebastian Gurke, Barbara König and Karla Messing. Hennessy-Milner Theorems via Galois Connections
  • Bart Jacobs and Dario Stein. Counting and Matching
  • Ugo Dal Lago, Francesco Gavazzo and Alexis Ghyselen. Open Higher-Order Logic
  • Renaud Vilmart. Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Framents of Quantum Computation
  • Gianluca Curzi and Anupam Das. Non-uniform complexity via non-wellfounded proofs
  • Lauri Hella. The expressive power of CSP-quantifiers
  • Pablo Barenbaum and Teodoro Freund. Proofs and Refutations for Intuitionistic and Second-Order Logic
  • Konrad Staniszewski. Parity Games of Bounded Tree-Depth
  • Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder and Paul Wild. Quantitative Hennessy-Milner Theorems via Notions of Density
  • Corina Cirstea and Clemens Kupke. Measure-Theoretic Semantics for Quantitative Parity Automata
  • Mario Alvarez-Picallo, Dan Ghica, David Sprunger and Fabio Zanasi. Functorial String Diagrams for Reverse-Mode Automatic Differentiation
  • Bahareh Afshari, Graham Leigh and Guillermo Menéndez Turata. A Cyclic Proof System for Full Computation Tree Logic
  • Dana Fisman, Joshua Grogin and Gera Weiss. A Normalized Edit Distance on Infinite Words
  • Reijo Jaakkola and Antti Kuusisto. Complexity classifications via algebraic logic
  • Liron Cohen and Vincent Rahli. Realizing Continuity Using Stateful Computations
  • Kostia Chardonnet, Alexis Saurin and Benoît Valiron. A Curry-Howard Correspondence for Linear, Reversible Computation
  • Ahmet Kara, Milos Nikolic, Dan Olteanu and Haozhe Zhang. Evaluation Trade-Offs for Acyclic Conjunctive Queries
  • Felix Tschirbs, Nils Vortmeier and Thomas Zeume. Dynamic Complexity of Regular Languages: Big changes, small work
  • Chris Barrett, Willem Heijltjes and Guy McCusker. The Functional Machine Calculus II: Semantics
Get in Touch