Valda Seminar: Bruno Guillon

Bruno Guillon, Inria Lille 3 May 2019, 10:30-11:30 ENS, S16 Finding paths in large data graphs When dealing with large graphs, classical algorithms for finding paths such as Dijkstra’s Algorithm are unsuitable, because they require to perform too many disk accesses. To avoid the cost of these expensive accesses, while…

Continue reading

Valda Seminar: Camille Bourgaux

8 March 2019, 10:30-11:30 ENS, S16 Querying Attributed DL-Lite Ontologies Using Provenance Semirings Attributed description logic is a recently proposed formalism, targeted for graph-based representation formats, which enriches description logic concepts and roles with finite sets of attribute-value pairs, called annotations. One of the most important uses of annotations is…

Continue reading