We provide a rewriting technique of Warded Datalog+/− settings to sustain decidability and data tractability of reasoning tasks in the presence of existential quantification and recursion. To achieve this behaviour in practice, reasoners implement specialized strategies which exploit the theoretical bases of the language to control the effects of recursion, ensuring reasoning termination with small memory footprint. However, as a necessary condition for such exploitation, the setting is required to be in a “normalized form”, essentially without joins on variables affected by existential quantification. We present the Harmful Join Elimination, a normalization algorithm of Warded Datalog+/− that removes such “harmful” joins, supporting the tr...
International audienceWe consider existential rules (aka Datalog+) as a formalism for specifying ont...
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of ...
Datalog is a powerful language that can be used to represent explicit knowledge and compute inferenc...
We provide a rewriting technique of Warded Datalog+/− settings to sustain decidability and data trac...
Over the past years, there has been a resurgence of Datalog-based systems in the database community ...
Vadalog is a system for performing complex reasoning tasks such as those required in advanced knowle...
Dottorato di Ricerca in Matematica ed Informatica, Ciclo XXV, a.a. 2011-2012Ontologies and rules pla...
Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently s...
Datalog^E is the extension of Datalog with existential quantification. While its high expressive pow...
Datalog is a prominent knowledge representation language whose popularity is mainly due to its abili...
International audienceWe address the issue of Ontology-Based Data Access which consists of exploitin...
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates ...
Datalog±is a Datalog-based language family enhanced with existential quantification in rule heads, e...
Reasoning in systems integrating Description Logics (DL) ontologies and Datalog rules is a very hard...
This paper summarizes results on a recently introduced family of Datalog-based languages, called Dat...
International audienceWe consider existential rules (aka Datalog+) as a formalism for specifying ont...
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of ...
Datalog is a powerful language that can be used to represent explicit knowledge and compute inferenc...
We provide a rewriting technique of Warded Datalog+/− settings to sustain decidability and data trac...
Over the past years, there has been a resurgence of Datalog-based systems in the database community ...
Vadalog is a system for performing complex reasoning tasks such as those required in advanced knowle...
Dottorato di Ricerca in Matematica ed Informatica, Ciclo XXV, a.a. 2011-2012Ontologies and rules pla...
Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently s...
Datalog^E is the extension of Datalog with existential quantification. While its high expressive pow...
Datalog is a prominent knowledge representation language whose popularity is mainly due to its abili...
International audienceWe address the issue of Ontology-Based Data Access which consists of exploitin...
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates ...
Datalog±is a Datalog-based language family enhanced with existential quantification in rule heads, e...
Reasoning in systems integrating Description Logics (DL) ontologies and Datalog rules is a very hard...
This paper summarizes results on a recently introduced family of Datalog-based languages, called Dat...
International audienceWe consider existential rules (aka Datalog+) as a formalism for specifying ont...
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of ...
Datalog is a powerful language that can be used to represent explicit knowledge and compute inferenc...