Incomplete transaction can be supported in databases by enabling administrators to express update policies that complete incomplete transactions. In this paper, we propose a language for expressing such update policies. We show that the problem of verifying whether or not a policy is sound and complete is undecidable in general. We identify decidable instances of this decision problem, and for ...