Declarative semantics for revision programming and connections to active integrity constraints

We investigate revision programming, a formalism to describe constraints on belief sets (databases, knowledge bases), and to specify preferred ways to enforce them. We propose several semantics for revision programs combining ideas from logic programming and active integrity constraints, a formalism to model preferred ways to enforce integrity constraints on databases. We present results on the complexity of the semantics we introduce. We also show that all these semantics are invariant under "shifting". Finally, we prove that from the perspective of a broad semantic landscape of revision programming, there is a direct correspondence between revision programs and active integrity constraints. © 2008 Springer-Verlag Berlin Heidelberg.