Corpus ID: 3264406

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={ArXiv},
  year={2005},
  volume={abs/cs/0507059}
}
  • Magdalena Ortiz, Diego Calvanese, +1 author Enrico Franconi
  • Published 2005
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING

    Topics from this paper.

    On the virtues of going all the way
    4
    Foundations of Fuzzy Logic and Semantic Web Languages
    78
    Querying Description Logic Knowledge Bases
    11

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Reasoning with Individuals for the Description Logic SHIQ
    313
    Decidable Reasoning in Terminological Knowledge Representation Systems
    256
    Data Complexity of Query Answering in Description Logics
    456
    Data Complexity of Reasoning in Very Expressive Description Logics
    253
    Levy and Marie-Christine Rousset
    20
    Foundations of Databases
    3818
    Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Seman
    28