Complexity and Expressiveness of ShEx for RDF
From MaRDI portal
Publication:5738935
DOI10.4230/LIPICS.ICDT.2015.195zbMath1365.68222OpenAlexW2167961018MaRDI QIDQ5738935
Eric G. Prud'hommeaux, Harold Solbrig, Sławek Staworko, Iovka Boneva, Samuel Hym, Jose E. Labra Gayo
Publication date: 13 June 2017
Full work available at URL: https://hal.archives-ouvertes.fr/hal-01218552
Database theory (68P15) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Complexity and Expressiveness of ShEx for RDF