101 search results - page 3 / 21 » On completely nonmeasurable unions |
COCOA
2009
Springer
14 years 22 days ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Subtyping rules can be fairly complex for union types, due to interactions with other types, such as function types. Furthermore, these interactions turn out to depend on the calc...
EDBT
2002
ACM
14 years 9 months ago
2002
ACM
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
RTA
1991
Springer
14 years 9 days ago
1991
Springer
A term rewriting system is called complete if it is both confluent and strongly norrealizing. Barendregt and Klop showed that the disjoint union of complete term rewriting systems...