How to decide Query Containment under Constraints using a Description Logic

Ian HorrocksIan Horrocks, Ulrike SattlerUlrike Sattler, Sergio TessarisSergio Tessaris, Stephan TobiesStephan Tobies

Datei:HorSatTesTob-LPAR-2000.ps.gz

Download

Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies
How to decide Query Containment under Constraints using a Description Logic
In Andrei Voronkov, eds., Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR'2000), Lecture Notes in Artificial Intelligence, 2000. Springer

Details
Bibtex

KurzfassungAbstract
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.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ HorSatTesTob-LPAR-2000,
  author = {I. {Horrocks} and U. {Sattler} and S. {Tessaris} and S. {Tobies}},
  booktitle = {Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning {(LPAR'2000)}},
  editor = {Andrei {Voronkov}},
  number = {1955},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {How to decide Query Containment under Constraints using a Description Logic},
  year = {2000},
}