- 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.
- 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.
- Claudio Antares Mezzina, Francesco Tiezzi 0001, Nobuko Yoshida. Checkpoint-based rollback recovery in session programming. Logical Methods in Computer Science, 21(1):2, 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.
- Adam D. Barwell, Ping Hou, Nobuko Yoshida, Fangyi Zhou 0002. Crash-Stop Failures in Asynchronous Multiparty Session Types. Logical Methods in Computer Science, 21(2), 2025.
- Thomas Feller 0001, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph. Decidability of Querying First-Order Theories via Countermodels of Finite Width. Logical Methods in Computer Science, 21(2), 2025.
- Mario Román, Pawel Sobocinski 0001. String Diagrams for Premonoidal Categories. Logical Methods in Computer Science, 21(2), 2025.