Table of Contents

• Unifying Logical and Statistical AIPedro M. Domingos, Daniel Lowd, Stanley Kok, Aniruddh Nath, Hoifung Poon, Matthew Richardson, Parag Singla. 1-11 [doi]
• Duality in Computer ScienceMai Gehrke. 12-26 [doi]
• Blockchains and the Logic of Accountability: Keynote AddressMaurice Herlihy, Mark Moir. 27-30 [doi]
• The Probabilistic Model Checking LandscapeJoost-Pieter Katoen. 31-45 [doi]
• Stochastic mechanics of graph rewritingNicolas Behr, Vincent Danos, Ilias Garnier. 46-55 [doi]
• On the Satisfiability of Some Simple Probabilistic LogicsSouymodip Chakraborty, Joost-Pieter Katoen. 56-65 [doi]
• Distinguishing Hidden Markov ChainsStefan Kiefer, A. Prasad Sistla. 66-75 [doi]
• Quantitative Automata under Probabilistic SemanticsKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. 76-85 [doi]
• Deciding First-Order Satisfiability when Universal and Existential Variables are SeparatedThomas Sturm 0001, Marco Voigt, Christoph Weidenbach. 86-95 [doi]
• The Diagonal Problem for Higher-Order Recursion Schemes is DecidableLorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. 96-105 [doi]
• Two-variable Logic with a Between RelationAndreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing. 106-115 [doi]
• Decidability and Complexity for Quiescent ConsistencyBrijesh Dongol, Robert M. Hierons. 116-125 [doi]
• From positive and intuitionistic bounded arithmetic to monotone proof complexityAnupam Das. 126-135 [doi]
• Gödel's functional interpretation and the concept of learningThomas Powell. 136-145 [doi]
• Understanding Gentzen and Frege Systems for QBFOlaf Beyersdorff, Ján Pich. 146-155 [doi]
• Unified Semantics and Proof System for Classical, Intuitionistic and Affine LogicsChuck Liang. 156-165 [doi]
• Data Communicating Processes with Unreliable ChannelsParosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig. 166-175 [doi]
• A New Perspective on FO Model Checking of Dense Graph ClassesJakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan. 176-184 [doi]
• Proving Liveness of Parameterized ProgramsAzadeh Farzan, Zachary Kincaid, Andreas Podelski. 185-196 [doi]
• Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than ConjunctionKrishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer. 197-206 [doi]
• The complexity of regular abstractions of one-counter languagesMohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche. 207-216 [doi]
• Two-Way Visibly Pushdown Automata and TransducersLuc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot. 217-226 [doi]
• Automata on Infinite Trees with Equality and Disequality Constraints Between SiblingsArnaud Carayol, Christof Löding, Olivier Serre. 227-236 [doi]
• Plays as Resource Terms via Non-idempotent Intersection TypesTakeshi Tsukada, C.-H. Luke Ong. 237-246 [doi]
• Perfect-Information Stochastic Games with Generalized Mean-Payoff ObjectivesKrishnendu Chatterjee, Laurent Doyen 0001. 247-256 [doi]
• Games with bound guess actionsThomas Colcombet, Stefan Göller. 257-266 [doi]
• Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement StepsChristoph Berkholz, Jakob Nordström. 267-276 [doi]
• Hanf normal form for first-order logic with unary counting quantifiersLucas Heimberg, Dietrich Kuske, Nicole Schweikardt. 277-286 [doi]
• Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order LogicSandra Kiefer, Pascal Schweitzer. 287-296 [doi]
• Querying Visible and Invisible InformationMichael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis. 297-306 [doi]
• Coinduction All the Way UpDamien Pous. 307-316 [doi]
• Denotational semantics of recursive types in synthetic guarded domain theoryRasmus Ejlers Møgelberg, Marco Paviotti. 317-326 [doi]
• Type Theory based on Dependent Inductive and Coinductive TypesHenning Basold, Herman Geuvers. 327-336 [doi]
• Program Equivalence is CoinductiveDirk Pattinson, Lutz Schröder. 337-346 [doi]
• Fixed Points In Quantitative SemanticsJ. Laird. 347-356 [doi]
• Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed ComputingTuomo Lempiäinen. 357-366 [doi]
• The Definitional Side of the ForcingGuilhem Jaber, Gabriel Lewertowski, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau. 367-376 [doi]
• Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusionsAmina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin. 377-386 [doi]
• First-order definability of rational transductions: An algebraic approachEmmanuel Filiot, Olivier Gauwin, Nathan Lhote. 387-396 [doi]
• Order Invariance on Decomposable StructuresMichael Elberfeld, Marlin Frickenschmidt, Martin Grohe. 397-406 [doi]
• Definability equals recognizability for graphs of bounded treewidthMikolaj Bojanczyk, Michal Pilipczuk. 407-416 [doi]
• Monadic second order logic as the model companion of temporal logicSilvio Ghilardi, Sam van Gool. 417-426 [doi]
• Interaction Graphs: Full Linear LogicThomas Seiller. 427-436 [doi]
• Conflict nets: Efficient locally canonical MALL proof netsDominic J. D. Hughes, Willem Heijltjes. 437-446 [doi]
• Infinitary Lambda Calculi from a Linear PerspectiveUgo Dal Lago. 447-456 [doi]
• First-order logic with reachability for infinite-state systemsEmanuele D'Osualdo, Roland Meyer, Georg Zetzsche. 457-466 [doi]
• The Complexity of Coverability in ν-Petri NetsRanko Lazic, Sylvain Schmitz. 467-476 [doi]
• Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-CompleteMatthias Englert, Ranko Lazic, Patrick Totzke. 477-484 [doi]
• Comparing Chemical Reaction Networks: A Categorical and Algorithmic PerspectiveLuca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin. 485-494 [doi]
• A categorical approach to open and interconnected dynamical systemsBrendan Fong, Pawel Sobocinski, Paolo Rapisarda. 495-504 [doi]
• Differential Refinement LogicSarah M. Loos, André Platzer. 505-514 [doi]
• On Recurrent Reachability for Continuous Linear Dynamical SystemsVentsislav Chonev, Joël Ouaknine, James Worrell. 515-524 [doi]
• Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraintsSam Staton, Hongseok Yang, Frank Wood, Chris Heunen, Ohad Kammar. 525-534 [doi]
• Interacting Frobenius Algebras are HopfRoss Duncan, Kevin Dunne. 535-544 [doi]
• Semi-galois Categories I: The Classical Eilenberg Variety TheoryTakeo Uramoto. 545-554 [doi]
• A bifibrational reconstruction of Lawvere's presheaf hyperdoctrinePaul-André Melliès, Noam Zeilberger. 555-564 [doi]
• A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type TheoryKuen-Bang Hou (Favonia), Eric Finster, Daniel R. Licata, Peter LeFanu Lumsdaine. 565-574 [doi]
• Hybrid realizability for intuitionistic and classical choiceValentin Blot. 575-584 [doi]
• Trace semantics for polymorphic referencesGuilhem Jaber, Nikos Tzevelekos. 585-594 [doi]
• Constructions with Non-Recursive Higher Inductive TypesNicolai Kraus. 595-604 [doi]
• A constructive function-theoretic approach to topological compactnessIosif Petrakis. 605-614 [doi]
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction ProblemsLibor Barto, Michael Pinsker. 615-622 [doi]
• Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfactionManuel Bodirsky, Antoine Mottet. 623-632 [doi]
• Weak consistency notions for all the CSPs of bounded widthMarcin Kozik. 633-641 [doi]
• Graphs of relational structures: restricted typesAndrei A. Bulatov. 642-651 [doi]
• The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden PatternsMartin C. Cooper, Stanislav Zivny. 652-661 [doi]
• Winning Cores in Parity GamesSteen Vester. 662-671 [doi]
• Reasoning about Recursive Probabilistic ProgramsFederico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. 672-681 [doi]
• Healthiness from DualityWataru Hino, Hiroki Kobayashi, Ichiro Hasuo, Bart Jacobs 0001. 682-691 [doi]
• Kolmogorov Extension, Martingale Convergence, and Compositionality of ProcessesDexter Kozen. 692-699 [doi]
• Quantitative Algebraic ReasoningRadu Mardare, Prakash Panangaden, Gordon D. Plotkin. 700-709 [doi]
• Rewriting modulo symmetric monoidal structureFilippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi. 710-719 [doi]
• Effective Brenier Theorem: Applications to Computable Analysis and Algorithmic RandomnessAlex Galicki. 720-729 [doi]
• Quantifier Free Definability on Infinite AlgebrasBakh Khoussainov. 730-738 [doi]
• Factor Varieties and Symbolic ComputationAntonino Salibra, Giulio Manzonetto, Giordano Favro. 739-748 [doi]
• Proving Differential Privacy via Probabilistic CouplingsGilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub. 749-758 [doi]
• On Thin Air Reads Towards an Event Structures Model of Relaxed MemoryAlan Jeffrey, James Riely. 759-767 [doi]
• Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive SystemsViorel Preoteasa, Stavros Tripakis. 768-777 [doi]
• Divide and Congruence II: Delay and Weak BisimilarityWan Fokkink, Rob J. van Glabbeek. 778-787 [doi]
• How unprovable is Rabin's decidability theorem?Leszek Aleksander Kolodziejczyk, Henryk Michalewski. 788-797 [doi]
• Solvability of Matrix-Exponential EquationsJoël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell. 798-806 [doi]
• Order-Invariance of Two-Variable Logic is DecidableThomas Zeume, Frederik Harwath. 807-816 [doi]
• A Step Up in Expressiveness of Decidable Fixpoint LogicsMichael Benedikt, Pierre Bourhis, Michael Vanden Boom. 817-826 [doi]
• Church Meets Cook and LevinDamiano Mazza. 827-836 [doi]
• Complexity Theory of (Functions on) Compact Metric SpacesAkitoshi Kawamura, Florian Steinberg, Martin Ziegler 0001. 837-846 [doi]
• Semantically Acyclic Conjunctive Queries under Functional DependenciesDiego Figueira. 847-856 [doi]
• A Generalised Twinning Property for Minimisation of Cost Register AutomataLaure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot. 857-866 [doi]
• Invisible Pushdown LanguagesEryk Kopczynski. 867-872 [doi]
• Minimization of Symbolic Tree AutomataLoris D'Antoni, Margus Veanes. 873-882 [doi]