Skolemising Blank Nodes while Preserving Isomorphism
暂无分享,去创建一个
[1] Paul Erdös,et al. Random Graph Isomorphism , 1980, SIAM J. Comput..
[2] Jeremy J. Carroll,et al. Signing RDF Graphs , 2003, SEMWEB.
[3] Takunari Miyazaki,et al. The complexity of McKay's canonical labeling algorithm , 1995, Groups and Computation.
[4] Brendan D. McKay,et al. Practical graph isomorphism, II , 2013, J. Symb. Comput..
[5] Petteri Kaski,et al. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs , 2007, ALENEX.
[6] Dan Brickley,et al. Resource Description Framework (RDF) Model and Syntax Specification , 2002 .
[7] Jürgen Umbrich,et al. An empirical survey of Linked Data conformance , 2012, J. Web Semant..
[8] Adolfo Piperno,et al. Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version) , 2008, ArXiv.
[9] Axel Polleres,et al. Everything you always wanted to know about blank nodes , 2014, J. Web Semant..
[10] David Booth,et al. Well Behaved RDF: A Straw-Man Proposal for Taming Blank Nodes , 2013 .
[11] Tom Heath,et al. Linked Data: Evolving the Web into a Global Data Space , 2011, Linked Data.
[12] Yannis Tzitzikas,et al. Demonstrating Blank Node Matching and RDF/S Comparison Functions , 2012, International Semantic Web Conference.
[13] Axel Polleres,et al. On Blank Nodes , 2011, SEMWEB.
[14] Tim Berners-Lee,et al. Linked data , 2020, Semantic Web for the Working Ontologist.
[15] Brian McBride,et al. Jena: A Semantic Web Toolkit , 2002, IEEE Internet Comput..
[16] Alberto O. Mendelzon,et al. Foundations of semantic web databases , 2004, PODS.
[17] Christian Bizer,et al. Evolving the Web into a Global Data Space , 2011, BNCOD.