WoLLIC 2025 @ Porto.

31^st Workshop on Logic, Language, Information and Computation
14 - 17 July 2025

WoLLIC is an annual international forum on interdisciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The 31^st WoLLIC will be held at the University of Porto, Portugal, 14-17 July 2025.

REGISTRATION

Registration is open here!

• Early registration (deadline is June 20):
  • Regular: 300 euros
  • Student: 250 euros
• Late registration:
  • Regular: 360 euros
  • Student: 310 euros

This includes the WoLLIC reception on 14 July, and the conference dinner on 16 July, as well as lunch and coffee breaks each day.

INVITED SPEAKERS

Tobias Kappé (Leiden University) On propositional program equivalence.

⮟ Show Abstract

Most programmers have an intuitive understanding of general equivalences between programs. For instance, the branches of an if-then-else block can be swapped, as long as its condition is negated --- regardless of what the branches or condition look like. Such propositional program equivalences are useful to verify that a refactoring operation preserves program semantics.

Kleene Algebra with Tests (KAT) has proven to be a very powerful framework for verifying propositional program equivalences, either through manual equational reasoning or by automated equivalence checking. In recent years, the focus has been on a deterministic fragment of KAT that models imperative programs very closely, known as Guarded KAT (GKAT). GKAT has a rich equational theory, which can be used to prove many useful equivalences between imperative programs. What's more, GKAT equivalences can be checked mechanically and efficiently.

We will survey recent advances surrounding GKAT. Topics discussed include both positive and negative results about GKAT's expressivity, logical completeness, extensions, and decision procedures, as well as connections to decompilation and a conjecture of Milner that was recently resolved.

This talk will cover joint work with Balder ten Cate, Justin Hsu, Nate Foster, Dexter Kozen, David E. Narváez, Nico Naus, Wojciech Różowski, Todd Schmid, Alexandra Silva, Steffen Smolka, and Cheng Zhang.

Daniela Petrişan (IRIF, Université de Paris) Functorial Mealy machines.

⮟ Show Abstract

We first recall a functorial framework for automata theory bridging the algebraic and coalgebraic approach. Various forms of automata can be seen as functors from an input category -- describing the structure of the input, e.g. words or trees -- to an output category -- describing the values produced by a run in such an automaton. For example, deterministic, nondeterministic, weighted automata or transducers over some input alphabet A can all be seen as automata with effects, or functors from the same input category (parametric on A) to some Kleisli category -- modelling the corresponding side-effect: the Kleisli category of the powerset monad for nondeterministic automata, vector spaces for weighted automata over a field, etc. The framework allows for generic minimization and learning algorithms and can be extended from automata over words to tree automata, by suitably modifying the input category. In the rest of the talk we focus on how to model, minimize and learn Mealy machines in this setting. We also discuss the relation with recent work on effectful Mealy machines by Bonchi et al.

PROGRAM

Click here for the Program.

ACCEPTED PAPERS

The list of accepted papers can be found here.

FORMAT

WoLLIC 2025 will be an onsite event.

ORGANIZATION

• Department of Computer Science, Faculty of Sciences, University of Porto, Portugal
• Center of Informatics, Federal University of Pernambuco, Brazil

SCOPE

Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are:

• non-classical logics;
• foundations of computing, programming and Artificial Intelligence (AI);
• novel computation models and paradigms;
• broad notions of proof and belief;
• proof mining, type theory, effective learnability and explainable AI;
• formal methods in software and hardware development;
• logical approach to natural language and reasoning;
• logics of programs, actions and resources;
• foundational aspects of information organization, search, flow, sharing and protection;
• foundations of mathematics;
• philosophical logic;
• and philosophy of language.

PROCEEDINGS

The proceedings of WoLLIC 2025, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer’s LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as special post-conference WoLLIC 2025 issue of a scientific journal (TBC).

STUDENT GRANTS

ASL sponsorship of WoLLIC 2025 will permit ASL student members to apply for a modest travel grant. The deadline is 90 days before the event starts. See this page for details.

IMPORTANT DATES

SUBMISSIONS

Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see author’s instructions here). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper’s main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors in person. (At least one author is required to pay a full, on-site registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2025 EasyChair website.

SCIENTIFIC SPONSORSHIP

• Interest Group in Pure and Applied Logics (IGPL)
• The Association for Logic, Language and Information (FoLLI)
• Association for Symbolic Logic (ASL)
• European Association for Theoretical Computer Science (EATCS)
• European Association for Computer Science Logic (EACSL)
• Sociedade Brasileira de Lógica (SBL)
• Sociedade Portuguesa de Lógica (SPL)