804 search results - page 41 / 161 » On the Termination of the Chase Algorithm |
100
Voted
OPODIS
2003
15 years 1 months ago
2003
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
123
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
106
click to vote
ITP
2010
14 years 10 months ago
2010
Using HOL4, we mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other fo...
115
Voted
STOC
2003
ACM
16 years 23 days ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
129
Voted
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...