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.
Cite
CITATION STYLE
Horrocks, I., Sattler, U., Tessaris, S., & Tobies, S. (2000). How to decide query containment under constraints using a description logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1955, pp. 326–343). Springer Verlag. https://doi.org/10.1007/3-540-44404-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
