Publication Date:
1996
abstract:
In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are defined by a set of constraints rules. The declarative sernantics of the constrained database is defined and the given refutatior- procedure is proved corree t and complete for positive range-restricted databases. The extension of the procedure to deal with negation is also out lined.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
Deductive databases
List of contributors:
Asirelli, Patrizia
Book title:
Integrity in Databases