CS 6905 Semantic Web Techniques
Consider the following proposal of a node-labeled ordered tree for addresses:
a1) Does the repeatedly occurring appellation
cause a problem with respect to the unambigious representation of all parts
of the address information?
a2) What if the nodes labeled 'appellation' would have been labeled 'name', too?
a3) Independently of a1) and a2), improve the readability of the tree via a simple relabeling.
b1,2) Could well-formed XML elements be given for the tree versions from a1) and a2)?
b3) Give a well-formed XML element representing your a3)-improved tree.
c) Give a b3)-equivalent Prolog term.
d1) Try to write a DTD that exactly defines addresses according to the original a1)-tree or b1)-element. Explain why this is (im)possible.
d2) Try a modified DTD that exactly defines addresses according to
the a2)-tree or b2)-element, with 'appellation' relabeled to 'name'. Explain why that is (im)possible.
d3) Modify things such that a DTD exactly defines addresses
according to your readability-improved a3)-tree or b3)-element
or c)-term. In what sense is the b3)-element valid with
respect to this DTD?
Maintained by Bruce Spencer