804 search results - page 35 / 161 » On the Termination of the Chase Algorithm |
148
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
96
Voted
ICLP
1993
Springer
15 years 4 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
CADE
2006
Springer
16 years 23 days ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
85
Voted
CATA
2003
15 years 1 months ago
2003
The imprecise computation model provides the ability to cope with unpredictable workloads. However, there is no consistent way on how to terminate the computation in its early sta...
106
click to vote
CORR
2008
Springer
15 years 16 days ago
2008
Springer
In Constructive Type Theory, recursive and corecursive definitions are subject to syntactic restrictions which guarantee termination for recursive functions and productivity for c...