Abstract
Recent research points out that query containment is a central problem in several database and knowledge base applications, including data warehousing, data integration, query optimization, and (materialized) view maintenance. In this paper we present a decision procedure for containment of conjunctive queries defined over a database schema specified in a very expressive description logic, comprising n-ary relations and general inclusion axioms on both concepts and relations.