Reasoning in Description Logics by a Reduction to Disjunctive Datalog. Hustadt, U., Motik, B., & Sattler, U. Journal of Automated Reasoning, 39(3):351-384, 2007. Paper abstract bibtex As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a SHIQ knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that SHIQ is data complete for NP, and we identify an expressive fragment of SHIQ with polynomial data complexity.
@article{Hustadt+Motik+Sattler@JAR2007,
author = {Ullrich Hustadt and Boris Motik and Ulrike Sattler},
title = {Reasoning in Description Logics by a Reduction to Disjunctive Datalog},
journal = {Journal of Automated Reasoning},
volume = {39},
number = {3},
year = {2007},
pages = {351-384},
url = {http://dx.doi.org/10.1007/s10817-007-9080-3},
abstract = {As applications of description logics proliferate,
efficient reasoning with knowledge bases containing many assertions
becomes ever more important. For such cases, we developed a novel
reasoning algorithm that reduces a SHIQ knowledge base to a
disjunctive datalog program while preserving the set of ground
consequences. Queries can then be answered in the resulting program
while reusing existing and practically proven optimization techniques
of deductive databases, such as join-order optimizations or magic
sets. Moreover, we use our algorithm to derive precise data complexity
bounds: we show that SHIQ is data complete for NP, and we identify an
expressive fragment of SHIQ with polynomial data complexity.}
}
Downloads: 0
{"_id":"JJt3Li7mbDcrhMqy2","bibbaseid":"hustadt-motik-sattler-reasoningindescriptionlogicsbyareductiontodisjunctivedatalog-2007","author_short":["Hustadt, U.","Motik, B.","Sattler, U."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Ullrich"],"propositions":[],"lastnames":["Hustadt"],"suffixes":[]},{"firstnames":["Boris"],"propositions":[],"lastnames":["Motik"],"suffixes":[]},{"firstnames":["Ulrike"],"propositions":[],"lastnames":["Sattler"],"suffixes":[]}],"title":"Reasoning in Description Logics by a Reduction to Disjunctive Datalog","journal":"Journal of Automated Reasoning","volume":"39","number":"3","year":"2007","pages":"351-384","url":"http://dx.doi.org/10.1007/s10817-007-9080-3","abstract":"As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a SHIQ knowledge base to a disjunctive datalog program while preserving the set of ground consequences. Queries can then be answered in the resulting program while reusing existing and practically proven optimization techniques of deductive databases, such as join-order optimizations or magic sets. Moreover, we use our algorithm to derive precise data complexity bounds: we show that SHIQ is data complete for NP, and we identify an expressive fragment of SHIQ with polynomial data complexity.","bibtex":"@article{Hustadt+Motik+Sattler@JAR2007,\n author = {Ullrich Hustadt and Boris Motik and Ulrike Sattler},\n title = {Reasoning in Description Logics by a Reduction to Disjunctive Datalog},\n journal = {Journal of Automated Reasoning},\n volume = {39},\n number = {3},\n year = {2007},\n pages = {351-384},\n url = {http://dx.doi.org/10.1007/s10817-007-9080-3},\n abstract = {As applications of description logics proliferate,\n efficient reasoning with knowledge bases containing many assertions\n becomes ever more important. For such cases, we developed a novel\n reasoning algorithm that reduces a SHIQ knowledge base to a\n disjunctive datalog program while preserving the set of ground\n consequences. Queries can then be answered in the resulting program\n while reusing existing and practically proven optimization techniques\n of deductive databases, such as join-order optimizations or magic\n sets. Moreover, we use our algorithm to derive precise data complexity\n bounds: we show that SHIQ is data complete for NP, and we identify an\n expressive fragment of SHIQ with polynomial data complexity.} \n}\n","author_short":["Hustadt, U.","Motik, B.","Sattler, U."],"key":"Hustadt+Motik+Sattler@JAR2007","id":"Hustadt+Motik+Sattler@JAR2007","bibbaseid":"hustadt-motik-sattler-reasoningindescriptionlogicsbyareductiontodisjunctivedatalog-2007","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/s10817-007-9080-3"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://cgi.csc.liv.ac.uk/~ullrich/publications/all.bib?authorFirst=1","dataSources":["WhiGijHmCtTSdLaAj","FgmYE34DdKWThg2dR"],"keywords":[],"search_terms":["reasoning","description","logics","reduction","disjunctive","datalog","hustadt","motik","sattler"],"title":"Reasoning in Description Logics by a Reduction to Disjunctive Datalog","year":2007}