Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!ames!ucbcad!ucbvax!ukans.CSNET!veach
From: veach@ukans.CSNET (Glenn Veach)
Newsgroups: mod.ai
Subject: Conference - Logical Solutions to the Frame Problem
Message-ID: <8612090548.AA10845@ucbvax.Berkeley.EDU>
Date: Wed, 3-Dec-86 14:20:02 EST
Article-I.D.: ucbvax.8612090548.AA10845
Posted: Wed Dec  3 14:20:02 1986
Date-Received: Tue, 9-Dec-86 05:14:26 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 45
Approved: ailist@sri-stripe.arpa


                        FINAL CALL 
                     FOR PARTICIPATION
   WORKSHOP ON LOGICAL SOLUTIONS TO THE FRAME PROBLEM

   The American Association for Artificial Intelligence (AAAI) is
sponsoring this workshop in Lawrence, Kansas, 13, 14, 15 April 1987.
   The frame problem is one of the most fundamental problems in
Artificial Intelligence and essentially is the problem of describing in
a computationally reasonable manner what properties persist and what
properties change as action are performed.  The intrinsic problem lies in
the fact that we cannot expect to be able to exhaustively list for every
possible action (or combination of concurrent actions) and for every
possible state of the world how that action (or concurrent actions) change
the truth or falsity of each individual fact.  We can only list the obvious
results of the action and hope that our basic inferential system will be
able to deduce the truth or falsity of the other less obvious facts.
   In recent years there have been a number of approaches to constructing
new kinds of logical systems such as non-monotonic logics, default logics,
circumscription logics, modal reflexive logics, and persistence logics which
hopefully can be applied to solving the frame problem by allowing the missing
facts to be deduced.  This workshop will attempt to bring together the
proponents of these various approaches.
   Papers on logics applicable to the problem of reasoning about such
unintended consequences of actions are invited for consideration.  Two
copies of a full length paper should be sent to the workshop chairman 
before Dec. 19, 1986.  Acceptance notices will be mailed by December 26, 
1986 along with instructions for preparing the final versions of accepted 
papers.  The final versions are due February 1, 1987.
  In order to encourage vigorous interaction and exchange of ideas
the workshop will be kept small -- about 25 participants.  There will
be individual presentations and ample time for technical discussions.
An attempt will be made to define the current state of the art and future
research needs.
	Partial financial support for participants is available.

Workshop Chairman:                
      Dr. Frank M. Brown
      Dept. Computer Science        
      110 strong Hall
      The University of Kansas
      Lawrence, Kansas
      (913) 864-4482

mail net inquiries to: veach%ukans@csnet-relay.csnet