The panelists will share their experiences in developing closed laboratory exercises for lower level CS courses with particular emphasis on using graphical presentation techniques as a pedological and motivational tool. The use of interactive animations and visualization is combined with structured support for the student programmer to provide an apprentice style learning environment.

Computer science is an experimental science, in the same sense that biology or physics are experimental sciences. Nonetheless, lab exercises for CS1 and CS2 courses are almost never formal “experiments” as the term would be understood in any other science. This paper describes our experiences using formal experiments in CS1 and 2 laboratories. Such exercises are extremely valuable, in part because they help students relate abstract concepts to concrete programs, but more importantly because they lead students into new areas of computing, and even new forms of learning.

This article examines the issue of representing knowledge about recurring states and events, and develops mechanisms for reasoning about recurrence. A first-order axiomati-zation is developed based on the interval calculus that allows entities (events, properties, processes, etc.) to be associated, incidentally or repeatedly, with temporal intervals. the recurrence formalism permits reasoning about truth conditions of relations that occur as parts of known, recurring sequences regardless of their given initial state-their eventually reaching the appropriate state can be inferred. an extensive example is developed in the domain of planning in a world with traffic control lights, showing how the use of recurrence can enable a planner to determine that a plan to travel from a source to a destination is feasible, regardless of the state of an inervening traffic light at the time it is encountered. In order to develop this example, a novel application of the interval logic to the spatial domain is presented, which allows us to reason about trajectories and their traversal over time. the combination of paths and temporal intervals, together with the recurrence axioms and actions such as traverse, allow us to prove several theorems about the use of traffic lights, and to show how an agent can validate plans to get past them.