- From: Reto Bachmann-Gmür <reto@gmuer.ch>
- Date: Mon, 21 Nov 2005 10:04:43 +0100
- To: semantic-web at W3C <semantic-web@w3c.org>
Hello I'm looking for an algorithm to remove duplicate anonymous resources from an RDF-Model. Fo example, given the graph: (1) _:a rdfs:label "test". (2) _:a rdfs:comment "...". (3) _:b rdfs:label "test". The algorithm should tell me that I can safely drop statement 3. Or in a more complex example: (1) _:a foaf:knows _:b. (2) _:b foaf:knows _:a. (3) _:c foaf:knows _:d. (4) _:d foaf:knows _:c. Tell me that 3 and 4 can be removed, but that the reduced graph cannot further be reduced, even if _:a and _:b seem indistinguishable. Does anybody has an algorithm or even some code for doing this? Thanks, reto
Received on Monday, 21 November 2005 09:05:29 UTC