On expressibility of non-monotone operators in SPARQL
SPARQL, a query language for RDF graphs, is one of the key technologies for the Semantic Web. The expressivity and complexity of various fragments of SPARQL have been studied extensively. It is usually assumed that the optional matching operator OPTIONAL has only two graph patterns as arguments. The...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Association for the Advancement of Artificial Intelligence
2016
|