On the Complexity of Evaluating Regular Path Queries Over Linear Existential Rules

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-45276-0_1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing