Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!decvax!bellcore!ulysses!ucbvax!ailist
From: LANSKY@SRI-AI.ARPA
Newsgroups: mod.ai
Subject: Seminar - Situation Calculus Planning (SRI)
Message-ID: <8603060653.AA05605@ucbvax.berkeley.edu>
Date: Wed, 5-Mar-86 19:44:14 EST
Article-I.D.: ucbvax.8603060653.AA05605
Posted: Wed Mar  5 19:44:14 1986
Date-Received: Thu, 6-Mar-86 22:13:45 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 24
Approved: ailist@sri-ai.arpa


      SITUATION CALCULUS PLANNING IN BLOCKS AND RELATED WORLDS

			John McCarthy   (JMC@SU-AI)
		     Stanford University

	 	    11:00 AM, MONDAY, March 10
       SRI International, Building E, Room EJ228 (new conference room)

This talk will present mainly ideas rather than completed work.
Situation calculus is based on the equation  s' = result(e,s),
where  s  and  s'  are situations and  e  is an event.  Provided
one can control the deduction adequately, this is a more powerful
formalism than STRIPS.  Planning a sequence of actions, or more
generally, a strategy of actions to achieve a situation with
specified properties, admits a variety of heuristics which
whittle away at the problem.  In many practical situations, these
heuristics, which don't guarantee a full solution but leave a
reduced problem, are sufficient.  Humans appear to use many of them
and so should computer programs.  The talk therefore will concern both
epistemological and heuristic aspects of planning problems.


-------