Oblivious and Semi-Oblivious Boundedness for Existential Rules

06/15/2020
by   Pierre Bourhis, et al.
0

We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on the oblivious and the semi-oblivious chase variants, we give a characterization of boundedness in terms of FO-rewritability and chase termination. We show that it is decidable to recognize if a set of rules is bounded for several classes and outline the complexity of the problem. This report contains the paper published at IJCAI 2019 and an appendix with full proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2018

On the k-Boundedness for Existential Rules

The chase is a fundamental tool for existential rules. Several chase var...
research
10/04/2018

A Single Approach to Decide Chase Termination on Linear Existential Rules

Existential rules, long known as tuple-generating dependencies in databa...
research
05/05/2014

Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation

Existential rules have been proposed for representing ontological knowle...
research
04/21/2020

Characterizing Boundedness in Chase Variants

Existential rules are a positive fragment of first-order logic that gene...
research
03/22/2023

Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study

The chase procedure is a fundamental algorithmic tool in databases that ...
research
03/10/2021

Bounds on half graph orders in powers of sparse graphs

Half graphs and their variants, such as ladders, semi-ladders and co-mat...
research
03/13/2023

Submatrices with the best-bounded inverses: revisiting the hypothesis

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Z...

Please sign up or login with your details

Forgot password? Click here to reset