Abstract
The pattern satisfiability is a fundamental problem for SPARQL. This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SPARQL 1.1 patterns. A surprising result is the undecidability of satisfiability for SPARQL 1.1 patterns when only AND and MINUS are expressible. Also, it is shown that any fragment of SPARQL 1.1 without expressing both AND and MINUS is decidable. These results provide a guideline for future SPARQL query language design and implementation.
Cite
CITATION STYLE
Zhang, X., Van Den Bussche, J., Wang, K., & Wang, Z. (2018). On the satisfiability problem of patterns in SPARQL 1.1. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 2054–2061). AAAI press. https://doi.org/10.1609/aaai.v32i1.11549
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
