804 search results - page 14 / 161 » On the Termination of the Chase Algorithm |
215
click to vote
NETWORKS
2011
14 years 8 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
151
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
139
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
160
click to vote
WIDM
2003
ACM
15 years 11 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...