Data complexity of answering conjunctive queries over SHIQ knowledge bases

Details Data complexity of answering conjunctive queries over SHIQ knowledge bases Data complexity of answering conjunctive queries over SHIQ knowledge bases

2005-07-22

arxiv.org/abs/cs/0507059v1

Computer Science

Logic in Computer Science

Technical Report, 22 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Data complexity of answering conjunctive queries over SHIQ knowledge bases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data complexity of answering conjunctive queries over SHIQ knowledge bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data complexity of answering conjunctive queries over SHIQ knowledge bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706576