linear logic and databases
This message is to announce a work on database updates
and linear logic. The paper is entitled :
CONSISTENCY PRESERVING UPDATES
and the authors are N.Bidoit (University Paris 13),
S. Cerrito and C. Froidevaux (University Paris 11).
The paper will appear in the proceedings of :
WORKSHOP ON UNCERTAINTY ON DATABASES AND DEDUCTIVE SYSTEMS
November 17, following Int. Logic Programming Symposium,
Ithaca, NY, USA.
The aim of this paper is to propose linear logic as
a proof system allowing to perform updates of
deductive 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. an update of a ``consistent" database
will produce a new base which is always
The calculus of the ``static" semantics
of a database DB turns out to be the construction
of a proof in a given linear logical theory Th(DB).
Similarly, the calculus of the ``update"
semantics of DB w.r.t. the insertion
of a literal L, is the construction
of a proof in Th(DB).
N. Bidoit (Univ. Paris 13)
S. Cerrito (Univ. Paris 11)
C. Froidevaux (Univ. Paris 11).