Seminars

Links' Seminars and Public Events Add to google calendar
2017
Fri 2nd Jun
 all day
Add event to google
Visit of Floris Geerts, University of Antwerp
Fri 21st Apr
 all day
Add event to google
Visit of Florent Capelli, London University
Fri 24th Mar
 all day
Add event to google
Visit of Charles Paperman, Université Paris 7
Show in Google map
INRIA Institut National Recherche Informatique Automatique
40 Avenue Halley, 59650 Villeneuve d'Ascq, France
Wed 15th Mar
10:30 am
12:00 pm
Add event to google
Emmanuel Filliot, Université Libre de Bruxelles: "Automata, Logic and Algebra for Word Transductions"

This talk will survey old and recent results about word transductions, i.e. functions mapping (finite) words to words. Connections between automata models (transducers), logic and algebra will be presented. Starting with rational functions, defined by (one-way) finite transducers, and the canonical model of bimachines introduced by Reutenauer and Schützenberger, the talk will also target the more expressive class of functions defined by two-way transducers and their equivalent MSO-based formalism.

"Lille-Salle B21"
Wed 15th Mar
 all day
Add event to google
Visit of Emmanuel Filliot, Université Libre de Bruxelles

Wed 1st Feb
11:00 am
12:30 pm
Add event to google
Pierre Bourhis: The Chase
Show in Google map
Inria Lille
Fri 20th Jan
10:30 am
12:30 pm
Add event to google
Pierre Bourhis: "Tree Automata for Reasoning in Databases and Artificial Intelligence"
In database management, one of the principal task is to optimize the queries to evaluate them efficiently. It is in particular the case for recursive queries for which their evaluation can lead to crawl all the database. In particular, one of the main question is to minimize the queries in order to avoid to evaluate useless parts of the query. The core theoretical question around this line of work is the problem of inclusion of a query in another. Interestedly, this question is related to an important question in IA which is to answer a query when the data is incomplete but rules are given to derive new information. This problem is called certain query answering. In both context, if both problem are undecidable in general, there are fragments based on guardedness that are decidable due to the fact there exists witness of the problems that have a bounded tree width and that their encoding in trees is regular. Furthermore, the queries can be translated in MSO. In both contexts, Courcelle’s Theorems imply the decidability of both problems. I will present to the different results on the translation of logic class of formula for our problems into tree automata to obtain tight bounds to the problems of inclusion of recursive queries or certain query answering.

Show in Google map
Inria Lille
Wed 11th Jan
2:15 pm
3:25 pm
Add event to google
Michael vanden Boom, Oxford University : Decidable fixpoint logics
Fixpoint logics can express dynamic, recursive properties, but often fail to have decidable satisfiability. A notable exception to this is the family of well-behaved "guarded" fixpoint logics,
which subsume a variety of query languages and integrity constraints of interest in databases and knowledge representation. In this talk, I will survey some recent results about these logics.
Show in Google map
Lille B21
Mon 9th Jan
to Fri 13th Jan
 all day
Add event to google
Visite Michael vanden Boom, Oxford University
2016
Fri 9th Dec
 all day
Add event to google
Kickoff Headwork
Show in Google map
Paris MNHN

Lien Permanent pour cet article : https://team.inria.fr/links/fr/seminars/