On the k-Boundedness for Existential Rules

10/22/2018
by   Stathis Delivorias, et al.
0

The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls. Given a chase variant, the halting problem takes as input a set of existential rules and asks if this set of rules ensures the termination of the chase for any factbase. It is well-known that this problem is undecidable for all known chase variants. The related problem of boundedness asks if a given set of existential rules is bounded, i.e., whether there is a predefined upper bound on the number of (breadth-first) steps of the chase, independently from any factbase. This problem is already undecidable in the specific case of datalog rules. However, knowing that a set of rules is bounded for some chase variant does not help much in practice if the bound is unknown. Hence, in this paper, we investigate the decidability of the k-boundedness problem, which asks whether a given set of rules is bounded by an integer k. We prove that k-boundedness is decidable for three chase variants, namely the oblivious, semi-oblivious and restricted chase.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2020

Characterizing Boundedness in Chase Variants

Existential rules are a positive fragment of first-order logic that gene...
research
06/15/2020

Oblivious and Semi-Oblivious Boundedness for Existential Rules

We study the notion of boundedness in the context of positive existentia...
research
11/14/2018

Bounded ACh Unification

We consider the problem of unification modulo an equational theory ACh, ...
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
05/11/2020

Restricted Chase Termination for Existential Rules: a Hierarchical Approach and Experimentation

The chase procedure for existential rules is an indispensable tool for s...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset