Data complexity of answering conjunctive queries over SHIQ knowledge bases
<|reference_start|>Data complexity of answering conjunctive queries over SHIQ knowledge bases: An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning with individuals in SHIQ. The blocking conditions of the tableau are weakened in such a way that the set of models the modified algorithm yields suffices to check query entailment. The modified blocking conditions are based on the ones proposed by Levy and Rousset for reasoning with Horn Rules in the description logic ALCNR.<|reference_end|>
@article{de la fuente2005data,
    title={Data complexity of answering conjunctive queries over SHIQ knowledge
  bases},
    author={M. Magdalena Ortiz de la Fuente, Diego Calvanese, Thomas Eiter and
  Enrico Franconi},
    journal={arXiv preprint arXiv:cs/0507059},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0507059},
    primaryClass={cs.LO cs.AI cs.CC}
}