In this paper we present a refutation procedure to compute goals in a deductive database ac- cording to particular views of it. Views are de ned by a set of constraints rules. The declarative semantics of the constrained database is de ned and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation is also outlined.
Correctness and completeness of the SRP_IC refutation procedure
Asirelli P;
1996
Abstract
In this paper we present a refutation procedure to compute goals in a deductive database ac- cording to particular views of it. Views are de ned by a set of constraints rules. The declarative semantics of the constrained database is de ned and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation is also outlined.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_408395-doc_143302.pdf
accesso aperto
Descrizione: Correctness and completeness of the SRP_IC refutation procedure
Dimensione
251.6 kB
Formato
Adobe PDF
|
251.6 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
