Sciweavers

10997 search results - page 282 / 2200
» On the Structure of Complete Sets
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
15 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
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...
André Hernich
TARK
2007
Springer
16 years 27 days ago
Robust equilibria under non-common priors
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
Daisuke Oyama, Olivier Tercieux
CORR
2007
Springer
69views Education» more  CORR 2007»
15 years 6 months ago
Lossless Representation of Graphs using Distributions
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
Mireille Boutin, Gregor Kemper
WRLA
2010
15 years 5 months ago
Folding Variant Narrowing and Optimal Variant Termination
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
Santiago Escobar, Ralf Sasse, José Meseguer