Sciweavers

10 search results - page 2 / 2
» On the Logical Implication of Multivalued Dependencies with ...
Sort
View
TCS
1998
13 years 5 months ago
Axiomatisation of Functional Dependencies in Incomplete Relations
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
Mark Levene, George Loizou
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 8 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
RSCTC
1993
Springer
96views Fuzzy Logic» more  RSCTC 1993»
13 years 10 months ago
Trusting an Information Agent
: While the common kinds of uncertainties in databases (e.g., null values, disjunction, corrupt/missing data, domain mismatch, etc.) have been extensively studied, a relatively une...
Hasan M. Jamil, Fereidoon Sadri
POPL
1997
ACM
13 years 10 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones
IOR
2006
177views more  IOR 2006»
13 years 6 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti