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.