Séminaire de l'équipe Méthodes et Modèles Formelles (M2F)

LaBRI, Bordeaux

Le séminaire M2F a lieu en salle 178 un mardi sur deux à 14H.

Pour proposer un séminaire, le calendrier vous aidera à choisir une date disponible.

Pour s'abonner ou se désabonner de la liste de diffusion.

Pour s'inscrire au calendrier de l'équipe M2F.


Prochains exposés

DateOrateurTitreHybride / Virtuel
mardi 21 févrierBalder ten CateData examples for conjunctive queriesHybride
Data examples can be a useful tool when a formal specification must be synthesized or communicated. They sometimes provide a more convenient medium for communication than the formal specification itself. We all know this from daily life: think about teaching someone a card game. Simply reading out loud the rules of the game is not an effective way of doing this. Instead, what works best in practice is to give examples of valid and invalid game plays. In data management, data examples have been proposed and used in the context of the interactive design of schema mappings, as well as query synthesis, and query refinement and debugging. In knowledge representation, data examples arise, for instance, in the context of algorithms for learning concept expressions and ontologies. The talk will be about data examples for conjunctive queries, and we will cover some fundamental questions, such as: (a) when can a given query be uniquely characterized by a small number of data examples (where a data example is a database instance satisfying given integrity constraints), and (b) how to construct, from a given set of data examples, a "good" fitting query (for various notions of goodness). To answer these questions, we draw on, and refine, techniques from the literature on combinatorial graph theory and constraint satisfaction problems.
mardi 14 marsTBATBAHybride
TBA
mardi 21 marsFrançois SchwartzentruberOverview on Connected Multi-agent path findingHybride
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model an area by a topological graph specifying the movement and the connectivity constraints of the agents. In the first part of the talk, we study the theoretical complexity of the reachability and the coverage problems of a fleet of connected agents. We also introduce a new class called sight-moveable graphs which admit efficient algorithms. In the second part, we discuss several algorithms to solve connected multi-agent path finding.



Calendrier de l'équipe




Archives des années précédentes

Exposés passés depuis 2017.




Responsables

Igor Walukiewicz, Corto Mascle