Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add list of previous work that contributed to the science. #199

Merged
merged 14 commits into from
Mar 1, 2024
Merged

Add list of previous work that contributed to the science. #199

Changes from all commits
Commits
Show all changes
14 commits
Select commit Hold shift + click to select a range
5aa1653
Add list of previous work that contributed to the science.
msporny Feb 29, 2024
8982c07
Add citation to RDF-CANON proof.
msporny Feb 29, 2024
9e08418
Remove non-existent specref citation.
msporny Feb 29, 2024
6cf898d
Apply suggestions from code review
gkellogg Feb 29, 2024
b4faa9b
Update historical references using Springer-LNCS format.
gkellogg Feb 29, 2024
e0defbe
Add historical reference to "Named Graphs" paper suggested by @iherman.
gkellogg Feb 29, 2024
0462ceb
Call out chairs and specific members in acknowledgements.
gkellogg Feb 29, 2024
ca74ccc
Fix reference.
gkellogg Feb 29, 2024
03eefab
Update spec/index.html
gkellogg Feb 29, 2024
8f37433
Apply suggestions from code review
gkellogg Mar 1, 2024
22f043a
Reorder historical citations by publication date.
gkellogg Mar 1, 2024
0c65a56
MOre updates to "Named graph" citation.
gkellogg Mar 1, 2024
3b13fbb
Apply suggestions from code review
gkellogg Mar 1, 2024
56e21f9
Apply suggestions from code review
gkellogg Mar 1, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
158 changes: 157 additions & 1 deletion spec/index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2494,7 +2494,7 @@ <h3>Algorithm</h3>
<p>
Each path is represented by the concatenation of the
identifiers for each related blank node
– either the issued identifier,
— either the issued identifier,
or a temporary identifier created using a copy of <var>issuer</var>.
Those for which temporary identifiers were issued are later
recursed over using this algorithm.
Expand Down Expand Up @@ -3743,6 +3743,19 @@ <h2>Acknowledgements</h2>
publication [[Hogan-Canonical-RDF]] provided an important contemporary
analysis of the canonicalization problem and served as an independent
justification of the development of <a>RDFC-1.0</a>.</p>

<p>The editors would also like to thank
the chairs of the Working Group, Phil Archer and Markus Sabadello,
and specific members of the Working Group whose active contributions
were critical in completing this work:
Pierre-Antoine Champin,
Ivan Herman,
David Lehn,
Kazue Sako,
Manu Sporny, and
Ted Thibodeau Jr.
</p>

<p data-include="common/participants.html"></p>

<p>This specification is based on work done in the
Expand Down Expand Up @@ -3775,6 +3788,149 @@ <h2>Acknowledgements</h2>
not necessarily reflect the position or the policy of the U.S. Government and no
official endorsement should be inferred.
</p>

<p>
The Working Group acknowledges that the success of this specification is
dependent on a long history of work performed over multiple decades in both
academia and industry. We thank the individuals who iterated on the science
which led to the completion of this specification. A partial list of these
papers is found below, to the best of the Working Group's recollection.
Omission from this list, whether intentional or unintentional, is not meant
to imply that such an unlisted paper was not similarly important to the
development of this work.
</p>

