• Aucun résultat trouvé

Keynote at AImWD2013

N/A
N/A
Protected

Academic year: 2022

Partager "Keynote at AImWD2013"

Copied!
1
0
0

Texte intégral

(1)

AImWD-2013 Invited Talk: Jean-François Baget

Title:

Ontologies and large databases: querying algorithms for the Web of Data Abstract:

In terms of KR languages, the Web of Data can be seen as a huge (distributed) triple store (i.e. a database), along with ontologies (written in some OWL fragment) that can be used either to infer additional knowledge or to establish alignments. In this presentation, we will use Datalog+/- as a unifying framework to present the querying problem in the Web of Data.

Even with an empty ontology, this problem is NP-complete (though in AC0 in terms of data complexity). Along our talk, we will explore various fragments of Datalog+/- (and their correspondence with description logics), different families of algorithms used to solve that querying problem, and outline the difficulties brought by the need to query huge databases.

Références

Documents relatifs

With this workshop, our goal is to contribute to the birth of a community having a shared interest around publishing data on the Web, exploring and reasoning

Secondly, I illustrate how retrieval methods taking account of place can be developed using such insights, and discuss some successes (and failures!) in work developing

In particular, we show how to invert the subs predicate (either subs el or subs aln ), so that not only it can check for the existence of subsumption relations between ground

The problem of determining the movement pattern for a certain number of flying robots when they have to film an event while maximizing viewer satisfaction and minimizing the

Logic Programming (LP) (14) and the family of Description Logics (DLs) (1) are both based on fragments of First Order Logic (FOL).. However, they are characterized by differ-

The idea is that through the virtualization of physical objects, even (digital or non-digital) objects which are not natively accessible and inclusive, can become accessible if

The translation remains correct if we replace all closed specifiers by open specifiers, since the translated knowledge base admits a least model where all annotation sets

In fact, we report here a simplified version of the translation in [1], which is a polynomial translation of instance queries mediated by ALCHOI TBoxes with closed predicates