On the Satisfiability Problem of Patterns in SPARQL 1.1

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.

[1]  Jan Van den Bussche,et al.  On the primitivity of operators in SPARQL , 2014, Inf. Process. Lett..

[2]  Jan Van den Bussche,et al.  On the Satisfiability Problem for SPARQL Patterns , 2014, J. Artif. Intell. Res..

[3]  Hajnal Andréka,et al.  Decision problems for equational theories of relation algebras , 1997, Memoirs of the American Mathematical Society.

[4]  Egor V. Kostylev,et al.  Query Nesting, Assignment, and Aggregation in SPARQL 1.1 , 2017, ACM Trans. Database Syst..

[5]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[6]  Jan Van den Bussche,et al.  On the complexity of division and set joins in the relational algebra , 2005, PODS '05.

[7]  Ian M. Hodkinson,et al.  Finite algebras of relations are representable on finite sets , 1999, Journal of Symbolic Logic.

[8]  Jérôme Euzenat,et al.  SPARQL Query Containment Under SHI Axioms , 2012, AAAI.

[9]  Marcelo Arenas,et al.  Semantics and Complexity of SPARQL , 2006, International Semantic Web Conference.

[10]  Claudio Gutiérrez,et al.  The Expressive Power of SPARQL , 2008, SEMWEB.

[11]  Jan Van den Bussche,et al.  The Semijoin Algebra and the Guarded Fragment , 2004, J. Log. Lang. Inf..

[12]  Egor V. Kostylev,et al.  On Expressibility of Non-Monotone Operators in SPARQL , 2016, KR.

[13]  Xin Wang,et al.  On the statistical analysis of practical SPARQL queries , 2016, WebDB.

[14]  Balder ten Cate,et al.  Queries with Guarded Negation , 2012, Proc. VLDB Endow..

[15]  Jan Van den Bussche,et al.  On the Power of SPARQL in Expressing Navigational Queries , 2015, Comput. J..

[16]  Marcelo Arenas,et al.  Querying semantic web data with SPARQL , 2011, PODS.

[17]  Axel Polleres,et al.  From SPARQL to rules (and back) , 2007, WWW '07.

[18]  Daniel Kroening,et al.  Decision Procedures , 2016, Texts in Theoretical Computer Science. An EATCS Series.

[19]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[20]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[21]  Martin Otto,et al.  Back and forth between guarded and modal logics , 2002, TOCL.

[22]  Egor V. Kostylev,et al.  SPARQL with Property Paths , 2015, SEMWEB.

[23]  Marcelo Arenas,et al.  Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard , 2012, WWW.

[24]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[25]  Jan Van den Bussche,et al.  Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference , 2014, ArXiv.

[26]  Egor V. Kostylev,et al.  Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1 , 2016, WWW.

[27]  Michael Schmidt,et al.  Foundations of SPARQL query optimization , 2008, ICDT '10.