Conjunctive Query Entailment: Decidable in Spite of O, I, and Q

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Conjunctive Query Entailment: Decidable in Spite of O, I, and Q

Birte GlimmBirte Glimm,  Sebastian RudolphSebastian Rudolph
Birte Glimm, Sebastian Rudolph
Conjunctive Query Entailment: Decidable in Spite of O, I, and Q
In Bernardo Cuenca-Grau, Ian Horrocks, Boris Motik, Ulrike Sattler, eds., Proceedings of the DL Workshop 2009, Oxford, UK, volume 477, July 2009. CEUR Workshop Proceedings
  • KurzfassungAbstract
    In this paper, we present a decidability result for entailment of conjunctive queries (CQs) in the very expressive Description Logic (DL) ALCHOIQb by establishing nite representability of countermodels in case the query given as input is not entailed. Our results also generalize to unions of conjunctive queries, and to SHOIQ and SROIQ provided the query contains only simple roles.
  • Weitere Informationen unter:Other info: Link
  • Forschungsgruppe:Research Group: Computational Logic
@inproceedings{GR2009,
  author    = {Birte Glimm and Sebastian Rudolph},
  title     = {Conjunctive Query Entailment: Decidable in Spite of O, I, and Q},
  editor    = {Bernardo Cuenca-Grau and Ian Horrocks and Boris Motik and Ulrike
               Sattler},
  booktitle = {Proceedings of the {DL} Workshop 2009, Oxford, {UK}},
  volume    = {477},
  publisher = {CEUR Workshop Proceedings},
  year      = {2009},
  month     = {July}
}