Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

SEMWEB
2010
Springer

favoriteEmaildiscussreport

163views Internet Technology» more SEMWEB 2010»

SPARQL beyond Subgraph Matching

13 years 2 months ago

SPARQL beyond Subgraph Matching

Download korrekt.org

We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS,

Birte Glimm, Markus Krötzsch

Real-time Traffic

Entailment | Internet Technology | Language Sparql | Semantic Web Query | SEMWEB 2010 |

claim paper

Related Content

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» DOGMA A DiskOriented Graph Matching Algorithm for RDF Databases

» Frequent subgraph mining in outerplanar graphs

» Keyword search over RDF graphs

» Embeddings of Topological Graphs Lossy Invariants Linearization and 2Sums

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	SEMWEB
Authors	Birte Glimm, Markus Krötzsch

Comments (0)