2229 search results - page 123 / 446 » The Case for Grounding Databases |
160
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
178
click to vote
CADE
2004
Springer
16 years 5 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
174
click to vote
DEBU
2008
15 years 5 months ago
2008
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
184
click to vote
ICDT
2012
ACM
13 years 7 months ago
2012
ACM
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
120
click to vote
MSS
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper, we consider a decision-maker who tries to learn the distribution of outcomes from previously observed cases. For each observed database of cases the decision-maker ...