LICS'19 Accepted Papers
The logic of action lattices is undecidable
Higher-Kinded Data Types: Syntax and Semantics
Learning Concepts Definable in First-Order Logic with Counting
Descriptive complexity for minimal time of cellular automata
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
Algorithmic barriers to representing conditional independence
Template games and differential linear logic
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
A Sequent Calculus for Opetopes
Describing free ω-categories
Model Comparison Games for Horn Description Logics
No-Go Theorems for Distributive Laws
HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories
Canonisation and Definability for Graphs of Bounded Rank Width
LambdaY-calculus with priorities
Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm
Categorical Semantics for Time Travel
Bisimulation Equivalence of First-Order Grammars is ACKERMANN -Complete
A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness
Point-width and Max-CSPs
Perspective Games
A type theory for cartesian closed bicategories
Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy
Quantum Hoare Logic with Ghost Variables
Matching mu-Logic
Realizability in the Unitary Sphere
Path Spaces of Higher Inductive Types in Homotopy Type Theory
Probabilistic Relational Reasoning via Metrics
Backprop as Functor: A compositional perspective on supervised learning
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
Graphical Affine Algebra
Lambda Calculus and Probabilistic Computation - A foundational approach
Long-run satisfaction of path properties
History-dependent nominal mu-calculus
Type-Based Complexity Analysis of Probabilistic Functional Programs
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields
On the Power of Symmetric Linear Programs
When is Ontology-Mediated Querying Efficient?
The Hierarchy of Hyperlogics
A comonadic view of simulation and quantum resources
Block products for algebras over countable words and applications to logic
Graph Planning with Expected Finite Horizon
MSO+nabla is undecidable
A Type Theory for Defining Logics and Proofs
Separation and covering for group based concatenation hierarchies
Promises Make Finite (Constraint Satisfaction) Problems Infinitary
Why propositional quantification makes modal logics on trees robustly hard ?
Differentiable Causal Computations via Delayed Trace
Topology is relevant (in the infinite domain dichotomy conjecture for constraint satisfaction problems)
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
Intuitionistic Proofs Without Syntax
Quantum channels as a categorical completion
The Theory of Traces for Systems with Probability and Nondeterminism
Completeness for Game Logic
High-level methods for homotopy construction in associative n-categories
Codensity Games for Bisimilarity
The Geometry of Bayesian Programming
Timed systems through the lens of logic
The convex hull of finitely generable subsets and its predicate transformer
LICS Sponsorship
The symposium is sponsored by ACM SIGLOG, the IEEE Technical Committee on Mathematical Foundations of Computing, the Association for Symbolic Logic, the European Association for Theoretical Computer Science, the Pacific Institute for the Mathematical Sciences, Simon Fraser University, and Google.
Website by Sam Staton based on a bootstrap design by Hartmut Eilers and Eric Koskinen.