Closed world chasing
Gösta Grahne, Adrian Onet · 2011
We give a new closed world semantics for data exchange called constructible solutions semantics, and argue that this semantics is well suited for answering non-monotonic queries in data exchange. We show that the space of constructible solutions can be represented by conditional tables obtainable trough a novel conditional chase procedure which generalizes the classical chase.