TY - GEN A1 - Baumgartner, Peter A1 - Furbach, Ulrich A1 - Groß-Hardt, Margret A1 - Kleemann, Thomas T1 - Model based deduction for database schema reasoning N2 - We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query reasoning. Specifically, we present an approach to com­pute completed paths for database or XPath queries. The database schema and a query are transformed to disjunctive logic programs with default negation, using a description logic as an intermediate language. Our underlying deduction system, KRHyper, then detects if a query is satisfiable or not. In case of a satisfiable query, all completed paths -- those that fulfill all given constraints -- are returned as part of the computed models. The purpose of our approach is to dramatically reduce the workload on the query processor. Without the path completion, a usual XML query processor would search the database for solutions to the query. In the paper we describe the transformation in detail and explain how to extract the solution to the original task from the computed models. We understand this paper as a first step, that covers a basic schema/query reaÂsoning task by model-based deduction. Due to the underlying expressive logic formalism we expect our approach to easily adapt to more sophisticated problem settings, like type hierarchies as they evolve within the XML world. T3 - Fachberichte Informatik - 2004,5 KW - KRHyper KW - XML Y1 - 2004 UR - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/3 UR - https://nbn-resolving.org/urn:nbn:de:kola-30 ER -