Re: One-way connections

Hi Karen,

I think you pose a good question.
The linked data graph is directed, which means that for definition, links
are one way. Restate every triple in inverse to provide a backlink may be
hard to do and not necessary (as Chaals says).

Think about this from a querying point of view, as in one line of a SPARQL
query.

If you know the Person and want to know his works, you ask:
*wikidata:SomePerson schema:author ?works *
​
If you know the CreativeWork and want to know the author:
*?author schema:author wikidata:SomeCreativeWork*

If you have time to dedicate you can play a little with LDF
<http://linkeddatafragments.org/data/>, there you can ask these
one-triple-pattern queries (this example
<http://data.linkeddatafragments.org/dbpedia2014?subject=&predicate=rdf%3Atype&object=dbpedia-owl%3ARestaurant>
lets
you search restaurants in dbPedia)

So long story short, instead of thinking about reverse properties, just
reverse the query ;)

Piero