All–Instances Termination of Chase is Undecidable
From MaRDI portal
Publication:5167846
DOI10.1007/978-3-662-43951-7_25zbMath1409.68083arXiv1401.4840MaRDI 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
68P15: Database theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
