Sciweavers
Register
Login
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Request Feature
Report Bug
Terms of Use
Privacy Policy
Cookies
Contact
Share
➚
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
5
click to vote
SEMWEB
2010
Springer
favorite
Email
discuss
report
163
views
Internet Technology
»
more
SEMWEB 2010
»
SPARQL beyond Subgraph Matching
12 years 9 months ago
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
more »
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)
Researcher Info
Internet Technology Study Group
Computer Vision