LICS 2024 Accepted Papers
Victor Dalmau and Jakub Opršal. Local consistency as a reduction between constraint satisfaction problems Manuel Bodirsky, Žaneta Semanišinová and Carsten Lutz. The Complexity of Resilience Problems via Valued Constraint Satisfaction Problems
Demian Banakh and Marcin Kozik. Injective hardness condition for PCSPs
Libor Barto, Silvia Butti, Alexandr Kazda, Caterina Viola and Stanislav Živný. Algebraic Approach to Approximation Miroslav Chodil and Antonin Kucera. The Finite Satisfiability Problem for PCTL is Undecidable Kirstin Peters and Nobuko Yoshida. Separation and Encodability in Mixed Choice Multiparty Sessions Udi Boker. Discounted-Sum Automata with Real-Valued Discount Factors Chris Barrett, Willem Heijltjes and Daniel Castle. The Relational Machine Calculus
Martin Grohe and Eran Rosenbluth. Are Targeted Messages More Effective? Oskar Fiuk, Emanuel Kieronski and Vincent Michielini. On the complexity of Maslov’s class K Masahito Hasegawa and Serge Lechenne. Braids, Twists, Trace and Duality in Combinatory Algebras Cameron Allett. Non-Elementary Compression of First-Order Proofs in Deep Inference Using Epsilon-Terms Eric Finster, Alex Rice and Jamie Vicary. A Syntax for Strictly Associative and Unital ∞-Categories Vasileios Koutavas, Yu-Yang Lin and Nikos Tzevelekos. Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence Maximilian Pflueger, Johannes Marti and Egor V. Kostylev. A Characterisation Theorem for Two-Way Bisimulation-Invariant Monadic Least Fixpoint Logic Over Finite Structures
Zeinab Galal and Jean-Simon Pacaud Lemay. Combining fixpoint and differentiation theory
Benedict Bunting and Andrzej Murawski. Contextual Equivalence for State and Control via Nested Data Bharat Adsul, Paul Gastin, Shantanu Kulkarni and Pascal Weil. An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications
Piotr Ostropolski-Nalewaja and Tim Lyon. Decidability of Quasi-Dense Modal Logics Tal Hershko and Maksim Zhukovskii. First order distinguishability of sparse random graphs
Nadim Kasymov, Nadira Karimova and Bakh Khoussainov. Defining algorithmically presented structures in first order logic Noah Abou El Wafa and André Platzer. Complete Game Logic with Sabotage Sandra Kiefer and Daniel Neuen. Bounding the Weisfeiler--Leman Dimension via a Depth-Analysis of I/R-Trees
James Hefford and Matt Wilson. A Profunctorial Semantics for Quantum Supermaps Harry Vinall-Smeeth. From Quantifier Depth to Quantifier Number: Separating Structures with k Variables Danila Demin and Maksim Zhukovskii. First order complexity of finite random structures
Christian Sattler and David Wärn. Natural numbers from integers Victor Blanchi and Hugo Paquet. Element-free probability distributions and random partitions Alex Simpson. Equivalence and Conditional Independence in Atomic Sheaf Logic
John Li, Jon Aytac, Philip Johnson-Freyd, Amal Ahmed and Steven Holtzen. A Nominal Approach to Probabilistic Separation Logic Mayuko Kori, Kazuki Watanabe, Jurriaan Rot and Shin-Ya Katsumata. Composing Codensity Bisimulations