@TECHREPORT{Hustadt+Motik+Sattler@FZI-TR2004,
 AUTHOR        = {Hustadt, U. and Motik, B. and Sattler, U.},
 TITLE         = {Reasoning for Description Logics around SHIQ in a Resolution Framework},
 XTITLE        = {Reasoning for Description Logics around {$\mathcal{SHIQ}$} in a Resolution Framework},
 INSTITUTION   = {FZI},
 ADDRESS       = {Karlsruhe, Germany},
 NUMBER        = {3-8-04/04},
 MONTH         = jun,
 YEAR          = {2004},
 URL           = {FZI-3-8-04-04.pdf},
 ABSTRACT      = {We present several algorithms for reasoning with
 description logics closely related to SHIQ. Firstly, we present an
 algorithm for deciding satisfiability of SHIQ knowl edge bases. Then,
 to enable representing concrete data such as strings or integers, we
 devise a general approach for reasoning with concrete domains in the
 framework of resolution, and apply it to obtain a procedure for
 deciding SHIQ(D). For unary coding of numbers, this procedure is
 worst-case optimal, i.e. it runs in exponential time. Motivated by the
 prospects of reusing optimization techniques from deductive databases,
 such as magic sets, we devise an algorithm for reducing SHIQ(D)
 knowledge bases to disjunctive datalog programs. Furthermore, we show
 that so-called DL-safe rules can be combined with disjunctive programs
 obtained by our transformation to increase the expressivity of the
 logic, without affecting decidability. We show that our algorithms can
 easily be extended to handle answering conjunctive queries over
 SHIQ(D) knowledge bases. Finally, we extend our algorithms to support
 metamodel- ing. Since SHIQ(D) is closely related to OWL-DL, our
 algorithms provide alternative mechanisms for reasoning in the
 Semantic Web.}
}

{"_id":"6j4xaazD9xKMssxWp","bibbaseid":"hustadt-motik-sattler-reasoningfordescriptionlogicsaroundshiqinaresolutionframework-2004","author_short":["Hustadt, U.","Motik, B.","Sattler, U."],"bibdata":{"bibtype":"techreport","type":"techreport","author":[{"propositions":[],"lastnames":["Hustadt"],"firstnames":["U."],"suffixes":[]},{"propositions":[],"lastnames":["Motik"],"firstnames":["B."],"suffixes":[]},{"propositions":[],"lastnames":["Sattler"],"firstnames":["U."],"suffixes":[]}],"title":"Reasoning for Description Logics around SHIQ in a Resolution Framework","xtitle":"Reasoning for Description Logics around $\\mathcal{SHIQ}$ in a Resolution Framework","institution":"FZI","address":"Karlsruhe, Germany","number":"3-8-04/04","month":"June","year":"2004","url":"FZI-3-8-04-04.pdf","abstract":"We present several algorithms for reasoning with description logics closely related to SHIQ. Firstly, we present an algorithm for deciding satisfiability of SHIQ knowl edge bases. Then, to enable representing concrete data such as strings or integers, we devise a general approach for reasoning with concrete domains in the framework of resolution, and apply it to obtain a procedure for deciding SHIQ(D). For unary coding of numbers, this procedure is worst-case optimal, i.e. it runs in exponential time. Motivated by the prospects of reusing optimization techniques from deductive databases, such as magic sets, we devise an algorithm for reducing SHIQ(D) knowledge bases to disjunctive datalog programs. Furthermore, we show that so-called DL-safe rules can be combined with disjunctive programs obtained by our transformation to increase the expressivity of the logic, without affecting decidability. We show that our algorithms can easily be extended to handle answering conjunctive queries over SHIQ(D) knowledge bases. Finally, we extend our algorithms to support metamodel- ing. Since SHIQ(D) is closely related to OWL-DL, our algorithms provide alternative mechanisms for reasoning in the Semantic Web.","bibtex":"@TECHREPORT{Hustadt+Motik+Sattler@FZI-TR2004,\n AUTHOR = {Hustadt, U. and Motik, B. and Sattler, U.},\n TITLE = {Reasoning for Description Logics around SHIQ in a Resolution Framework},\n XTITLE = {Reasoning for Description Logics around {$\\mathcal{SHIQ}$} in a Resolution Framework},\n INSTITUTION = {FZI},\n ADDRESS = {Karlsruhe, Germany},\n NUMBER = {3-8-04/04},\n MONTH = jun,\n YEAR = {2004},\n URL = {FZI-3-8-04-04.pdf},\n ABSTRACT = {We present several algorithms for reasoning with\n description logics closely related to SHIQ. Firstly, we present an\n algorithm for deciding satisfiability of SHIQ knowl edge bases. Then,\n to enable representing concrete data such as strings or integers, we\n devise a general approach for reasoning with concrete domains in the\n framework of resolution, and apply it to obtain a procedure for\n deciding SHIQ(D). For unary coding of numbers, this procedure is\n worst-case optimal, i.e. it runs in exponential time. Motivated by the\n prospects of reusing optimization techniques from deductive databases,\n such as magic sets, we devise an algorithm for reducing SHIQ(D)\n knowledge bases to disjunctive datalog programs. Furthermore, we show\n that so-called DL-safe rules can be combined with disjunctive programs\n obtained by our transformation to increase the expressivity of the\n logic, without affecting decidability. We show that our algorithms can\n easily be extended to handle answering conjunctive queries over\n SHIQ(D) knowledge bases. Finally, we extend our algorithms to support\n metamodel- ing. Since SHIQ(D) is closely related to OWL-DL, our\n algorithms provide alternative mechanisms for reasoning in the\n Semantic Web.}\n}\n","author_short":["Hustadt, U.","Motik, B.","Sattler, U."],"key":"Hustadt+Motik+Sattler@FZI-TR2004","id":"Hustadt+Motik+Sattler@FZI-TR2004","bibbaseid":"hustadt-motik-sattler-reasoningfordescriptionlogicsaroundshiqinaresolutionframework-2004","role":"author","urls":{"Paper":"http://cgi.csc.liv.ac.uk/~ullrich/publications/FZI-3-8-04-04.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"techreport","biburl":"http://cgi.csc.liv.ac.uk/~ullrich/publications/all.bib?authorFirst=1","dataSources":["WhiGijHmCtTSdLaAj","FgmYE34DdKWThg2dR"],"keywords":[],"search_terms":["reasoning","description","logics","around","shiq","resolution","framework","hustadt","motik","sattler"],"title":"Reasoning for Description Logics around SHIQ in a Resolution Framework","year":2004}