PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Asirelli P., Inverardi P., Plagenza G. Correctness and completeness of the SRP_IC refutation procedure. Technical report, 1996.
 
 
Abstract
(English)
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.
Subject SRP_IC refutation procedure
F.4.1 Mathematical Logic: Model theory
F.4.1 Mathematical Logic: Proof theory
F.4.1 Mathematical Logic: Logic and constraint programming
I.2.3 Deduction and Theorem Proving: Deduction
I.2.3 Deduction and Theorem Proving: Resolution
H.2.0 General: Security, integrity, and protection


Icona documento 1) Download Document PS
Icona documento 2) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional