Sciweavers

804 search results - page 14 / 161
» On the Termination of the Chase Algorithm
Sort
View
NETWORKS
2011
14 years 29 days ago
On terminal delta-wye reducibility of planar graphs
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...
Isidoro Gitler, Feliu Sagols
DAGSTUHL
2007
14 years 11 months ago
Implementing RPO and POLO using SAT
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...
Peter Schneider-Kamp, Carsten Fuhs, René Th...
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 8 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— 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 ...
Sirin Nitinawarat, Prakash Narayan
CAV
2010
Springer
198views Hardware» more  CAV 2010»
15 years 2 months ago
Termination Analysis with Compositional Transition Invariants
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 ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
WIDM
2003
ACM
15 years 3 months ago
Query rewriting using views in the presence of inclusion dependencies
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...
Qingyuan Bai, Jun Hong, Michael F. McTear