Conservative Extensions for Existential Rules

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.

Authors

• Jean Christoph Jung TU Dortmund University
• Carsten Lutz Leipzig University
• Jerzy Marcinkowski

Keywords

• Applications of KR in databases
• Computational aspects of knowledge representation
• Ontology formalisms and models
• Ontology-based data access, integration, and exchange