Linear logic for deductive databases

Abstract

This paper deals with deductive databases in linear logic. The semantics of queries, views, constraints, and (view) updates are defined deelaratively in linear logic. In contrast to classical logic, we can formalise non-shared view, transition constraints, and (view) updates easily. Various proof search strategies are presented along with an algorithm for query evaluation from a bottom-up direction. An additional advantage is that the associated meaning of a given relation can be defined in terms of the validity of a legal update in a given relation. We also defined formally the update principles and showed the correctness of the update translation algorithms. In this approach, we provide virtual view updates along with real view updates, and view DELETIONs are special cases of view REPLACEMENTs. This permits three transactional view update operations (INSERTION, DELETION, RE-PLACEMENT) in comparison to only (INSERTION, DELETION) in most existing systems.