Linear logic for deductive databases

This paper deals with deductive databases in linear logic. The semantics of queries, views, constraints, and (view) updates are defined declaratively in linear logic. In contrast to classical logic, we fan formalise non-share d view, transition constraints, and (view) updates easily. Various proof se arch 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 le gal update in a given relation. We also defined formally the update princip les and showed the correctness of the update translation algorithms. In thi s approach, we provide virtual view updates along with real view updates, a nd view DELETIONs are special cases of view REPLACEMENTs. This permits thre e transactional view update operations (INSERTION, DELETION, REPLACEMENT) i n comparison to only (INSERTION, DELETION) in most existing systems.