The EACSL was founded on July 14th 1992, by computer scientists and logicians from 14 countries. The Association acts as an international professional non-profit organization.
Computer science logic is an interdisciplinary field between mathematical logic and computer science. The EACSL promotes computer science logic in the areas of scientific research and education. It supports both basic and application oriented research. The association also intends to advance the connections between basic research and industrial applications.
Each year the Association organizes the Conference on Computer Science Logic (CSL) and grants the Ackermann Award, for outstanding dissertations in Logic in Computer Science.
News:
Ackermann Award 2026
The Ackermann Award 2026 The Ackermann Award 2026 is bestowed on Keya Prakash for the thesis History-Deterministic Parity Automata: Games, Complexity, and the 2-Token Theorem, supervised by Marcin Jurdzinski at the University of Warwick (UK), and Axel Ljungström for the thesis Synthetic approaches to cohomology, homology and homotopy, supervised by Anders Mörtberg at the University of Stockholm (Sweden), respectively. A detailed report is published in the CSL 2027 proceedings. More information here.The 2026 Alonzo Church Award for Outstanding Contributions to Logic and Computation
The European Association for Computer Science Logic (EACSL), the European Association for Theoretical Computer Science (EATCS), and the ACM Special Interest Group for Logic and Computation (SIGLOG) are pleased to announce that the 2026 Alonzo Church Award for Outstanding Contributions to Logic and Computation is presented to
Pablo Barceló, Leonid Libkin, Wim Martens, Juan Reutter, Miguel Romero, Moshe Vardi, Domagoj Vrgoč
for laying foundations of logical languages for querying property graphs that found adoption in the SQL and GQL international standards within a decade.
- Leonid Libkin, Wim Martens, Domagoj Vrgoc, Querying Graphs with Data, Journal of the ACM, Volume 63, Issue 2, pages 1–53, 2016.
- Juan Reutter, Miguel Romero, Moshe Vardi, Regular Queries on Graph Databases, Theory of Computing Systems, Volume 61, Issue 1, pages 31–83.
- Pablo Barcelo, Leonid Libkin, Juan Reutter, Querying Regular Graph Patterns, Journal of the ACM, Volume 61, Issue 1, pages 1–54, 2014.
Ackermann Award 2025
The Ackermann Award 2025
The Ackermann Award 2025 is bestowed on Toghrul Karimov for the thesis Algorithmic Verification of Linear Dynamical Systems, supervised by Joël Ouaknine at the Saarland University (Germany), and Nikolas Mählmann for the thesis Monadically Stable and Monadically Dependent Graph Classes: Characterizations and Algorithmic Meta-Theorems supervised by Sebastian Siebertz at the University of Bremen (Germany), respectively. A detailed report is published in the CSL 2026 proceedings. More information here.
Statement about the war in Ukraine
The European Association for Computer Science Logic (EACSL), represented by its board, expresses great sorrow and concern for the war in Ukraine and the attack on the freedom and peace of its population. It condemns the illegal and brutal invasion of Ukraine by the Russian Federation.
EACSL supports the values of peaceful and harmonious coexistence of people building towards universal scientific knowledge. To this aim, we believe that geopolitical divergences among nations should uniquely be resolved through the legitimate means of international diplomacy and that the violent invasion of a sovereign nation and its consequences on the population are never acceptable.
We join the expression of concern of academic and scientific institutions around the world for the suffering imposed on the Ukrainian population. We support all Ukranian scientific institutions and researchers and also those Russian citizens and members of the scientific community who are opposing the military aggression pursued by their own country.
EACSL will do all it can to financially support Ukranian researchers and researchers working in Ukraine to enable them to attend EACSL conferences and workshops.