Integrity constraints as views in deductive databases

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.