mwang@watmath.UUCP (mwang) (11/18/83)
_D_E_P_A_R_T_M_E_N_T _O_F _C_O_M_P_U_T_E_R _S_C_I_E_N_C_E _U_N_I_V_E_R_S_I_T_Y _O_F _W_A_T_E_R_L_O_O _S_E_M_I_N_A_R _A_C_T_I_V_I_T_I_E_S _I_N_F_O_R_M_A_T_I_C _L_O_G_I_C _S_E_M_I_N_A_R - Monday, November 21, 1983. Prof. A. Nait-Abdallah of this department will speak on ``The Interpretation of Infinite Computations in Logic Programming II - Infinite Fair Derivations and the Skylight Theorem.'' TIME: 3:45 PM (Please Note) ROOM: MC 6081F ABSTRACT We show that infinite computations are relevant in log- ic programming, in that they compute very natural ob- jects. These objects are infinite trees. The set of trees is a compact metric space, and the Skylight Theorem gives a characterization of the outcome of fin- ite and infinite computations. November 18, 1983