A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
[chapter]
2002
Lecture Notes in Computer Science
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by Boolean combinations of polynomial inequalities. We are in particular interested in deciding the termination of the evaluation of queries expressible in these transitive-closure logics. It turns out that termination is undecidable in general. However, we show that the termination of the transitive closure of a
doi:10.1007/3-540-36285-1_13
fatcat:6bbrpopslzb2nlqr7yuxrrcrx4