Query Answering via Modal Definability

Stanislav Kikot

In the talk we will show how to use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction works for conjunctive queries without cycles that only involve bound variables.