CLP(AD) as a Deductive Database Language with Updates

In this paper we propose a logic-based language, CLP\((\mathcal{A}\mathcal{D})\) which is an instance of the Constraint Logic Programming schema and is a convenient semantic framework to be used for deductive database language with updates. CLP\((\mathcal{A}\mathcal{D})\) can be seen as an extension of Datalog with base relations updates and the notion of transaction. The semantics of this language is given in two steps and is based on a notion of observable corresponding to the computed answer constraint. Moreover, some useful notions of equivalence between databases with respect to a transaction and between transactions with respect to a database are given.