Floris Geerts, Bart Kuijpers. On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases. Theoretical Computer Science, 336(1):125-151, 2005. [doi]
@article{GeertsK05,
title = {On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases},
author = {Floris Geerts and Bart Kuijpers},
year = {2005},
doi = {10.1016/j.tcs.2004.10.034},
url = {http://dx.doi.org/10.1016/j.tcs.2004.10.034},
tags = {constraints, termination, logic},
researchr = {https://researchr.org/publication/GeertsK05},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {336},
number = {1},
pages = {125-151},
}