All–Instances Termination of Chase is Undecidable

DOI10.1007/978-3-662-43951-7_25zbMath1409.68083arXiv1401.4840OpenAlexW300076026MaRDI QIDQ5167846

Tomasz Gogacz, Jerzy Marcinkowski

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4840

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Invited Talk: Coherentisation of First-Order Logic ⋮ Reasoning about integrity constraints for tree-structured data ⋮ On the k-Boundedness for Existential Rules ⋮ Uniform Restricted Chase Termination ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Semi-oblivious chase termination: the sticky case ⋮ Characterizing Boundedness in Chase Variants ⋮ A Single Approach to Decide Chase Termination on Linear Existential Rules

This page was built for publication: All–Instances Termination of Chase is Undecidable