A New Decidable Class of Tuple Generating Dependencies: The Triangularly-Guarded Class

04/17/2018
by   Vernon Asuncion, et al.
0

In this paper we introduce a new class of tuple-generating dependencies (TGDs) called triangularly-guarded TGDs, which are TGDs with certain restrictions on the atomic derivation track embedded in the underlying rule set. We show that conjunctive query answering under this new class of TGDs is decidable. We further show that this new class strictly contains some other decidable classes such as weak-acyclic, guarded, sticky and shy, which, to the best of our knowledge, provides a unified representation of all these aforementioned classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2018

A New Finitely Controllable Class of Tuple Generating Dependencies: The Triangularly-Guarded Class

In this paper we introduce a new class of tuple-generating dependencies ...
research
04/19/2018

Loop Restricted Existential Rules and First-order Rewritability for Query Answering

In ontology-based data access (OBDA), the classical database is enhanced...
research
04/21/2020

GGDs: Graph Generating Dependencies

We propose Graph Generating Dependencies (GGDs), a new class of dependen...
research
09/26/2019

Compound vectors of subordinators and their associated positive Lévy copulas

Lévy copulas are an important tool which can be used to build dependent ...
research
04/16/2019

Unification and combination of iterative insertion strategies with rudimentary traversals and failure

We introduce a new class of extensions of terms that consists in navigat...
research
08/23/2018

Reflected maxmin copulas and modelling quadrant subindependence

Copula models have become popular in different applications, including m...
research
06/29/2021

(S,N,T)-Implications

In this paper we introduce a new class of fuzzy implications called (S,N...

Please sign up or login with your details

Forgot password? Click here to reset