Data complexity of answering conjunctive queries over SHIQ knowledge bases

@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}
}
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 yields suffices to check query entailment. The algorithm we propose consists on applying a similar technique to the tableaux algorithm in [4… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Donini , and Andrea Schaerf . Decidable Reasoning in Terminological Knowledge Representation Systems

Martin Buchheit, M Francesco
Journal of Artificial Intelligence Research • 1993