In the field of logic databases the static semantics and the evaluation of queries is well understood. However there is no consensus about the appropriate treatment of dynamic behaviour, i.e. the evolution of the database with time. Various methods to incorporate update constructs into logic databases have been proposed. In this paper we address the explicit construction of (complex) update programs from basic update operations like "insert tuple" and "delete tuple". The main contribution is the definition of a logical semantics that is based on sets of deferred update requests. We propose a logic language that allows to express not only the concurrent and sequential composition of update operations but also set-oriented updates or bulk updates.
Ulrike Peiker, Martin Griebl