A b s t r a c t. In this paper we shall study some extensions of the semilattice based deductive systems S (N) and S (N, 1), where N is the variety of bounded distributive lattices with a negation operator. We shall prove that S (N) and S (N, 1) are the deductive systems generated by the local consequence relation and the global consequence relation associated with ¬-frames, respectively. Using...

This paper presents an extension to deductive databases, called quantified deductive databases, that incorporates universally quantified expressions (in coded form) in the body of rules. Since universally quantified expressions contain negations in their semantics, quantified deductive databases fall under the category of deductive databases with negation. Furthermore, depending on other factor...

A sound and complete view update procedure for a probabilistic deductive database is formulated using SLDp derivation trees introduced by Ng and Subrahmanian in 8]. In order to reduce the number of valid translations that can satisfy an update request a preference criteria is proposed. Moreover, we introduce a method called-factor to minimize the change eeected by updates in the database.