Tag
This paper studies the complexity of answering two-way (conjunctive) regular path queries over knowledge bases with linear and guarded existential rules, establishing completeness results for data and combined complexity.
This paper studies Controlled Query Evaluation (CQE) for Description Logic ontologies with epistemic dependency policies, introducing a new semantics based on minimal policy violation that achieves polynomial-time query answering for DL-Lite ontologies.