We consider the overlap between reasoning involved in conjunctive query optimization (CQO) and in tableaux-based approaches to reasoning about subsumption in description logics (DLs). In both cases, an underlying graph is created, searched and modified. This process is determined by a given query and database schema in the first case and by a given description and terminology in the second. The opportunities for overlap derive from an abundance of reductions of various schema languages to terminologies for common DL dialects, and from the fact that descriptions can in turn be viewed as queries that compute a single column.
Our main contributions are as follows. We present the design and implementation of a common graph utility that integrates the requirements for both CQO and DL reasoning. We then verify this model by also presenting the design and implementation for two drivers, one that implements a query optimizer for a conjunctive query language extended with descriptions, and one that implements a complete DL reasoner for a feature based DL dialect.
【 预 览 】
附件列表
Files
Size
Format
View
CGU: A common graph utility for DL Reasoning and Conjunctive Query Optimization
PDF
download
878987797
028-85220240
