From the 1 of 1k papers with an AI index.
29.3k citations
- F. Rossi2 profiles18 · h 27
- S. Tixeuil2 profiles16 · h 35
- Laurent Romary3 profiles15 · h 26
- F. Bach14 · h 108
- Marc Schoenauer2 profiles14 · h 49
- Fabien Mathieu2 profiles10 · h 15
- Konstantin Avrachenkov2 profiles10 · h 41
- M. Fliess2 profiles10 · h 51
- Gaël Varoquaux9
- M. Potop-Butucaru2 profiles9 · h 31
- N. Carbonell2 profiles9 · h 14
- P. Robert9 · h 20
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR121 papers
- Centre National de la Recherche ScientifiqueFR111 papers
- Centre Inria de SaclayFR102 papers
- Centre Inria de l'Université de LilleFR51 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR40 papers
- Centre Inria de l'université de BordeauxFR32 papers
- Université Grenoble AlpesFR32 papers
- Sorbonne UniversitéFR29 papers
- Institut Élie Cartan de LorraineFR28 papers
- Laboratoire de l'Informatique du ParallélismeFR27 papers
- École PolytechniqueFR26 papers
- Laboratoire de Recherche en InformatiqueFR25 papers
9 papers · 2 filters
Distances for Weighted Transition Systems: Games and Properties
Uli Fahrenberg, Claus Thrane, Kim G. Larsen
We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system trac…
Generic Traces and Constraints, GenTra4CP revisited
Pierre Deransart
The generic trace format GenTra4CP has been defined in 2004 with the goal of becoming a standard trace format for the observation of constraint solvers over finite domains. It has…
Nonuniform Coercions via Unification Hints
Claudio Sacerdoti Coen, Enrico Tassi
We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coerci…
Superposition as a logical glue
Andrea Asperti, Enrico Tassi
The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the knowledge of domain specific notation and conventions…
Superdeduction in Lambda-Bar-Mu-Mu-Tilde
Clément Houtmann
Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules…
A Few Considerations on Structural and Logical Composition in Specification Theories
Axel Legay, Andrzej Wąsowski
Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a l…