Query Expansion in Description Logics and Carin
Marie-Christine Rousset · 1999
In this paper, we address the problem of determining the expansions of a query in description logics possibly combined with Datalog rules, and we show its use for information integration. Expanding a query consists of determining all the ways of deriving it from atoms built on some distinguished predicates. Introduction Given a knowledge base, expanding a query consists of determining all the ways of deriving it from atoms built on some distinguished predicates. In this paper, we address the problem of determining the expansions of a query in description logics and Carin. Description Logics are logical formalisms for representing classes of objects (called concepts) and their relationships (expressed by binary relations called roles). Much of the research in description logics has concentrated on algorithms for checking subsumption between concepts and satisfiability of knowledge bases (see e.g. (Nardi et al. 1995) for a survey). When the query is a single concept-atom and the disting...