Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Last revision Both sides next revision | ||
public:seminars_manifestations [2016/11/23 00:25] fmichel |
public:seminars_manifestations [2017/03/08 10:12] fmichel |
||
---|---|---|---|
Line 5: | Line 5: | ||
**SPARKS public calendar**: in [[https://calendar.google.com/calendar/embed?src=6qaafnv87osnqct6hb4ruskkcc%40group.calendar.google.com&ctz=Europe/Paris|HTML]] or in [[https://calendar.google.com/calendar/ical/6qaafnv87osnqct6hb4ruskkcc%40group.calendar.google.com/public/basic.ics|iCal]]. | **SPARKS public calendar**: in [[https://calendar.google.com/calendar/embed?src=6qaafnv87osnqct6hb4ruskkcc%40group.calendar.google.com&ctz=Europe/Paris|HTML]] or in [[https://calendar.google.com/calendar/ical/6qaafnv87osnqct6hb4ruskkcc%40group.calendar.google.com/public/basic.ics|iCal]]. | ||
+ | |||
+ | ====== 2017 ====== | ||
+ | |||
+ | ===== Séminaires ===== | ||
+ | |||
+ | ==== Marie-Christine ROUSSET: Datalog revisited for reasoning in Linked Data ==== | ||
+ | When: 3rd March 2017, 10h00 \\ | ||
+ | Where: POLYTECH, Templiers 2, room 307\\ | ||
+ | |||
+ | **Abstract**\\ | ||
+ | Linked Data provides access to huge, continuously growing | ||
+ | amounts of open data and ontologies in RDF format that describe | ||
+ | entities, links and properties on those entities. Equipping Linked Data | ||
+ | with inference paves the way to make the Semantic Web a reality. In this | ||
+ | presentation, I will describe a unifying framework for RDF ontologies | ||
+ | and databases that we call deductive RDF triplestores. It consists in | ||
+ | equipping RDF triplestores with Datalog inference rules. This rule | ||
+ | language allows to capture in a uniform manner OWL constraints that are | ||
+ | useful in practice, such as property transtivity or symmetry, but also | ||
+ | domain-specific rules with practical relevance for users in many domains | ||
+ | of interest. I will illustrate the expressivity of this framework for | ||
+ | modeling Linked Data applications and its genericity for developing | ||
+ | inference algorithms. In particular, we will show how it allows to model | ||
+ | the problem of data linkage in Linked Data as a reasoning problem on | ||
+ | possibly decentralized data. I will also explain how it makes possible | ||
+ | to efficiently extract expressive modules from Semantic Web ontologies | ||
+ | and databases with formal guarantees, whilst effectively controlling | ||
+ | their succinctness. Experiments conducted on real-world datasets have | ||
+ | demonstrated the feasibility of this approach and its usefulness in | ||
+ | practice for data integration and information extraction. | ||
+ | ===== Soutenances ===== | ||
+ | |||
+ | ==== PhD Thesis Defense - Franck MICHEL ==== | ||
====== 2016 ====== | ====== 2016 ====== | ||
Line 50: | Line 83: | ||
===== Soutenances ===== | ===== Soutenances ===== | ||
- | |||
==== PhD Thesis Defense - Atheer AL-NAJDI ==== | ==== PhD Thesis Defense - Atheer AL-NAJDI ==== |