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