Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Thomazo, Michael"'
Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common assumption is th
Externí odkaz:
http://arxiv.org/abs/2206.03124
Data provenance consists in bookkeeping meta information during query evaluation, in order to enrich query results with their trust level, likelihood, evaluation cost, and more. The framework of semiring provenance abstracts from the specific kind of
Externí odkaz:
http://arxiv.org/abs/2202.10766
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable
Externí odkaz:
http://arxiv.org/abs/2107.07811
In this paper, we consider existential rules, an expressive formalism well suited to the representation of ontological knowledge and data-to-ontology mappings in the context of ontology-based data integration. The chase is a fundamental tool to do re
Externí odkaz:
http://arxiv.org/abs/2107.06054
Publikováno v:
Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI 2020), 2020, Yokohama, Japan
Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communities for more than a decade. The vast majority of work on OMQA focuses
Externí odkaz:
http://arxiv.org/abs/2009.09801
Publikováno v:
28th International Joint Conference on Artificial Intelligence (IJCAI-19), Aug 2019, Macau, China
Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings. Data sources often contain sensitive information, and thus an analysis is needed to verify
Externí odkaz:
http://arxiv.org/abs/1906.00624
Existential rules, long known as tuple-generating dependencies in database theory, have been intensively studied in the last decade as a powerful formalism to represent ontological knowledge in the context of ontology-based query answering. A knowled
Externí odkaz:
http://arxiv.org/abs/1810.02132
Publikováno v:
Information and Computation 265 (2019) 77-93
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite
Externí odkaz:
http://arxiv.org/abs/1705.02813
Publikováno v:
Information and Computation, 255, Part 1, 177-192, 2017
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it accepts all
Externí odkaz:
http://arxiv.org/abs/1609.03460
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We focus in this
Externí odkaz:
http://arxiv.org/abs/1412.4485