Representing and Reasoning with Knowledge

• regular expressions in the syntax with only concatenation, disjunction, star, plus, ?, wildcard . and e (denoting the empty string)
• Well-formed XML document, valid XML document
• Make implicit knowledge in a text file explicit in XML.
• Make a Relax NG schema in compact syntax from an XML example and from specifications in natural language.
• You should know and understand the theory and all basic constructs from Kay 14 and vdVlist 1-6. You need not know all the specific details that you would always look up in a manual like the list of all facets on page 93-94 of vdVlist or the names of each datatype. You should be able to work with these things intelligently if you are given the description from the manual.

            Tuesday Nov 8 we will do the following:
            * First hour: finishing XPath lecture of last week (See http://staff.science.uva.nl/~marx/teaching/rrk/LectureNotes/week9XPath.html
              starting at Design of XPath)
            * Second hour: you can ask questions about current exam assignment and also about the third one.
            * The third take home exam consists of the Exercises on 
               http://staff.science.uva.nl/~marx/teaching/rrk/LectureNotes/week9XPath.html
            
            Friday Nov 11 will be for
            * practicing XPath
            * asking questions about 2nd take home exam 
          

1. All exercises from week 9 on XPath (at the bottom of the lecturenotes)
2. Schematron Parliamentary Proceedings Exercise.

• Tue (1st hour): Answers to XPath exam
• Tue (2nd hour): XQuery functions.
• Exercise: Write an XQuery program with the following purpose: given an XML (or XHTML) file, count all words in p-elements and create a word-cloud in HTML from these counts. Make a test too.
• Before Fri: Make the arithmetic exercises and the wordcloud exercise in XQuery. Each student shows something in class.
• Homework before next Tuesday: Clean up your XQuery functions exercises on your wiki. Work on the reachablenodes exercise from week 13.

1. Knight's Tour
2. The lekker bomen exercise from the XQuery functions notes
3. The Dijkstra's shortest path algorithm exercise from the XQuery functions notes

Suppose you have a database of University courses in XML. Each course has a name and zero or more prerequisiste courses (whose values are of course the names of other courses in your database). The problem is that 1) this is a University database, and 2) it is created in a distributed manner (each teacher just adds his own course), 3) it is really large and thus hard to check manually whether it is consistent.
So you come to the rescue and write an XQuery function which detects all courses who have (after one or more steps) themselves as prerequisite. Not only does it output the "bad" courses. For each "bad" course, you also output the cycle of courses.
Your query comes with a simple but nice and representative toy-example database, and a few actual queries which exemplify the function on your toy-set. It is really useful if you draw your database as a directed graph.

• Tue (1st hour): discuss projects and make groups
• Tue (2nd hour): work on projects
• Fri: practical session. You work on your project and can ask me advice.

• Tue : no class. You can make an appointment with Johan van Doornik for questions on your project. Or email me.
• Fri: practical session. You work on your project and can ask me advice.

• Tue project presentations and final lesson Everybody bring laptop for course evaluation.
• Fri: no class