<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2017-10-04 00:50:47Graph theory Computing Resource Description Framework Query languages Mathematics Discrete mathematics SPARQL FO Graph Directed graph RDFLib |
Add to Reading List |
For the DISTINCT Clause of SPARQL Queries Medha Atre Dept. of Computer Science and Engineering Indian Institute of Technology, Kanpur, India  | The Meaning of Erasing in RDF under the Katsuno-Mendelzon Approach In Memory of Alberto O. Mendelzon Claudio Gutierrezc Carlos Hurtadoc Alejandro Vaismanc Department of Computer Science, Universidad de ChileDocID: 1qOkk - View Document |
 | Microsoft Word - NLA-monographdocDocID: 1oIMz - View Document |
 | ABOUT MANUSCRIPTS FOR IJ ITADocID: 1onN2 - View Document |
![Tasks that Require, or can Benefit from, Matching Blank Nodes⋆ Christina Lantzaki and Yannis Tzitzikas arXiv:1410.8536v1 [cs.AI] 30 Oct 2014](https://www.pdfsearch.io/img/20c2858d2d866e918acf794f2ff5b4e1.jpg "Tasks that Require, or can Benefit from, Matching Blank Nodes⋆ Christina Lantzaki and Yannis Tzitzikas arXiv:1410.8536v1 [cs.AI] 30 Oct 2014") | Tasks that Require, or can Benefit from, Matching Blank Nodes⋆ Christina Lantzaki and Yannis Tzitzikas arXiv:1410.8536v1 [cs.AI] 30 Oct 2014DocID: 1mdaP - View Document |
 | Microsoft PowerPoint - SP-WT10-1.pptDocID: 1m9MR - View Document |