Abstract

The aim of this paper is to propose linear logic as a proof system allowing to perform updates of databases containing incomplete information. In our approach, a database is specified by facts, deduction rules (among which default rules) and update constraints. Updates will always preserve consistency, i.e. any update of a "consistent" database will produce a new base which is "consistent". The calculus of the "static semantics" of a database DB corresponds to the construction of a proof in a logical theory Th(DB) associated to the database. Similarly, the calculus of the "update semantics" of a database DB w.r.t. the insertion of a literal L, is the construction of a proof in Th(DB). Key words : Deductive Databases, Incomplete Information, Linear Logic, Updates. R'esum'e Ce papier propose la logique lin'eaire comme un syst`eme de preuve permettant de mettre `a jour des bases de donn'ees qui contiennent des informations incompl`etes. Selon notre approche, une base de donn'ees est spe...

Citations