11017 search results - page 2029 / 2204 » Closure Systems and their Structure |
321
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
216
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
200
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
291
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
327
Voted
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...