<ul>
<li>
Corneil, D.G., Gotlieb, C.C.:
An Efficient Algorithm for Graph Isomorphism.
J. ACM. 17, 51–64 (1970).
<a href="https://doi.org/10.1145/321556.321562">https://doi.org/10.1145/321556.321562</a>.
</li>
<li>
Weisfeiler, B.:
On Construction and Identification of Graphs.
Springer, Berlin, Heidelberg (1976).
<a href="https://doi.org/10.1007/BFb0089374">https://doi.org/10.1007/BFb0089374</a>.
</li>
<li>
Babai, L., Erdős, P., Selkow, S.M.:
Random Graph Isomorphism.
SIAM J. Comput. 9, 628–635 (1980).
<a href="https://doi.org/10.1137/0209047">https://doi.org/10.1137/0209047</a>.
</li>
<li>
Hoffmann, C.M. ed:
Group-Theoretic Algorithms and Graph Isomorphism.
Springer, Berlin, Heidelberg (1982).
<a href="https://doi.org/10.1007/3-540-11493-9">https://doi.org/10.1007/3-540-11493-9</a>.
</li>
<li>
Corneil, D., Goldberg, M.:
A non-factorial algorithm for canonical numbering of a graph.
Journal of Algorithms. 5, 345–362 (1984).
<a href="https://doi.org/10.1016/0196-6774(84)90015-4">https://doi.org/10.1016/0196-6774(84)90015-4</a>.
</li>
<li>
Sutcliffe, G., Suttner, C.:
The TPTP Problem Library.
Journal of Automated Reasoning. 21, 177–203 (1998).
<a href="https://doi.org/10.1023/A:1005806324129">https://doi.org/10.1023/A:1005806324129</a>.
</li>
<li>
Grohe, M.:
Isomorphism testing for embeddable graphs through definability.
In: Proceedings of the thirty-second annual ACM symposium on Theory of computing. pp. 63–72.
ACM, Portland Oregon USA (2000).
<a href="https://doi.org/10.1145/335305.335313">https://doi.org/10.1145/335305.335313</a>.
</li>
<li>
Tsang, W.W., Hui, L.C.K., Chow, K.P., Chong, C.:
Tuning the collision test for stringency,
Tech. Rep. TR-2000-05, Computer Science and Information Systems,
Hong Kong University (2000).
<a href="https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=b9b3c7e4afd78e64c075f90694f0e6021960b3b1">https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=b9b3c7e4afd78e64c075f90694f0e6021960b3b1</a>
</li>
<li>
Berners-Lee, T., Connolly, D.:
[[[DesignIssues-Diff]]]
W3C Unofficial (2001).
<a href="https://www.w3.org/DesignIssues/Diff">https://www.w3.org/DesignIssues/Diff</a> [[DesignIssues-Diff]].
</li>
<li>
Carroll, J.J.:
[[[HPL-2003-142]]].
In: Fensel, D., Sycara, K., and Mylopoulos, J. (eds.)
The Semantic Web - ISWC 2003. pp. 369–384.
Springer, Berlin, Heidelberg (2003).
<a href="https://doi.org/10.1007/978-3-540-39718-2_24">https://doi.org/10.1007/978-3-540-39718-2_24</a> [[HPL-2003-142]].
</li>
<li>
Sayers, C., Karp, A.:
Computing the digest of an RDF graph,
Tech. Rep. HPL-2003-235 (R. 1),
Hewlett Packard Laboratories (2004).
<a href="https://www.hpl.hp.com/techreports/2003/HPL-2003-235R1.html">https://www.hpl.hp.com/techreports/2003/HPL-2003-235R1.html</a>.
</li>
<li>
Carroll, J.J., Bizer, C., Hayes, P., Stickler, P.:
Named graphs.
Journal of Web Semantics. 3, 247–267 (2005).
<a href="https://doi.org/10.1016/j.websem.2005.09.001">https://doi.org/10.1016/j.websem.2005.09.001</a>.
</li>
<li>
Tummarello, G., Morbidoni, C., Bachmann-Gmür, R., Erling, O.:
RDFSync: Efficient Remote Synchronization of RDF Models.
In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., and Cudré-Mauroux, P. (eds.)
The Semantic Web. pp. 537–551.
Springer, Berlin, Heidelberg (2007).
<a href="https://doi.org/10.1007/978-3-540-76298-0_39">https://doi.org/10.1007/978-3-540-76298-0_39</a>.
</li>
<li>
Oren, E., Delbru, R., Catasta, M., Cyganiak, R., Stenzhorn, H., Tummarello, G.:
Sindice.com: a document-oriented lookup index for open linked data.
International Journal of Metadata, Semantics and Ontologies. 3, 37–52 (2008).
<a href="https://doi.org/10.1504/IJMSO.2008.021204">https://doi.org/10.1504/IJMSO.2008.021204</a>.
davidlehn marked this conversation as resolved.
Show resolved Hide resolved
</li>
<li>
Fisteus, J.A., Fernández García, N., Sánchez Fernández, L., Delgado Kloos, C.:
Hashing and canonicalizing Notation 3 graphs.
Journal of Computer and System Sciences. 76, 663–685 (2010).
<a href="https://doi.org/10.1016/j.jcss.2010.01.003">https://doi.org/10.1016/j.jcss.2010.01.003</a>.
</li>
<li>
Gross, J.L., Yellen, J., Zhang, P.:
Handbook of Graph Theory, Second Edition.
Chapman & Hall/CRC (2013).
</li>
<li>
Kasten, A., Scherp, A., Schauß, P.:
[[[eswc2014Kasten]]].
In: Presutti, V., d’Amato, C., Gandon, F., d’Aquin, M., Staab, S., and Tordai, A. (eds.)
The Semantic Web: Trends and Challenges. pp. 146–160.
Springer International Publishing, Cham (2014).
<a href="https://doi.org/10.1007/978-3-319-07443-6_11">https://doi.org/10.1007/978-3-319-07443-6_11</a> [[eswc2014Kasten]].
</li>
<li>
Hogan, A.:
[[[Hogan-Canonical-RDF]]].
ACM Trans. Web. 11, 22:1-22:62 (2017).
<a href="https://doi.org/10.1145/3068333">https://doi.org/10.1145/3068333</a> [[Hogan-Canonical-RDF]].
davidlehn marked this conversation as resolved.
Show resolved Hide resolved
</li>
<li>
Arnold, R., Longley, D.:
RDF Dataset Normalization.
Report submitted to the W3C Credentials Community Group mailing list (2020).
<a href="https://lists.w3.org/Archives/Public/public-credentials/2021Mar/att-0220/RDFDatasetCanonicalization-2020-10-09.pdf">https://lists.w3.org/Archives/Public/public-credentials/2021Mar/att-0220/RDFDatasetCanonicalization-2020-10-09.pdf</a>.
</li>
<li>
msporny marked this conversation as resolved.
Show resolved Hide resolved
Tomaszuk, D., Głąb, S., Turoboś, F., Pawlik, T., Kuziński, D., Sopek, M.:
Interwoven Hash of Vicious Circle Free Graph.
In: 2022 IEEE International Conference on Blockchain (Blockchain). pp. 449–454. IEEE,
Espoo, Finland (2022).
<a href="https://doi.org/10.1109/Blockchain55522.2022.00069">https://doi.org/10.1109/Blockchain55522.2022.00069</a>.
davidlehn marked this conversation as resolved.
Show resolved Hide resolved
</li>
</ul>
</section>

</body>
Expand Down
Loading