- Ahmet Kara 0002, Milos Nikolic 0001, Dan Olteanu, Haozhe Zhang 0001. Conjunctive Queries with Free Access Patterns under Updates. Logical Methods in Computer Science, 21(2), 2025.
- Laure Daviaud, David Purser, Marie Tcheng. The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). Logical Methods in Computer Science, 21(3), 2025.
- Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç. Safety and Liveness of Quantitative Properties and Automata. Logical Methods in Computer Science, 21(2), 2025.
- Stéphane Demri, Karin Quaas. Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. Logical Methods in Computer Science, 21(2), 2025.
- Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp. Left-Linear Completion with AC Axioms. Logical Methods in Computer Science, 21(2), 2025.
- Bartosz Bednarczyk, Julien Grange. About the Expressive Power and Complexity of Order-Invariance with Two Variables. Logical Methods in Computer Science, 21(1), 2025.
- Pierre Hyvernat. Totality for Mixed Inductive and Coinductive Types. Logical Methods in Computer Science, 21(3), 2025.
- Claudio Antares Mezzina, Francesco Tiezzi 0001, Nobuko Yoshida. Checkpoint-based rollback recovery in session programming. Logical Methods in Computer Science, 21(1):2, 2025.
- Orna Kupferman, Ofer Leshkowitz, Namma Shamash Halevy. Synthesis with Privacy Against an Observer. Logical Methods in Computer Science, 21(3), 2025.
- Martin Fränzle, Paul Kröger, Sarah Winter, Martin Zimmermann 0002. On the Existence of Reactive Strategies Resilient to Delay. Logical Methods in Computer Science, 21(1), 2025.