default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th LICS 2025: Singapore
- 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025. IEEE 2025, ISBN 979-8-3315-7900-5
- Andrei Popescu:
Completing Gordon's Higher-Order Logic. 1-15 - Liron Cohen, Ariel Grunfeld, Dominik Kirst, Étienne Miquey:
Syntactic Effectful Realizability in Higher-Order Logic. 16-30 - Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher:
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? 31-43 - Mikhail R. Starchak:
Quantifier Elimination for Regular Integer Linear-Exponential Programming. 44-56 - Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat:
Alternating Nominal Automata with Name Allocation. 57-70 - Mayuko Kori, Kazuki Watanabe, Jurriaan Rot:
Initial Algebra Correspondence under Reachability Conditions. 71-83 - Thomas Ehrhard, Farzad Jafarrahmani, Alexis Saurin:
On the denotation of circular and non-wellfounded proofs in linear logic with fixed points. 84-97 - Mishel Carelli, Bernd Finkbeiner, Julian Siber:
Closure and Complexity of Temporal Causality. 98-111 - Niels van der Weide:
The internal languages of univalent categories. 112-126 - Daniel Gratzer, Jonathan Weinberger, Ulrik Buchholtz:
The Yoneda embedding in simplicial type theory. 127-142 - Andrew Slattery, Jonathan Sterling:
Hofmann-Streicher lifting of fibred categories : Dedicated to the memory of Thomas Streicher (1958-2025). 143-154 - Johannes Kloibhofer, Yde Venema:
Interpolation for the two-way modal μ-calculus. 155-168 - Jim de Groot, Ian Shillito, Ranald Clouston:
Semantical Analysis of Intuitionistic Modal Logics between CK and IK. 169-182 - Victoria Barrett, Alessio Guglielmi, Benjamin Ralph, Lutz Straßburger:
Proof Compression via Subatomic Logic and Guarded Substitutions. 183-195 - Marcelo Fiore, Sanjiv Ranchod:
Substructural Abstract Syntax with Variable Binding and Single-Variable Substitution. 196-208 - Aleksei Tiurin, Chris Barrett, Dan R. Ghica, Nick Hu:
Equivalence Hypergraphs: DPO Rewriting for Monoidal E-Graphs. 209-222 - Mirai Ikebuchi:
Homological Invariants of Higher-Order Equational Theories. 223-235 - Anatole Dahan:
Group Order Logic. 236-248 - Corentin Bodart, Ruiwen Dong:
The Identity Problem in virtually solvable matrix groups over algebraic numbers. 249-261 - Tom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu:
Ordinal Exponentiation in Homotopy Type Theory. 262-274 - Thibaut Benjamin, Ioannis Markakis, Wilfred Offord, Chiara Sarti, Jamie Vicary:
Naturality for higher-dimensional path types. 275-288 - Axel Ljungström, David Wärn:
The Steenrod squares via unordered joins. 289-300 - Qiaolan Meng, Juhua Pu, Hongting Niu, Yuyi Wang, Yuanhong Wang, Ondrej Kuzelka:
Model Enumeration of Two-Variable Logic with Quadratic Delay Complexity. 301-313 - Thomas Place, Marc Zeitoun:
Navigational hierarchies of regular languages. 314-328 - Louwe Kuijer, Tony Tan, Frank Wolter, Michael Zakharyaschev:
Separation and Definability in Fragments of Two-Variable First-Order Logic with Counting. 329-343 - Sam M. Thompson, Nicole Schweikardt, Dominik D. Freydenberger:
Characterization and Decidability of FC-Definable Regular Languages. 344-356 - Antoine Mottet:
Algebraic and algorithmic synergies between promise and infinite-domain CSPs. 357-371 - Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki:
Classical Simulation of Quantum CSP Strategies. 372-388 - Paolo Marimon, Michael Pinsker:
Binary symmetries of tractable non-rigid structures. 389-402 - Johanna Brunar, Marcin Kozik, Tomás Nagy, Michael Pinsker:
The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. 403-416 - Quentin Aristote, Sam van Gool, Daniela Petrisan, Mahsa Shirmohammadi:
Learning Weighted Automata over Number Rings, Concretely and Categorically. 417-430 - Christof Löding, Igor Walukiewicz:
Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive Learning. 431-443 - Prince Mathew, Vincent Penelle, A. V. Sreejith:
Learning Deterministic One-Counter Automata in Polynomial Time. 444-457 - Thomas Brihaye, Krishnendu Chatterjee, Stefanie Mohr, Maximilian Weininger:
Risk-aware Markov Decision Processes Using Cumulative Prospect Theory. 458-471 - Dario Stein:
Random Variables, Conditional Independence and Categories of Abstract Sample Spaces. 472-484 - Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy:
Probabilistic Strategies: Definability and the Tensor Completeness Problem. 485-498 - Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Multiplicative Rewards in Markovian Models. 499-512 - Pierre Clairambault:
The Qualitative Collapse of Concurrent Games. 513-526 - Benedict Bunting, Andrzej S. Murawski:
Reachability Types, Traces and Full Abstraction. 527-540 - Filippo Bonchi, Elena Di Lavore, Mario Román:
Effectful Mealy Machines: Bisimulation and Trace. 541-554 - Jonas Forster, Lutz Schröder, Paul Wild:
Conformance Games for Graded Semantics. 555-567 - Marta Grobelna, Jan Kretínský, Maximilian Weininger:
Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games. 568-580 - Roland Guttenberg, Wojciech Czerwinski, Slawomir Lasota:
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. 581-593 - Yousef Shakiba, Henry Sinclair-Banks, Georg Zetzsche:
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. 594-608 - Timothy Bourke, Paul Jeanmaire, Marc Pouzet:
Functional Stream Semantics for a Synchronous Block-Diagram Compiler. 609-621 - A. R. Balasubramanian, Dmitry Chistikov, Rupak Majumdar:
Pushdown Model Checking above the Cubic Bottleneck. 622-635 - Antonis Achilleos, Adrian Francalanza, Jasmine Xuereb:
If At First You Don't Succeed: Extended Monitorability through Multiple Executions. 636-650 - Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Multiple Reachability in Linear Dynamical Systems. 651-663 - Jan Dreier, Robert Ganian, Thekla Hamm:
Approximate Evaluation of Quantitative Second Order Queries. 664-677 - Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum:
Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. 678-690 - Mikolaj Bojanczyk, Pierre Ohlmann:
Graphs of unbounded linear cliquewidth must transduce all trees. 691-703 - Marius Bozga, Radu Iosif, Florian Zuleger:
Regular Grammars for Sets of Graphs of Tree-Width 2. 704-717 - Leoni Pugh, Jonathan Sterling:
When is the partial map classifier a Sierpiński cone? 718-731 - Pedro H. Azevedo de Amorim, Satoshi Kura, Philip Saville:
Logical relations for call-by-push-value models, via internal fibrations in a 2-category. 732-747 - Aymeric Walch:
Compositional Taylor expansion in cartesian differential categories. 748-760 - Anton Chernev, Corina Cîrstea, Helle Hvid Hansen, Clemens Kupke:
Thin Coalgebraic Behaviours Are Inductive. 761-775 - Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, Paul Wild:
Relators and Notions of Simulation Revisited. 776-789 - Paul Wild, Lutz Schröder:
Behavioural Conformances based on Lax Couplings. 790-803 - Lorenzo Clemente:
The commutativity problem for effective varieties of formal series, and applications. 804-817 - Sam Adam-Day, Michael Benedikt, Alberto Larrauri:
Convergence Laws for Extensions of First-Order Logic with Averaging. 818-830 - Jakub Gajarský, Michal Pilipczuk, Filip Pokrývka:
3D-grids are not transducible from planar graphs. 831-842 - Petr Hlinený, Jan Jedelský:
Transductions of Graph Classes Admitting Product Structure. 843-855 - Wojciech Przybyszewski, Szymon Torunczyk:
Flipping and Forking. 856-869 - Bert Lindenhovius, Vladimir Zamdzhiev:
Operator Spaces, Linear Logic and the Heisenberg-Schrödinger Duality of Quantum Theory. 870-883 - Gilles Barthe, Minbo Gao, Theo Wang, Li Zhou:
Complete Quantum Relational Hoare Logics from Optimal Transport Duality. 884-925 - Dominik Kirst, Haoyi Zeng:
The Blurred Drinker Paradox: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem. 926-940
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-23 01:50 CEST 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:
