Inproceedings2008
Conjunctive Query Entailment: Decidable in Spite of O, I, and Q
Conjunctive Query Entailment: Decidable in Spite of O, I, and Q
Published: 2009
Juli
Herausgeber: Ian Horrocks, Bernardo Cuenca-Grau, Boris Motik
Buchtitel: Proceedings of the DL Workshop 2009, Oxford, UK
Verlag: CEUR Workshop Proceedings
Referierte Veröffentlichung
BibTeX
Kurzfassung
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.
Wissensrepräsentation, Wissensrepräsentationssprachen, Beschreibungslogik, Entscheidbarketisprobleme, Modelltheorie, Logik, Theoretische Informatik