LICS A*

63 papers

YearTitle / Authors
201934th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019
2019A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness.
Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart
2019A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics.
Renaud Vilmart
2019A Probabilistic and Non-Deterministic Call-by-Push-Value Language.
Jean Goubault-Larrecq
2019A Sequent Calculus for Opetopes.
Cédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram
2019A Type Theory for Defining Logics and Proofs.
Brigitte Pientka, David Thibodeau, Andreas Abel, Francisco Ferreira, Rébecca Zucchini
2019A comonadic view of simulation and quantum resources.
Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield
2019A short story of the CSP dichotomy conjecture.
Andrei A. Bulatov
2019A type theory for cartesian closed bicategories (Extended Abstract).
Marcelo Fiore, Philip Saville
2019Algorithmic barriers to representing conditional independence.
Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute
2019Approximate Span Liftings: Compositional Semantics for Relaxations of Differential Privacy.
Tetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata
2019Backprop as Functor: A compositional perspective on supervised learning.
Brendan Fong, David I. Spivak, Rémy Tuyéras
2019Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete.
Petr Jancar, Sylvain Schmitz
2019Block products for algebras over countable words and applications to logic.
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
2019Canonisation and Definability for Graphs of Bounded Rank Width.
Martin Grohe, Daniel Neuen
2019Categorical Semantics for Time Travel.
Nicola Pinzani, Stefano Gogioso, Bob Coecke
2019Codensity Games for Bisimilarity.
Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
2019Completeness for Game Logic.
Sebastian Enqvist, Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema
2019Describing free $\omega$ -categories.
Simon Forest, Samuel Mimram
2019Descriptive complexity for minimal time of cellular automata.
Etienne Grandjean, Théo Grente
2019Differentiable Causal Computations via Delayed Trace.
David Sprunger, Shin-ya Katsumata
2019Graph Planning with Expected Finite Horizon.
Krishnendu Chatterjee, Laurent Doyen
2019Graphical Affine Algebra.
Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi
2019High-level methods for homotopy construction in associative n-categories.
David Reutter, Jamie Vicary
2019Higher-Kinded Data Types: Syntax and Semantics.
Patricia Johann, Andrew Polonsky
2019History-Dependent Nominal μ-Calculus.
Clovis Eberhart, Bartek Klin
2019HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories.
C.-H. Luke Ong, Dominik Wagner
2019Intuitionistic proofs without syntax.
Willem B. Heijltjes, Dominic J. D. Hughes, Lutz Straßburger
2019Lambda Calculus and Probabilistic Computation.
Claudia Faggian, Simona Ronchi Della Rocca
2019Lambda Y-Calculus With Priorities.
Igor Walukiewicz
2019Learning Concepts Definable in First-Order Logic with Counting.
Steffen van Bergerem
2019Local normal forms and their use in algorithmic meta theorems (Invited Talk).
Nicole Schweikardt
2019Long-run Satisfaction of Path Properties.
Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur
2019MSO+∇ is undecidable.
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
2019Matching μ-Logic.
Xiaohong Chen, Grigore Rosu
2019Model Comparison Games for Horn Description Logics.
Jean Christoph Jung, Fabio Papacchini, Frank Wolter, Michael Zakharyaschev
2019No-Go Theorems for Distributive Laws.
Maaike Zwart, Dan Marsden
2019On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields.
Florent Guépin, Christoph Haase, James Worrell
2019On the Power of Symmetric Linear Programs.
Albert Atserias, Anuj Dawar, Joanna Ochremiak
2019On the Termination Problem for Probabilistic Higher-Order Recursive Programs.
Naoki Kobayashi, Ugo Dal Lago, Charles Grellois
2019Path Spaces of Higher Inductive Types in Homotopy Type Theory.
Nicolai Kraus, Jakob von Raumer
2019Perspective Games.
Orna Kupferman, Gal Vardi
2019Point-width and Max-CSPs.
Clément Carbonnel, Miguel Romero, Stanislav Zivný
2019Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests.
Christoph Haase, Georg Zetzsche
2019Probabilistic Relational Reasoning via Metrics.
Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata
2019Promises Make Finite (Constraint Satisfaction) Problems Infinitary.
Libor Barto
2019Quantum Hoare Logic with Ghost Variables.
Dominique Unruh
2019Quantum channels as a categorical completion.
Mathieu Huot, Sam Staton
2019Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension.
Jérôme Leroux, Sylvain Schmitz
2019Realizability in the Unitary Sphere.
Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, Benoît Valiron
2019Separation and covering for group based concatenation hierarchies.
Thomas Place, Marc Zeitoun
2019Template games and differential linear logic.
Paul-André Melliès
2019The Geometry of Bayesian Programming.
Ugo Dal Lago, Naohiko Hoshino
2019The Hierarchy of Hyperlogics.
Norine Coenen, Bernd Finkbeiner, Christopher Hahn, Jana Hofmann
2019The Logic of Action Lattices is Undecidable.
Stepan L. Kuznetsov
2019The Theory of Traces for Systems with Nondeterminism and Probability.
Filippo Bonchi, Ana Sokolova, Valeria Vignudelli
2019The convex hull of finitely generable subsets and its predicate transformer.
Mohammad-Javad Davari, Abbas Edalat, André Lieutier
2019Timed Systems through the Lens of Logic.
S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna
2019Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2019Type-Based Complexity Analysis of Probabilistic Functional Programs.
Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen
2019Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
Moritz Lichter, Ilia Ponomarenko, Pascal Schweitzer
2019When is Ontology-Mediated Querying Efficient?
Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris
2019Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?
Bartosz Bednarczyk, Stéphane Demri