LICS 2023 Accepted Papers
Embedded Finite Models beyond Restricted Quantifier Collapse
Boolean symmetric vs. functional PCSP dichotomy
The Identity Problem in the special affine group of $\mathbb{Z}^2$
Orbit-finite linear programming
Fixed Point Logics on Hemimetric Spaces
Taylor Expansion as a Monad in Models of DiLL
Making Concurrency Functional
The Cartesian Closed Bicategory of Thin Spans of Groupoids
From Thin Concurrent Games to Generalized Species of Structures
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations
Z-polyregular functions
The Descriptive Complexity of Graph Neural Networks
Distal combinatorial tools for graphs of bounded twin-width
Fixpoint operators for 2-categorical structures
Extensional and Non-extensional Functions as Processes
Reachability in Injective Piecewise Affine Maps
Verifying linear temporal specifications of constant-rate multi-mode systems
Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields
Complete Graphical Language for Hermiticity-Preserving Superoperators
A Complete Equational Theory for Quantum Circuits
The Iteration Number of the Weisfeiler-Leman Algorithm
Evidential Decision Theory via Partial Markov Categories
Minimization of Dynamical Systems over Monoids
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Queries on Unranked Trees
Intuitionistic S4 is decidable
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
Formalizing $\pi_4(S^3) \cong Z/2Z$ and Computing a Brunerie Number in Cubical Agda
The Logic of Prefixes and Suffixes is Elementary under Homogeneity
Cartesian Coherent Differential Categories
Pseudorandom Finite Models
The Probabilistic Rabin Tree Theorem
Group separation strikes back
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
Cut-restriction: from cuts to analytic cuts
Set-Theoretic and Type-Theoretic Ordinals Coincide
Allegories of Symbolic Manipulation
Automatic Amortized Resource Analysis with Regular Recursive Types
On Exact Sampling in the Two-Variable Fragment of First-Order Logic
Quantifying over Trees in Monadic Second-Order Logic
Folding interpretations
Symmetries of graphs and structures that fail to interpret a finite thing
Operational Algorithmic Game Semantics
Stochastic Best-Effort Strategies for Borel Goals
On the growth rates of polyregular functions
Higher-dimensional subdiagram matching
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
PDL on Steroids
The Power of Positivity
A categorical account of composition methods in logic
Simulating Logspace-Recursion with Logarithmic Quantifier Depth
Revisiting Membership Problems in Subclasses of Rational Relations
Multiplicity Problems on Algebraic Series and Context-Free Grammars
Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
Deterministic stream-sampling for probabilistic programming: semantics and verification
Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives
Computational expressivity of (circular) proofs with fixed points
Weak Similarity in Higher-Order Mathematical Operational Semantics
Simplicial Set Models for Distributed Knowledge
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs
A metalanguage for cost-aware denotational semantics
Fully Abstract Normal Form Bisimulation for PCF
LICS Sponsorship
The symposium is sponsored by ACM SIGLOG, the IEEE Technical Committee on Mathematical Foundations of Computing, the Boston University Rafik B. Hariri Institute for Computing and Computational Science & Engineering, the Boston University College of Arts & Sciences, and the Boston University Department of Computer Science.
Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.