Tractable Query Answering for Expressive Ontologies and Existential Rules

The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existenti