804 search results - page 15 / 161 » On the Termination of the Chase Algorithm |
TOPLAS
2008
14 years 10 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
ACL
2011
14 years 1 months ago
2011
We present an SCFG binarization algorithm that combines the strengths of early terminal matching on the source language side and early language model integration on the target lan...
TACAS
2010
Springer
15 years 5 months ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
ADBIS
2001
Springer
15 years 2 months ago
2001
Springer
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
103
click to vote
WFLP
2009
Springer
15 years 4 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...