LICS 2016 Accepted Papers
Diego Figueira. Semantically Acyclic Conjunctive Queries under Functional Dependencies
Chuck Liang. Unified Semantics and Proof
System for Classical, Intuitionistic and Affine Logics
Iosif Petrakis. A constructive function-theoretic approach to topological compactness
Nicolai Kraus. Constructions with Non-Recursive Higher Inductive Types
span>
Martin C. Cooper and Stanislav Živný. The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
Steen Vester. Winning Cores in Parity Games
Michael Benedikt, Pierre Bourhis and Michael Vanden Boom. A step up in expressiveness of decidable fixpoint logics
Thomas Zeume and Frederik Harwath. Order-
Invariance of Two-Variable Logic is Decidable
Sandra Kiefer and Pascal Schweitzer. Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic
Alex Galicki. Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness
Amina Doumane, David Baelde, Lucca Hirschi and Alexis Saurin. Towards Completeness via Proof Search in the Linear
Time Mu-calculus
Bakh Khoussainov. Quantifier Free Definability on Infinite Algebras
Thomas Powell. Goedel's functional interpretation and the concept of learning
Dexter Kozen. Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes
Arnaud Carayol, Christof Löding and Olivier Serre.
span>Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
Ugo Dal Lago. Infinitary Lambda Calculi from a Linear Perspective
Guilhem Jaber and Nikos Tzevelekos.
span>Trace semantics for polymorphic references
Marcin Kozik. Weak consistency notions for all the CSPs of bounded width
Valentin Blot. Hybrid realizability for intuitionistic and classical choice
Manuel Bodirsky and Antoine Mottet. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
Emmanuel Filiot, Olivier Gauwin and Nathan Lhote. First-order definability of rational transductions: An algebraic approach
Sam Staton, Hongseok Yang, Chris Heunen, Ohad Kammar and Frank Wood. Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Souymodip Chakraborty and Joost-Pieter Katoen. On the Satisfiability of Some Simple Probabilistic Logics
Lorenzo Clemente, Paweł Parys, Sylvain Salvati and Igor Walukiewicz. The diagonal problem for higher-order recursive schemes is decidable
Takeo Uramoto. Semi-galois Categories I: The Classical Eilenberg Variety Theory
Jakub Gajarský, Petr Hlineny, Daniel Lokshtanov, Jan Obdrzalek and M. S. Ramanujan. A New Perspective on FO Model Checking of Dense Graph Classes
Marco Voigt, Christoph Weidenbach and Thomas Sturm. Deciding First-Order Satisfiability when Universal and Existential Variables are Separated
Nicolas Behr, Vincent Danos and Ilias Garnier. Stochastic mechanics of graph rewriting
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski and Fabio Zanasi. Rewriting modulo symmetric monoidal structure
Kuen-Bang Hou, Eric Finster, Daniel R. Licata and Peter Lumsdaine. A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory
Laure Daviaud, Pierre-Alain Reynier and Jean-Marc Talbot. A Generalised Twinning Property for Minimisation of Cost Register Automata
Ross Duncan and Kevin Dunne. Interacting Frobenius Algebras are Hopf.
Tuomo Lempiäinen. Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing
James Laird. Fixed Points in Quantitative Semantics
Anupam Das. From positive and intuitionistic bounded arithmetic to proof complexity