|
Abstract : |
Abstract. We lay the foundations of a theory of constraint databases with indefinite information based on the relational model. We develop the scheme of indefinite L-constraint databases where L, the parameter, is a first-order constraint language. This scheme extends the proposal of Kanellakis, Kuper and Revesz to include indefinite information in the style of Imielinski and Lipski. We propose declarative and procedural query languages for the new scheme and study the semantics of query evaluation. 1, |
