From the 1 of 5.5k papers with an AI index.
- Centre National de la Recherche ScientifiqueFR1.7k papers
- Centre Inria de SaclayFR364 papers
- École PolytechniqueFR306 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR300 papers
- École Normale Supérieure - PSLFR292 papers
- Sorbonne UniversitéFR291 papers
- École Normale Supérieure de LyonFR233 papers
- Centre Inria de l'Université Grenoble AlpesFR216 papers
- Université Paris-SaclayFR208 papers
- Université Grenoble AlpesFR204 papers
- Lyon 1 UniversitéFR191 papers
- Centre Inria d'Université Côte d'AzurFR183 papers
329 papers · 1 filter
Antichains for Concurrent Parameterized Games
Nathalie Bertrand, Patricia Bouyer, Gaëtan Staquet
Concurrent parameterized games involve a fixed yet arbitrary number of players. They are described by finite arenas in which the edges are labeled with languages that describe the…
Bidirectional Interpolation for the Lambda-Calculus: Revisiting and Formalising Craig-Čubrić Interpolation
Meven Lennon Bertrand, Alexis Saurin
Craig's Interpolation theorem has a wide range of applications, from mathematical logic to computer science. Proof-theoretic techniques for establishing interpolation usually follo…
Quantum Petri Nets with Event Structure semantics
Julien Saan Joachim, Marc de Visme, Stefan Haar +1
Classical Petri nets provide a canonical model of concurrency, with unfolding semantics linking nets, occurrence nets, and event structures. No comparable framework exists for quan…
Quantum Petri Nets with Event Structures semantics
Julien Saan Joachim, Marc de Visme, Stefan Haar
Classical Petri nets provide a canonical model of concurrency, with unfolding semantics linking nets, occurrence nets, and event structures. No comparable framework exists for quan…
Restricted Chase Termination: You Want More than Fairness
David Carral, Lukas Gerlach, Lucas Larroque +1
The chase is a fundamental algorithm with ubiquitous uses in database theory. Given a database and a set of existential rules (aka tuple-generating dependencies), it iteratively ex…
Classical notions of computation and the Hasegawa-Thielecke theorem (extended version)
Éléonore Mangel, Paul-André Melliès, Guillaume Munch-Maccagnoni
In the spirit of the Curry-Howard correspondence between proofs and programs, we define and study a syntax and semantics for classical logic equipped with a computationally involut…