LICS 2023 Accepted Papers
Michael Benedikt and Ehud Hrushovski. Embedded Finite Models beyond Restricted Quantifier Collapse
Tamio-Vesa Nakajima and Stanislav Živný. Boolean symmetric vs. functional PCSP dichotomy Ruiwen Dong. The Identity Problem in the special affine group of $\mathbb{Z}^2$ Arka Ghosh, Piotr Hofman and Sławomir Lasota. Orbit-finite linear programming David Fernández-Duque and Quentin Gougeon. Fixed Point Logics on Hemimetric Spaces Yoshiki Nakamura. Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
Martin Grohe. The Descriptive Complexity of Graph Neural Networks Zeinab Galal. Fixpoint operators for 2-categorical structures
Ken Sakayori and Davide Sangiorgi. Extensional and Non-extensional Functions as Processes
Boldizsár Poór, Quanlong Wang, Razin Shaikh, Lia Yeh, Richie Yeung and Bob Coecke. Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Jason Bell and Daniel Smertnig. Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields Renaud Vilmart, Titouan Carette, Timothée Hoffreumon and Émile Larroque. Complete Graphical Language for Hermiticity-Preserving Superoperators Martin Grohe, Moritz Lichter and Daniel Neuen. The Iteration Number of the Weisfeiler-Leman Algorithm Elena Di Lavore and Mario Román. Evidential Decision Theory via Partial Markov Categories Jelle Hellings, Marc Gyssens, Jan Van den Bussche and Dirk Van Gucht. Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Queries on Unranked Trees Axel Ljungström and Anders Mörtberg. Formalizing $\pi_4(S^3) \cong Z/2Z$ and Computing a Brunerie Number in Cubical Agda Dario Della Monica, Angelo Montanari, Gabriele Puppis and Pietro Sala. The Logic of Prefixes and Suffixes is Elementary under Homogeneity
Aymeric Walch and Thomas Ehrhard. Cartesian Coherent Differential Categories David Baelde, Adrien Koutsos and Joseph Lallemand. A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
Francesco Gavazzo. Allegories of Symbolic Manipulation
Mikołaj Bojańczyk. Folding interpretations
Benedict Bunting and Andrzej Murawski. Operational Algorithmic Game Semantics
Mikołaj Bojańczyk. On the growth rates of polyregular functions
Steffen van Bergerem, Martin Grohe, Sandra Kiefer and Luca Oeljeklaus. Simulating Logspace-Recursion with Logarithmic Quantifier Depth
Pascal Bergsträßer and Moses Ganardi. Revisiting Membership Problems in Subclasses of Rational Relations Titouan Carette, Louis Lemonnier and Vladimir Zamdzhiev. Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages Tobias Winkler and Joost-Pieter Katoen. On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata Jan Kretinsky, Tobias Meggendorfer and Maximilian Weininger. Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives Yue Niu and Robert Harper. A metalanguage for cost-aware denotational semantics
Nikos Tzevelekos, Vasileios Koutavas and Yu-Yang Lin. Fully Abstract Normal Form Bisimulation for PCF