default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th LICS 2021: Rome, Italy
- 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. IEEE 2021, ISBN 978-1-6654-4895-6
- Ting-Wei Lin, Chia-Hsuan Lu, Tony Tan
:
Towards a more efficient approach for the satisfiability of two-variable logic. 1-13 - Jim de Groot, Tadeusz Litak, Dirk Pattinson:
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication. 1-15 - Robin Hirsch, Jas Semrl:
Demonic Lattices and Semilattices in Relational Semigroups with Ordinary Composition. 1-10 - Manuel Bodirsky, Thomas Feller, Simon Knäuer, Sebastian Rudolph:
On Logics and Homomorphism Closure. 1-13 - Florian Luca, Joël Ouaknine, James Worrell:
Universal Skolem Sets. 1-6 - Liron Cohen, Étienne Miquey, Ross Tate:
Evidenced Frames: A Unifying Framework Broadening Realizability Models. 1-13 - Chase Ford, Stefan Milius, Lutz Schröder:
Behavioural Preorders via Graded Monads. 1-13 - Andrej Dudenhefner:
The Undecidability of System F Typability and Type Checking for Reductionists. 1-10 - R. Ryan Williams:
Complexity Lower Bounds from Algorithm Design. 1-3 - Nuria Brede, Hugo Herbelin:
On the logical structure of choice and bar induction principles. 1-13 - Guilhem Jaber, Andrzej S. Murawski:
Compositional relational reasoning via operational game semantics. 1-13 - Michael Blondin, Tim Leys, Filip Mazowiecki, Philip Offtermatt, Guillermo A. Pérez:
Continuous One-Counter Automata. 1-13 - Luca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik:
In search of lost time: Axiomatising parallel composition in process algebras. 1-14 - Toby Cathcart Burn, Luke Ong, Steven J. Ramsay, Dominik Wagner:
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses. 1-13 - Rob van Glabbeek, Peter Höfner, Ross Horne:
Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom. 1-13 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Parameterized Complexity of Elimination Distance to First-Order Logic Properties. 1-13 - Eric Finster, Antoine Allioux, Matthieu Sozeau:
Types Are Internal ∞-Groupoids. 1-13 - Albert Atserias, Phokion G. Kolaitis, Wei-Lin Wu:
On the Expressive Power of Homomorphism Counts. 1-13 - Tuomas Hakoniemi:
Monomial size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus. 1-7 - Fedor Part, Neil Thapen, Iddo Tzameret:
First-Order Reasoning and Efficient Semi-Algebraic Proofs. 1-13 - Thomas A. Henzinger, N. Ege Saraç:
Quantitative and Approximate Monitoring. 1-14 - Dan R. Ghica, Todd Waugh Ambridge:
Global Optimisation with Constructive Reals. 1-13 - Andrew Kenyon-Roberts, C.-H. Luke Ong:
Supermartingales, Ranking Functions and Probabilistic Lambda Calculus. 1-13 - Dario Stein, Sam Staton:
Compositional Semantics for Probabilistic Programs with Exact Conditioning. 1-13 - Titouan Carette, Marc de Visme, Simon Perdrix:
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory. 1-13 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Mirco Tribastone, Max Tschaikowski, Andrea Vandin:
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods. 1-14 - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. 1-13 - Daniel Hirschkoff, Enguerrand Prebet, Davide Sangiorgi:
On sequentiality and well-bracketing in the π-calculus. 1-13 - Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque:
The Topological Mu-Calculus: completeness and decidability. 1-13 - John C. Baez, Fabrizio Genovese, Jade Master, Michael Shulman:
Categories of Nets. 1-13 - James Laird:
A Compositional Cost Model for the λ-calculus. 1-13 - Amar Hadzihasanovic:
The Smash Product of Monoidal Theories. 1-13 - Dominic J. D. Hughes, Lutz Straßburger, Jui-Hsuan Wu:
Combinatorial Proofs and Decomposition Theorems for First-order Logic. 1-13 - Laura Bozzelli, Adriano Peron, César Sánchez:
Asynchronous Extensions of HyperLTL. 1-13 - Jean Christoph Jung, Frank Wolter:
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments. 1-14 - Samson Abramsky, Dan Marsden:
Comonadic semantics for guarded fragments. 1-13 - Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. 1-13 - Corto Mascle, Christel Baier, Florian Funke, Simon Jantsch, Stefan Kiefer:
Responsibility and verification: Importance value in temporal logics. 1-14 - Moritz Lichter:
Separating Rank Logic from Polynomial Time. 1-13 - Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný:
PTAS for Sparse General-Valued CSPs. 1-11 - Denis Kuperberg:
Positive First-order Logic on Words. 1-13 - Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
A Logic for Locally Complete Abstract Interpretations. 1-13 - Anuj Dawar, Tomas Jakl, Luca Reggio:
Lovász-Type Theorems and Game Comonads. 1-13 - Xiaodong Jia, Bert Lindenhovius, Michael W. Mislove, Vladimir Zamdzhiev:
Commutative Monads for Probabilistic Programming Languages. 1-14 - Paolo Capriotti, Nils Anders Danielsson, Andrea Vezzosi:
Higher Lenses. 1-13 - Antonis Achilleos, Mathias Ruggaard Pedersen:
Axiomatizations and Computability of Weighted Monadic Second-Order Logic. 1-13 - Orna Kupferman, Noam Shenwald:
Perspective Multi-Player Games. 1-13 - Federico Olimpieri:
Intersection Type Distributors. 1-15 - Hernán C. Melgratti, Claudio Antares Mezzina, G. Michele Pinna:
A distributed operational view of Reversible Prime Event Structures. 1-13 - Piotr Hofman, Marta Juzepczuk, Slawomir Lasota, Mohnish Pattathurajan:
Parikh's theorem for infinite alphabets. 1-13 - Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen:
Strong Call-by-Value is Reasonable, Implosively. 1-14 - Dmitriy Zhuk:
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem. 1-7 - Francesco Gavazzo, Claudia Faggian:
A Relational Theory of Monadic Rewriting Systems, Part I. 1-14 - Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. 1-13 - Martín Abadi, Gordon D. Plotkin:
Smart Choices and the Selection Monad. 1-14 - Philippe Balbiani, Martín Diéguez, David Fernández-Duque:
Some constructive variants of S4 with the finite model property. 1-13 - Xinxin Liu, Tingting Yu:
A Complete Axiomatisation for Divergence Preserving Branching Congruence of Finite-State Behaviours. 1-13 - Pablo Barenbaum, Teodoro Freund:
A Constructive Logic with Classical Proofs and Refutations. 1-13 - Farzaneh Derakhshan, Stephanie Balzer, Limin Jia:
Session Logical Relations for Noninterference. 1-14 - Yuichi Komorida, Shin-ya Katsumata, Clemens Kupke, Jurriaan Rot, Ichiro Hasuo:
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation. 1-14 - Amaldev Manuel, Dhruv Nevatia:
An Algebraic Characterisation of First-Order Logic with Neighbour. 1-13 - Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Fixed-Points for Quantitative Equational Logics. 1-13 - Thomas Ehrhard, Farzad Jafarrahmani:
Categorical models of Linear Logic with fixed points of formulas. 1-13 - Rineke Verbrugge:
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames. 1-13 - Nicolai Kraus:
Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT. 1-14 - Libor Barto, William J. DeMeo, Antoine Mottet:
Constraint Satisfaction Problems over Finite Structures. 1-13 - Li Zhou, Gilles Barthe, Justin Hsu, Mingsheng Ying, Nengkun Yu:
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic. 1-14 - Martin Grohe:
The Logic of Graph Neural Networks. 1-17 - Bart Jacobs:
From Multisets over Distributions to Distributions over Multisets. 1-13 - Jan Dreier:
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. 1-13 - Manuel Bodirsky, Bertalan Bodor:
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property. 1-13 - Elisabet Burjons, Fabian Frei, Martin Raszyk:
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata. 1-13 - Ramana Nagasamudram, David A. Naumann:
Alignment Completeness for Relational Hoare Logics. 1-13 - Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Verifying higher-order concurrency with data automata. 1-13 - Paolo Pistone:
On Generalized Metric Spaces for the Simply Typed Lambda-Calculus. 1-14 - Jeff Erickson, Gabriel Nivasch, Junyan Xu:
Fusible numbers and Peano Arithmetic. 1-13 - Jamie Tucker-Foltz:
Inapproximability of Unique Games in Fixed-Point Logic with Counting. 1-13 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. 1-13 - Jialu Bao, Simon Docherty, Justin Hsu, Alexandra Silva:
A Bunched Logic for Conditional Independence. 1-14 - Gianluca Cima, Marco Console, Maurizio Lenzerini, Antonella Poggi:
Abstraction in Data Integration. 1-11 - Matteo Mio, Ralph Sarkis, Valeria Vignudelli:
Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. 1-14 - Natasha Fernandes, Annabelle McIver, Carroll Morgan:
The Laplace Mechanism has optimal utility for differential privacy over continuous queries. 1-12 - Jonathan Sterling, Carlo Angiuli:
Normalization for Cubical Type Theory. 1-15 - Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni:
The Space of Interaction. 1-13 - Hugo Moeneclaey:
Parametricity and Semi-Cubical Types. 1-11 - A. R. Balasubramanian, Timo Lang, Revantha Ramanayake:
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics. 1-13 - Emanuel Kieronski, Sebastian Rudolph:
Finite Model Theory of the Triguarded Fragment and Related Logics. 1-13 - Maciej Gazda, Robert M. Hierons:
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics. 1-13 - Luc Dartois, Paul Gastin, Shankara Narayanan Krishna:
SD-Regular Transducer Expressions for Aperiodic Transformations. 1-13 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. 1-13 - Preey Shah, Aman Bansal, S. Akshay, Supratik Chakraborty:
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis. 1-13 - Yijia Chen, Jörg Flum:
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. 1-13 - Pedro H. Azevedo de Amorim, Dexter Kozen, Radu Mardare, Prakash Panangaden, Michael Roberts:
Universal Semantics for the Stochastic λ-Calculus. 1-12 - Ronald Fagin, Jonathan Lenchner, Kenneth W. Regan, Nikhil Vyas:
Multi-Structural Games and Number of Quantifiers. 1-13 - Paul-André Melliès:
Asynchronous Template Games and the Gray Tensor Product of 2-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-05 20:19 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:
