Conservative Extensions for Existential Rules

02/11/2022
by   Jean Christoph Jung, et al.
0

We study the problem to decide, given sets T1,T2 of tuple-generating dependencies (TGDs), also called existential rules, whether T2 is a conservative extension of T1. We consider two natural notions of conservative extension, one pertaining to answers to conjunctive queries over databases and one to homomorphisms between chased databases. Our main results are that these problems are undecidable for linear TGDs, undecidable for guarded TGDs even when T1 is empty, and decidable for frontier-one TGDs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2020

Conservative Extensions in Horn Description Logics with Inverse Roles

We investigate the decidability and computational complexity of conserva...
research
11/02/2018

Holant clones and the approximability of conservative holant problems

We construct a theory of holant clones to capture the notion of expressi...
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
01/03/2021

The structure of conservative gradient fields

The classical Clarke subdifferential alone is inadequate for understandi...
research
05/07/2020

Inference with Choice Functions Made Practical

We study how to infer new choices from previous choices in a conservativ...
research
09/15/2018

Neural Networks and Quantifier Conservativity: Does Data Distribution Affect Learnability?

All known natural language determiners are conservative. Psycholinguisti...
research
05/10/2018

Computational Social Choice Meets Databases

We develop a novel framework that aims to create bridges between the com...

Please sign up or login with your details

Forgot password? Click here to reset