Volume 6: January - December 1996

Issue 3: June 1996

Abstract


A linear logic approach to consistency preserving updates

  • A linear logic approach to consistency preserving updates
  • N. Bidoit1, S. Cerrito2 and C. Froidevaux2 1LIPN, URA 1507 CNRS, Universite de Paris-Nord, Villetaneuse, F-93430, France. Email: bidoit@ural1507.univ-paris13.fr and 2LRI, URA 410 CNRS, at. 490, Universite de Paris-Sud, Orsay, F-91405, France. Email: {serena, chris}@lri.fr

    ABSTRACT

    The aim of this paper is to propose linear logic as a proof system allowing one 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 computation of the 'static semantics' of a database DB corresponds to the construction of a proof in a logical theory associated to the database; the non logical axioms of such a theory are linear sequents formalising the deduction rules and the update constraints of DB. 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 the very same linear theory.

    Keywords: deductive databases, incomplete information, linear logic, updates.

    Pages: 439 - 463

    Part of the OUP Journal of Logic and Computation WWW service


    General Information

    Click here to register with OUP.

    This page is maintained by OUP admin

    Last updated 23 Jul 96

    Part of the OUP Journals World Wide Web service.


    Copyright Oxford University Press, 1996