Combining Existential Rules and Transitivity: Next Steps

For future work, we are working on identifying a more general class of datalog rewritable existential rules, optimising our rewriting algorithm and implementation, and

Answering conjunctive queries (CQs) over knowledge bases (KBs) containing dis- junctive existential rules is a relevant reasoning task which can be addressed using the disjunctive

This invited talk is based on a long line of research that is still ongoing, and several researchers from different institutions have been involved: Pablo Barcel´o (University

They are used as any other class in our framework, though their particular semantics is expressed in dlgp by the two following dlgp statements that must be present in every

In the second part, we study the extension to existential rules with nonmonotonic negation under stable model semantics, discuss the relevancy of the chase variants for these rules

The notion of transitivity emerges as a property of the whole clause, and functions as a semantic continuum, which makes it necessary to take into consideration various parameters

We will go through many known constructions of zero entropy dynamical systems having a Lebesgue component in the spectrum and show that they or systems “close” to them are not AT..

Regarding existential rules, it is open whether the polynomial combined approach can be applied to the class of linear existential rules (or simply linear rules), that is, assertions