The professor who taught “Introduction to Computer Programming” my freshman year of college told us that it was easier to teach a (doctor, lawyer, architect) to program a computer than it was to teach a computer programmer to be a (doctor, lawyer, architect). I was never really sure whether he meant that it was easy to teach people programming, or whether he meant that it was impossible to teach programmers anything else. Many years later, I met the doctor he collaborated a lot with, and decided that my professor’s conclusion was based on an unrepresentative data set, because the doctor had the personality of a programmer who accidentally went to medical school.
I was reminded of that professor by one of Martha Yee’s questions in her article “Can Bibliographic Data Be Put Directly Onto the Semantic Web?“:
Do all possible inverse relationships need to be expressed, or can they be inferred? My model is already quite large, and I have not yet defined the inverse of every property as I really should to have a correct RDF model. In other words, for every property there needs to be an inverse property; for example, the property
isCreatorOfneeds to have the inverse property
isCreatedBy; thus “Twain” has the property
isCreatorOf, while “Adventures of Tom Sawyer” has the property
isCreatedBy. Perhaps users and inputters will not actually have to see the huge, complex RDF data model that would result from creating all the inverse relationships, but those who maintain the model will need to deal with a great deal of complexity. However, since I’m not a programmer, I don’t know how the complexity of RDF compares to the complexity of existing ILS software.
Continues @ http://go-to-hellman.blogspot.com