Seminars

Links' Seminars and Public Events Add to google calendar
2017
Thu 6th Jul
 all day
Add event to google
ANR Headwork: General Meeting
Show in Google map
Rennes
Fri 16th Jun
 all day
Add event to google

09h15-09h45 Coffee Welcome
09h45-10h30 Michel de Rougemont: Approximate integration of streaming graph edges
10h30-11h15 Florent Cappelli: Understanding the complexity of #SAT using knowledge compilation
11h15-11h45 Yann Strozecki: Enumerating maximal solutions of saturation problems
12h00 Lunch
14h00 Discussion libre
16h00 End
Show in Google map
Inria Lille
Thu 15th Jun
 all day
Add event to google
09h15-09h45 Welcome coffee
09h45-10h30 Pierre Bourhis: Introduction of circuit from database queries
10h30-11h15 Jen Keppeler: Answering FO+MOD queries under updates on bounded degree databases
11h15-12h00 Antoine Amarilli: Enumeration of valuation of circuits
12h00-13h30 Lunch + Café
13h30-14h30 Jan Ramon: Question around IA
14h30-15h15 Ahmet Kara: Covers of Query Results
15h15-15h45 Break
15h45-16h30 Alexandre Vigny: Constant delay enumeration for FO queries over
databases with local bounded expansion

20h00 Dinner at Le Palermo
Show in Google map
Inria Lille
Fri 9th Jun
10:30 am
12:30 pm
Add event to google
Valentin Montmirail: "A Recursive Shortcut for CEGAR: Application to the Modal Logic K Satisfiability Problem"
Counter-Example-Guided Abstraction Refinement (CEGAR) has been very successful in model checking.
Since then, it has been applied to many different problems. It is especially proved to be a highly successful practical approach for solving the PSPACE complete QBF problem. In this paper, we propose a new CEGAR-like approach for tackling PSPACE complete problems that we call RECAR (Recursive Explore and Check Abstraction Refinement). We show that this generic approach is sound and complete. Then we propose a specific implementation of the RECAR approach to solve the modal logic K satisfiability problem. We implemented both CEGAR and RECAR approaches for the modal logic K satisfiability problem within the solver MoSaiC. We compared experimentally those approaches to the state-of-the-art solvers for that problem. The RECAR approach outperforms the CEGAR one for that problem and also compares favorably against the state-of-the-art on the benchmarks considered.
"Lille-Salle B21"
Tue 6th Jun
to Fri 9th Jun
 all day
Add event to google
Visit of Jean-Marc Talbot, Université de Marseille

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

Permanent link to this article: https://team.inria.fr/links/seminars/