An Update Procedure for A Probabilistic Deductive Database

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 effected by updates in the database