Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 113
AIList Digest Monday, 5 May 1986 Volume 4 : Issue 113
Today's Topics:
Seminars - Use of AI in Project Management and Scheduling (Ames) &
Procedural Abstraction in Soar (UCB) &
Artificial Organisms (CMU) &
Multisensor Robot Systems (MIT),
Conference - 3rd. Int. Logic Programming
----------------------------------------------------------------------
Date: Thu, 1 May 86 09:50:21 pdt
From: eugene@AMES-NAS.ARPA (Eugene Miya)
Subject: Seminar - Use of AI in Project Management and Scheduling (Ames)
National Aeronautics and Space Administration
Ames Research Center
AMES AI FORUM
SEMINAR ANNOUNCEMENT
The Use of AI in Project Management and Scheduling
John C. Kunz, Ph.D
IntelliCorp Corporate Offices
Tuesday, May 13, 1986
10:00 - 11:00 am (NOTE TIME)
N245 Space Sciences Auditorium
NASA Ames Research Center
The discipline of Project Management can potentially contribute both to
the planning and the control of large projects. Knowledge-based systems
can be used to help project and operations managers to identify the
problems they must solve and to consider various alternative approaches
to their problems. This talk will discuss results of using some
prototype systems that support project management and scheduling. The
discussion will consider both some of the management issues and design
of the AI analysis systems.
point of contact: Alison Andrews (415)694-6741
mer.andrews@ames-vmsb.ARPA
VISITORS ARE WELCOME: Register and obtain vehicle pass at Ames Visitor
Reception Building (N-253) or the Security Station near Gate 18. Do not
use the Navy Main Gate.
Non-citizens (except Permanent Residents) must have prior approval from the
Director's Office one week in advance. Submit requests to the point of
contact indicated above. Non-citizens must register at the Visitor
Reception Building. Permanent Residents are required to show Alien
Registration Card at the time of registration.
------------------------------
Date: Thu, 1 May 86 04:44:11 PDT
From: admin%cogsci@berkeley.edu (Cognitive Science Program)
Subject: Seminar - Procedural Abstraction in Soar (UCB)
BERKELEY COGNITIVE SCIENCE PROGRAM
Spring 1986
Cognitive Science Seminar - IDS 237B
Tuesday, May 6, 11:00 - 12:30
2515 Tolman Hall
Discussion: 12:30 - 1:30
3105 Tolman (Beach Room)
``Procedural Abstraction in the Soar Cognitive Architecture''
Paul S. Rosenbloom
Departments of Computer Science and Psychology,
Stanford University
The Soar project is an attempt to build a system capable
of general intelligent behavior -- a cognitive architecture.
It is to be capable of working on the full range of tasks, from
highly routine to extremely difficult open-ended problems;
capable of employing the full range of problem solving methods
and representations required for these tasks; and capable of
learning about all aspects of the tasks and its performance on
them. In this talk I will present an overview of the current
system, which is an approximation to this ideal, and some new
results on the integration of abstraction planning capabilities
into R1-Soar -- the implementation in Soar of an expert system
for computer configuration. Abstraction planning in R1-Soar is
based on the partial execution of procedurally encoded opera-
tors and on Soar's general problem solving and learning capa-
bilities.
------------------------------
Date: 1 May 86 15:56:44 EDT
From: Gregory.Hood@ML.RI.CMU.EDU
Subject: Seminar - Artificial Organisms (CMU)
I will be presenting the last thesis proposal of this semester on Friday,
May 9, at 10:30am (yes, that's Black Friday) in Wean 5409. A copy of the
proposal is in the lounge; I have additional copies available in my office
(8126) for anyone who wants one.
Title: Artificial Organisms: A Neural Modeling Approach
Abstract:
The proposed thesis will investigate autonomous goal-based learning at the
neural modeling level. To support this study, a series of artificial
organisms will be developed within the context of the World Modeling System,
which is a realistic simulated environment. Each organism will be
controlled by an artificially designed nervous system based on
organizational principles found in simple natural organisms such as the
marine snail. The organisms will exhibit several simple forms of learning
such as habituation, sensitization, classical conditioning, and operant
conditioning. Emphasis will be placed on the development of robust
organisms which are capable of prolonged existence within the environment
rather than isolated neural networks which are only capable of single
one-shot learning tasks. It is expected that insights into the relationship
of machine learning to learning in natural organisms will emerge from the
study of these artificial organisms.
------------------------------
Date: 2 May 1986 15:19 EDT (Fri)
From: Claudia Smith <CLAUDIA%OZ.AI.MIT.EDU@XX.LCS.MIT.EDU>
Subject: Seminar - Multisensor Robot Systems (MIT)
INTEGRATION AND COORDINATION OF
MULTI-SENSOR ROBOT SYSTEMS
Hugh F. Durrant-Whyte
University of Pennsylvania
Philadelphia
A multi-sensor robot system comprises many diverse non-homogeneous sources
of information. The sensors of these systems take a variety of disparate
observations of features in the robot environment. The measurements supplied
by the sensor systems are uncertain, partial, occasionally spurious or
incorrect and often incomparable with other sensors views. It is the goal of
the robot system to coordinate and integrate sensor observations into a
consensus best view of the environment which can be used to plan and guide
the execution of tasks.
We will present a methodology for the integration of uncertain sensor
information and the coordination of multi-sensor observation strategies. We
first build a probabilistic model of a sensor's information gathering
characteristics and show how it's views can be extracted from a Gaussian
(stochastic) environment. A methodology is developed for the consistent
integration of disparate sensor views in to a consensus world model. We show
how the information model can be used to obtain maximal-information sensing
strategies and to coordinate the actions of multiple sensor agents. We
demonstrate the utility of these techniques by application to a
robot-mounted tactile array and an active stereo vision system.
Date: Wednesday, May 7th
Time: 4pm
Place: NE43-8th floor playroom
------------------------------
Date: 23 Apr 86 14:55:07 GMT
From: ucdavis!lll-lcc!lll-crg!caip!seismo!mcvax!ukc!icdoc!csa@ucbvax.
berkeley.edu (Cheryl S Anderson)
Subject: Conference - 3rd. Int. Logic Programming
THIRD INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING
July 14-18, 1986
FINAL PROGRAM
Monday, July 14
All Day Tutorial: Logic programming and its applications by Robert
Kowalski and Frank Kriwaczek.
Half Day Tutorials:
A.M. Prolog implementation and architecture. David Warren
or Techniques for natural language processing in Prolog. Michael McCord
P.M. Parallel logic programming. Keith Clark and Steve Gregory
or Japanese Fifth Generation Applications Research. Koichi Furukawa
Tuesday, July 15
KEYNOTE ADDRESS: K. Fuchi, ICOT
1a. Parallel implementations
An abstract machine for restricted AND-parallel execution of logic
programs.
Manuel V. Hermenegildo, University of Texas at Austin.
Efficient management of backtracking in AND-Parallelism.
Manuel V. Hermenegildo, University of Texas at Austin & Roger I. Nasr, MCC.
An intelligent backtracking algorithm for parallel execution of logic
programs.
Vipin Kumar, University of Texas at Austin.
Delta Prolog: a distributed backtracking extension with events.
Luis Moniz Pereira, Luis Monteiro, Jose Cunha & Joaquim N. Aparicio,
Universidade Nova de Lisboa.
1b. Theory and complexity
OLD resolution with tabulation.
Hasao Tamaki, Ibaraki University.
Logic programs and alternation.
P. Stepanek & O. Stepankova, MFF Prague.
Intractable unifiability problems and backtracking.
D.A. Wolfram, Syracuse University.
On the complexity of unification sequences.
Heikki Mannila & Esko Ukkonen, University of Helsinki.
2a. Implementations and architectures
How to invent a Prolog machine.
Peter Kursawe, GMD & University of Karlsruhe.
A sequential implementation of Parlog.
Ian Foster, Steve Gregory, Graem Ringwood, Imperial College & Ken Satoh,
Fujitsu Limited.
A GHC abstract machine and instruction set.
Jacob Levy, Weizmann Institute.
A Prolog processor based on a pattern matching memory device.
Ian Robinson, Schlumberger Palo Alto Research.
2b. Inductive inference and debugging
An improved version of Shapiro's model inference system.
Matthew Huntbach, University of Sussex.
A framework for ICAI systems based on inductive inference and logic
programming.
Kazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho & Jun'ichi Toyoda, Osaka
University.
Rational debugging in logic programming.
Luis Moniz Pereira, Universidade Nova de Lisboa.
Using definite clauses and integrity constraints as the basis for a theory
formation approach to diagnostic reasoning.
Randy Goebel, University of Waterloo, Koichi Furukawa, ICOT & David Poole,
University of Waterloo.
INVITED TALK: Theory of logic programming. Jean-Luis Lassez, IBM
Wednesday, July 16
INVITED TALK: Concurrent logic programming languages. Akikazu Takeuchi
ICOT.
3a. Concurrent logic languages
P-Prolog: a parallel language based on exclusive relation.
Rong Yang & Hideo Aiso, Keio University.
Making exhaustive search programs deterministic.
Kazunori Ueda, ICOT.
Compiling OR-parallelism into AND-parallelism.
Michael Codish & Ehud Shapiro, Weizmann Institute.
A framework for the implementation of Or-parallel languages.
Jacob Levy, Weizmann Institute.
3b. Theory and semantics
Logic program semantics for programming with equations.
Joxan Jaffar & Peter J. Stuckey, Monash University.
On the semantics of logic programmming languages.
Alberto Martelli & Gianfranco Rossi, Universita di Torino.
Towards a formal semantics for concurrent logic programming languages.
Lennart Beckmann, Uppsala University.
Thursday, July 17
INVITED TALK: Logic programming and natural language processing. Michael
McCord, IBM.
4a. Parallel applications and implementations
Parallel logic programming for numeric applications.
Ralph Butler, Ewing Lusk, William McCune & Ross Overbeek, Argonne National
Laboratory.
Deterministic logic grammars.
Harvey Abramson, University of British Columbia.
A parallel parsing system for natural language analysis.
Yuji Matsumoto, ICOT.
4b. Theory and higher-order functions
Equivalence of logic programs.
Michael J. Maher, University of Melbourne.
Qualified answers and their application to transformation.
Phil Vasey, Imperial College.
Procedures in Horn-clause programming.
M.A. Nait Abdallah, University of W. Ontario.
Higher-order logic programming.
Dale A. Miller & Gopalan Nadathur, University of Pennsylvania.
5a. Program analysis
Abstract interpretation of Prolog programs.
C.S. Mellish, University of Sussex.
Verification of Prolog programs using an extension of execution.
Tadashi Kanamori, Mitsubishi Electric Corporation & Hirohisa Seki, ICOT.
Detection and optimization of functional computations in Prolog.
Saumya K. Debray & David S. Warren, SUNY at Stony Brook.
Control of logic program execution based on the functional relations.
Katsuhiko Nakamura, Tokyo Denki University.
5b. Applications and teaching
Declarative graphics.
A. Richard Helm & Kim Marriott, University of Melbourne.
Test-pattern generation for VLSI circuits in a Prolog environment.
Rajiv Gupta, SUNY at Stony Brook.
Using Prolog to represent and reason about protein structure.
C.J. Rawlings, W.R. Taylor, J. Nyakairu, J. Fox & M.J.E. Sternberg,
Imperial Cancer Research Fund & Birkbeck College.
A New approach for introducing Prolog to naive users.
Oded Maler, Zahava Scherz & Ehud Shapiro, Weizmann Institute.
INVITED TALK: Prolog programming environments. Takashi Chikayama, ICOT.
Friday, July 18
INVITED TALK: Logic programming and databases. Jeffery D. Ullman,
Stanford University.
6a. Implementations and databases
A superimposed codeword indexing scheme for very large Prolog databases.
Kotagiri Ramamohanarao & John Shepherd, University of Melbourne.
Interfacing Prolog to a persistent data store.
D.S. Moffat & P.M.D. Gray, University of Aberdeen
General model for implementing DIF and FREEZE.
P. Boizumault, CNRS.
Cyclic tree traversal.
Martin Nilsson & Hidehiko Tanaka, University of Tokyo.
6b. Theory and negation
Completeness of the SLDNF-resolution for a class of logic programs.
R. Barbuti, Universita di Pisa.
Choices in, and limitations of, logic programming.
Paul J. Voda, University of British Columbia.
Negation and quantifiers in NU-Prolog.
Lee Naish, University of Melbourne.
Gracefully adding negation and disjunction to Prolog.
David L. Poole & Randy Goebel, University of Waterloo.
7a. Compilation
Memory performance of Lisp and Prolog programs.
Evan Tick, Stanford University.
The design and implementation of a high-speed incremental portable Prolog
compiler.
Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli & Andrew Turk, Syracuse
University.
Compiler optimizations for the WAM.
Andrew K. Turk, Syracuse University.
Fast decompiling of compiled Prolog clauses.
Kevin A. Buettner, Syracuse University.
7b. Models of computation and implementation
Logic continuations.
Christopher T. Haynes, Indiana University.
Cut & Paste - defining the impure primitives of Prolog.
Chris Moss, Imperial College.
Tokio: logic programming language based on temporal logic and its
compilation to Prolog.
M. Fujita, Fujitsu Labs. Ltd., S. Kono, H. Tanaka & Moto-oka, University of
Tokyo.
The OR-woods description of the execution of logic programs.
Sun Chengzheng & Tzu Yungui, Changsha Institute.
PANEL DISCUSSION: Programming vs. uncovering parallelism. Chair: Keith
Clark, Imperial College.
GENERAL INFORMATION
TIME AND VENUE
Monday 14th to Friday 18th July. Imperial College of Science and
Technology, South Kensington. Sherfield Building - Great Hall, Pippard and
Read Lecture Theatres.
Registration: Tutorials from 8.00 a.m. on Monday and Full Conference from
2.00 p.m. to 8.00 p.m. on Monday and from 8.15 p.m. on Tuesday, in the main
reception area adjacent to the Great Hall.
General information on facilities and entertainment in London will be
available from the main reception desk.
CONFERENCE SESSIONS
The main conference runs from 9.30 a.m. on Tuesday, 15th July until 5.00
p.m. on Friday, 18th July. Technical sessions are divided into two
parallel streams and each paper lasts for approximately 20 minutes. (Each
day has plenary sessions addressed by invited speakers). Morning breaks
are from 10.30-10.50, lunch breaks from 12.30-2.00, and afternoon breaks
from 3.40-4.00.
TUTORIALS
The Tutorial Programme takes place on Monday, 18th July, from 9.30 a.m.
Each tutorial session is priced separately.
COMMERCIAL EXHIBITION
There will be a commercial exhibition located in the Junior Common Room on
the same level as the main conference facilities in the Sherfield Building
from 1.00 p.m. on Monday until Thursday lunchtime. Companies taking part
in the exhibition include software developers, hardware manufacturers and
publishers. A reception will be held in the exhibition area at the end of
the tutorial sessions on Monday. Refreshments will also be available in
the exhibition area during session breaks. Anyone interested in taking
space at the exhibition should contact the Conference Organizers at
Imperial College Tel. 01-589 5111 ext. 5011.
[If you've read this far, you may want to write to me for the social
programme, housing data, and registration forms that were included
in the original message. -- KIL]
------------------------------
End of AIList Digest
********************
