Recherche
Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic
In this talk, we focus on unary temporal logic over words (UTL). It is known that languages definable in this logic have several equivalent
Petri nets constitute a well-studied model to verify and study concurrent systems, among others, and computing the coverability set is one of the most
/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type
This talk presents the work I did during my thesis, which I completed in March. Petri nets are a classic formal model for concurrent systems
Akka Zemari (LaBRI) Title: (Online) Continual Learning Abstract: In real-world supervised learning, training data is often unavailable simultaneously
For a fixed graph H, the H-coloring problem takes as an instance a graph G and asks whether there exists a homomorphism from G to H, i.e., a mapping f
We aim at designing both theoretically and experimentally methods for the automatic detection of potential bugs in software – or the proof of the
Quantum physics and chemistry have provided well-recognized theoretical tools to predict the behavior of molecules and materials described by the
We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the