Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site watmath.UUCP
Path: utzoo!watmath!mwang
From: mwang@watmath.UUCP (mwang)
Newsgroups: ont.events
Subject: UW Inf. Logic Seminar, Prof. Nait-Abdallah on "The Interpretation of Infinite Computations in Logic Programming II - Infinite Fair Derivations and the Skylight Theorem."
Message-ID: <6145@watmath.UUCP>
Date: Fri, 18-Nov-83 12:25:24 EST
Article-I.D.: ir Derivations and the Skylight Theorem."
Posted: Fri Nov 18 12:25:24 1983
Date-Received: Sat, 19-Nov-83 04:46:34 EST
Expires: Tue, 22-Nov-83 00:00:00 EST
Organization: U of Waterloo, Ontario
Lines: 28


     _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