An operation for restricting deductive databases represented as logic programs is introduced. The constraints are coded in a separate database, and the operator puts the two databases together in order to provide a restricted view of the original database. The operator is given a semantics in terms of the immediate consequence operator. Then a transformational implementation is given and its correctness is proved with respect to the abstract semantics. The approach is presented at first for positive programs and it is then extended to take negation as failure into account
Applying restriction constraints to deductive databases
Asirelli P;Renso C;Turini F
1997
Abstract
An operation for restricting deductive databases represented as logic programs is introduced. The constraints are coded in a separate database, and the operator puts the two databases together in order to provide a restricted view of the original database. The operator is given a semantics in terms of the immediate consequence operator. Then a transformational implementation is given and its correctness is proved with respect to the abstract semantics. The approach is presented at first for positive programs and it is then extended to take negation as failure into accountFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
prod_258477-doc_122393.pdf
solo utenti autorizzati
Descrizione: Applying restriction constraints to deductive databases
Tipologia:
Versione Editoriale (PDF)
Dimensione
184.78 kB
Formato
Adobe PDF
|
184.78 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.