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.
Integrity constraints as views in deductive databases
Asirelli P;
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_411536-doc_144923.pdf
solo utenti autorizzati
Descrizione: Integrity constraints as views in deductive databases
Tipologia:
Documento in Pre-print
Dimensione
1.42 MB
Formato
Adobe PDF
|
1.42 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
