CS240A Syllabus

Assignments for Week 1

Do Exercises 8.1, 8.2, 8.5, and 8.7 of ADS textbook. (hint: for part c. Set difference is the only nonmonotonic operation in our RA).

Read the LDL++ tutorial, up to Negation and Stratification (included).
Using the tables/facts in example1.fac of the LDL++ tutorial write and run following queries:

1. Write an LDL++ program to find the cities which are reachable from Austin, with their distance from Austin.
2. Find which of the above city is the furthest from Austin. (You can express this query using stratified negation.)
3. Write an LDL++ program to add up the population of cities in Texas. (Here you need recursive rules that exploit the lexicographical order of city names.)

CS240A Winter 2009	DATA BASES and KNOWLEDGE BASES Instructor: Carlo Zaniolo BH 3732. Office Hours: Tuesday 2:00--4:00pm
Syllabus Notes Textbooks LDL++ DB2 Home	Assignments for Week 1 Study Sections 8.1--8.5 of ADS textbook. BTW here is the Errata for the ADS Book. Do Exercises 8.1, 8.2, 8.5, and 8.7 of ADS textbook. (hint: for part c. Set difference is the only nonmonotonic operation in our RA). Read the LDL++ tutorial, up to Negation and Stratification (included). Using the tables/facts in example1.fac of the LDL++ tutorial write and run following queries: 1. Write an LDL++ program to find the cities which are reachable from Austin, with their distance from Austin. 2. Find which of the above city is the furthest from Austin. (You can express this query using stratified negation.) 3. Write an LDL++ program to add up the population of cities in Texas. (Here you need recursive rules that exploit the lexicographical order of city names.)