How to decide query containment under constraints using a description logic

Abstract. We present a procedure for deciding (database) query containment under constraints. The technique is to extend the logic DLR with an Abox, and to transform query subsumption problems into DLR Abox satisfiability problems. Such problems can then be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic. We use a simple example to support our hypothesis that this procedure will work well with realistic problems.