Data complexity of answering conjunctive queries over SHIQ knowledge bases

Abstract

In [6] the authors give an algorithm for answering conjunctive queries over ALCN R knowledge bases which is coNP in data complexity. Their technique is based on the tableau technique for checking sat-isfiability in ALCN R presented in [2]. In their algorithm, the blocking conditions of [2] are weakened in such a way that the set of models their algorithm… (More)

Topics

Cite this paper

@article{Ortiz2005DataCO, title={Data complexity of answering conjunctive queries over SHIQ knowledge bases}, author={Magdalena Ortiz and Diego Calvanese and Thomas Eiter and Enrico Franconi}, journal={CoRR}, year={2005}, volume={abs/cs/0507059} }