default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th LICS 2023: Boston, MA, USA
- Boldizsár Poór, Quanlong Wang, Razin A. Shaikh, Lia Yeh, Richie Yeung, Bob Coecke:
Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus. 1-14 - Johannes Klaus Fichte, Robert Ganian, Markus Hecher
, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. 1-14 - Pierre Clairambault, Federico Olimpieri, Hugo Paquet:
From Thin Concurrent Games to Generalized Species of Structures. 1-14 - Thomas Place, Marc Zeitoun:
Group Separation Strikes Back. 1-13 - Marianna Girlando, Roman Kuznets, Sonia Marin, Marianela Morales, Lutz Straßburger:
Intuitionistic S4 is decidable. 1-13 - Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez:
ℤ-polyregular functions. 1-13 - Ken Sakayori, Davide Sangiorgi:
Extensional and Non-extensional Functions as Processes. 1-13 - Titouan Carette, Louis Lemonnier, Vladimir Zamdzhiev:
Central Submonads and Notions of Computation: Soundness, Completeness and Internal Languages. 1-13 - Zeinab Galal:
Fixpoint operators for 2-categorical structures. 1-13 - Jason P. Bell, Daniel Smertnig:
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields. 1-13 - Jan Dreier, Jamie Tucker-Foltz:
Pseudorandom Finite Models. 1-13 - Georgios Argyris, Alberto Lluch-Lafuente, Alexander Leguizamon-Robayo, Mirco Tribastone, Max Tschaikowski, Andrea Vandin:
Minimization of Dynamical Systems over Monoids. 1-14 - Henning Urbat, Stelios Tsampas, Sergey Goncharov, Stefan Milius, Lutz Schröder:
Weak Similarity in Higher-Order Mathematical Operational Semantics. 1-13 - Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell:
Multiplicity Problems on Algebraic Series and Context-Free Grammars. 1-12 - Titouan Carette, Timothée Hoffreumon, Émile Larroque, Renaud Vilmart:
Complete Graphical Language for Hermiticity-Preserving Superoperators. 1-22 - Tobias Winkler, Joost-Pieter Katoen:
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata. 1-13 - Thomas Ehrhard, Aymeric Walch:
Cartesian Coherent Differential Categories. 1-13 - Wojciech Przybyszewski:
Distal Combinatorial Tools for Graphs of Bounded Twin-Width. 1-13 - Jessie Grosen, David M. Kahn, Jan Hoffmann:
Automatic Amortized Resource Analysis with Regular Recursive Types. 1-14 - Michael Blondin, Philip Offtermatt, Alex Sansfaçon-Buchanan:
Verifying linear temporal specifications of constant-rate multi-mode systems. 1-13 - Pascal Bergsträßer, Moses Ganardi:
Revisiting Membership Problems in Subclasses of Rational Relations. 1-14 - Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine:
Reachability in Injective Piecewise Affine Maps. 1-11 - Amar Hadzihasanovic, Diana Kessler:
Higher-Dimensional Subdiagram Matching. 1-13 - Glynn Winskel:
Making Concurrency Functional. 1-14 - Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker:
Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. 1-13 - Azadeh Farzan:
Commutativity in Automated Verification. 1-7 - Martin Grohe:
The Descriptive Complexity of Graph Neural Networks. 1-14 - Éric Goubault, Roman Kniazev, Jérémy Ledent, Sergio Rajsbaum:
Semi-Simplicial Set Models for Distributed Knowledge. 1-13 - Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam Staton:
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs. 1-14 - Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. 1-13 - Yuanhong Wang, Juhua Pu, Yuyi Wang, Ondrej Kuzelka:
On Exact Sampling in the Two-Variable Fragment of First-Order Logic. 1-13 - Tamio-Vesa Nakajima, Stanislav Zivný:
Boolean symmetric vs. functional PCSP dichotomy. 1-12 - Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Stochastic Best-Effort Strategies for Borel Goals. 1-13 - Tomas Jakl, Dan Marsden, Nihil Shah:
A categorical account of composition methods in logic. 1-14 - Marie Kerjean, Jean-Simon Pacaud Lemay:
Taylor Expansion as a Monad in Models of DiLL. 1-13 - Pierre Clairambault, Simon Forest:
The Cartesian Closed Bicategory of Thin Spans of Groupoids. 1-13 - Adnan Darwiche:
Logic for Explainable AI. 1-11 - Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell:
The Power of Positivity. 1-11 - Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu:
Set-Theoretic and Type-Theoretic Ordinals Coincide. 1-13 - Ruiwen Dong:
The Identity Problem in the special affine group of Z2. 1-13 - Dan Suciu:
Applications of Information Inequalities to Database Theory Problems. 1-30 - Jan Kretínský, Tobias Meggendorfer, Maximilian Weininger:
Stopping Criteria for Value Iteration on Stochastic Games with Quantitative Objectives. 1-14 - Gianluca Curzi, Anupam Das:
Computational expressivity of (circular) proofs with fixed points. 1-13 - Fredrik Dahlqvist, Alexandra Silva, William Smith:
Deterministic stream-sampling for probabilistic programming: semantics and verification. 1-13 - Elena Di Lavore, Mario Román:
Evidential Decision Theory via Partial Markov Categories. 1-14 - Yue Niu, Robert Harper:
A Metalanguage for Cost-Aware Denotational Semantics. 1-14 - Vasileios Koutavas, Yu-Yang Lin, Nikos Tzevelekos:
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF. 1-13 - David Baelde, Adrien Koutsos, Joseph Lallemand:
A Higher-Order Indistinguishability Logic for Cryptographic Reasoning. 1-13 - David Fernández-Duque, Quentin Gougeon:
Fixed Point Logics on Hemimetric Spaces. 1-13 - Agata Ciabattoni, Timo Lang, Revantha Ramanayake:
Cut-Restriction: From Cuts to Analytic Cuts. 1-13 - Benedict Bunting, Andrzej S. Murawski:
Operational Algorithmic Game Semantics. 1-13 - Mikolaj Bojanczyk:
Folding interpretations. 1-13 - Laure Daviaud, David Purser:
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete). 1-13 - Arka Ghosh, Piotr Hofman, Slawomir Lasota:
Orbit-finite linear programming. 1-14 - Damian Niwinski, Pawel Parys, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem*. 1-13 - Alexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron:
A Complete Equational Theory for Quantum Circuits. 1-13 - Michael Benedikt, Ehud Hrushovski:
Embedded Finite Models beyond Restricted Quantifier Collapse. 1-13 - Francesco Gavazzo:
Allegories of Symbolic Manipulations. 1-15 - Mikolaj Bojanczyk:
On the Growth Rates of Polyregular Functions. 1-13 - Yoshiki Nakamura:
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. 1-13 - Diego Figueira, Santiago Figueira, Edwin Pin Baque:
PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse. 1-13 - Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus:
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. 1-13 - Dario Della Monica, Angelo Montanari, Gabriele Puppis, Pietro Sala:
The Logic of Prefixes and Suffixes is Elementary under Homogeneity*. 1-12 - Dale Miller:
A system of inference based on proof search: an extended abstract. 1-11 - Jelle Hellings, Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht:
Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees. 1-13 - Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying Over Trees in Monadic Second-Order Logic. 1-13 - Axel Ljungström, Anders Mörtberg:
Formalizing π4(S3) ≅Z/2Z and Computing a Brunerie Number in Cubical Agda. 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-10-29 01:26 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:
