From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ba.seminars
Subject: 4/14/92 Vincenzo Cutello Talk at ICSI
Keywords: Theorem Proving : What Can Resolution Resolve ?
Date: 7 Apr 92 18:41:49 GMT
Article-I.D.: agate.rsqddINNbq8
Distribution: ba
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsid.icsi.berkeley.edu


              The International Computer Science Institute
                     is pleased to present a talk:

                   Tuesday, April 14, 1992  3:30 p.m.

                            VINCENZO CUTELLO
                                  ICSI

          ``Theorem Proving : What Can Resolution Resolve ?''

           Since its proposal in 1965,  the  Resolution  Principle
      has  gained  wide  acceptance  and today is usually the main
      inference rule in any theorem prover.  In this talk we  will
      examine the main characteristics of the Resolution Principle
      and  its  improvements  and  highlight  some  of  the   most
      interesting open problems.

        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

      ============================================================

          ICSI Lecture Series in Theoretical Computer Science
      
           The ICSI Lecture Series in Theoretical Computer Science
      is  an  initiative  of ICSI to bring together researchers in
      different branches of theoretical computer science and  gra-
      duate  students  with  interests in TCS.  The emphasis is on
      the exchange of basic information on the foundations of dif-
      ferent  areas.  Thus,  each  lecture is intended to survey a
      specific topic so as to give to the audience a flavor of the
      main results, the techniques employed and the research prob-
      lems.
      
           The lectures will be held on Tuesdays from 3:30  pm  to
      4:30 pm in the Main Lecture Hall of ICSI.
      
           Schedule of the first lectures:
      
           Jan. 21 : R. Karp: ``On Line Algorithms''
           Jan. 28 : No Lecture (SODA)
           Feb.  4 : M. Luby: ``Randomized Algorithms''
           Feb. 11 : B. Codenotti: ``Parallel Linear Algebra''
           Feb. 18 : M. Pellegrini: ``Randomization in Computational
                                      Geometry''
           Feb. 25 : M. Blum: ``Universal Statistical Tests''
           Mar. 03 : S. Smale: ``On the Limits of Artificial Intelligence:
                                 Changing the Discussion''
           Mar. 10 : B. Natarajan: ``Computational Machine Learning''
           Mar. 17 : J. Canny: ``Sparse Polynomial Systems''
           Mar. 24 : R. Tamassia:  ``Dynamic Algorithms''
           Mar. 31 : K. Weihrauch: ``Constructivity, Computability
                                     and Complexity''
   	   Apr.  7 : G. Lischke : "About the Quality of Separation
				   between NP and ExpTime"
	   Apr. 14 : V. Cutello : "Theorem Proving: What Can
				   Resolution Resolve?"

           The following is a list of speakers  who  have  already
      agreed to give a lecture: K. Aberer, E. Lawler.
      
           Everyone is welcome.
      
      
                For further information, please contact:
      
          Bruno Codenotti (e-mail brunoc@icsi.berkeley.edu) or
          Vincenzo Cutello (e-mail cutello@icsi.berkeley.edu)