< Terug naar vorige pagina

Publicatie

On the Satisfiability Problem of Patterns in SPARQL 1.1

Boekbijdrage - Boekhoofdstuk Conferentiebijdrage

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.
Boek: AAAI Publications, Thirty-Second AAAI Conference on Artificial Intelligence
Pagina's: 2054 - 2061
ISBN:9781577358008
Jaar van publicatie:2018
BOF-keylabel:ja
IOF-keylabel:ja
Toegankelijkheid:Closed