no code implementations • 5 Jun 2014 • Xiaowang Zhang, Jan Van den Bussche, François Picalausa
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1. 0 is comparable with that of the relational algebra.
