An operation for restricting deductive databases represented as logic programs is introduced. The restrictions are represented in a separate deductive database. The operation is given an abstract semantics in terms of the immediate consequence operator. A transformational implementation is given and its correctness is proved with respect to the abstract semantics.

An operator for composing deductive DB with theories of constraints

Asirelli P;Renso C;Turini F
1995

Abstract

An operation for restricting deductive databases represented as logic programs is introduced. The restrictions are represented in a separate deductive database. The operation is given an abstract semantics in terms of the immediate consequence operator. A transformational implementation is given and its correctness is proved with respect to the abstract semantics.
1995
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
Deductive DB
Database (persistent) programming languages
File in questo prodotto:
File Dimensione Formato  
prod_409359-doc_143897.pdf

solo utenti autorizzati

Descrizione: An operator for composing deductive DB with theories of constraints
Tipologia: Versione Editoriale (PDF)
Dimensione 1.81 MB
Formato Adobe PDF
1.81 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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/364098
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact