Copy Link
Add to Bookmark
Report
AIList Digest Volume 5 Issue 261
AIList Digest Friday, 6 Nov 1987 Volume 5 : Issue 261
Today's Topics:
Seminars - A Hybrid Paradigm for Modeling of Complex Systems (TI) &
The Ecology of Computation (SRI) &
Evolving Knowledge and TMS (SRI) &
Conceptual Graphs (SRI) &
Hypothetical Reasoning (SRI) &
Application of Fuzzy Control in Japan (NASA Ames),
Conference - CADE-9 Automated Deduction &
HICSS-22 System Sciences
----------------------------------------------------------------------
Date: Tue, 3 Nov 87 13:51:42 CST
From: "Michael T. Gately" <gately%resbld.csc.ti.com@RELAY.CS.NET>
Subject: Seminar - A Hybrid Paradigm for Modeling of Complex Systems (TI)
Texas Instruments Computer Science Center Lecture Series
A Hybrid Paradigm for Modeling of Complex Systems
Prof. J. Talavage
Purdue University
10:00 am, Friday, 6 November 1987
North Building Cafeteria Room C-4
Abstract
The Network Modeling approach to simulation provides the modeler with
simple yet powerful concepts which can be used to capture the
significant aspects of the system to be modeled. Current network
modeling methodologies, though advanced, lack explicit concepts for
the representation of complex behavior such as decision-making .
Artificial Intelligence research, because of its emphasis on knowledge
representation, has provided several techniques which can be
succesfully applied to the modeling of decision-making behavior. A
hybrid methodology unifying the concepts of Object-oriented
programming, Logic programming and the Discrete-Event approach to
systems modeling should provide a very convenient vehicle for
representing complex systems. The approach has been implemented as a
top-level of CAYENE. CAYENE is a member of the class of programming
languages known as hybrid AI systems and it is based on a formalism of
distributed logic programming. SIMYON is an experimental network
simulation environment embedded in CAYENE. SIMYON is implemented by
defining a library of CAYENE objects analogous to the `blocks' of
network simulation languages and thus providing building blocks for
modeling. Examples of the use of SIMYON to model a job scheduler in a
manufacturing situation, and an adaptive material handling dispatch
mechanism for flexible manufacturing systems are given.
Biography
Dr. Talavage is a Professor of Industrial Engineering at Purdue
University. His teaching and research interests have focussed on the
areas of modeling and simulation, with application to manufacturing
systems. Professor Talavage's current research includes the
integration of artificial intelligence capabilities with those of
simulation/math modeling in order to provide a highly intelligent aid
for production decision support. Since receiving his Ph.D. from Case
Institute of Technology in 1968, Dr. Talavage has published over 100
papers and one book, and is on the Editorial board of the Journal of
Manufacturing Systems and an Associate Editor for the SIMULATION
journal. He has been a consultant to numerous companies and
government agencies.
----------------------------------------------------------------------
The lecture will be given in the North Building Cafeteria Room C-4 at
the Dallas Expressway site. Visitors to TI should contact Dr. Bruce
Flinchbaugh (214-995-0349) in advance and meet in the west entrance
lobby of the North Building by 9:45am.
------------------------------
Date: Tue, 3 Nov 87 09:30:20 PST
From: seminars@csl.sri.com (contact lunt@csl.sri.com)
Subject: Seminar - The Ecology of Computation (SRI)
SRI COMPUTER SCIENCE LAB SEMINAR ANNOUNCEMENT:
THE ECOLOGY OF COMPUTATION
Bernardo A. Huberman
Xerox Palo Alto Research Center
Monday, November 9 at 4:00 pm
SRI International, Computer Science Laboratory, Room EJ228
A most advanced instance of concurrent computation is provided by
distributed processing in open systems which have no global controls.
These emerging heterogeneous networks are becoming self-regulating
entities which in their behavior are very different from their individual
components. Their ability to remotely spawn processes in other computers
and servers of the system offers the possibility of having a community of
computational agents which, in their interactions, are reminiscent of
biological and social organizations. This talk will give a perspective
on computational ecologies, and describe a theory of their behavior which
explicitly takes into account incomplete knowledge and delayed information
on the part of its agents. When processes can choose among many possible
strategies while collaborating in the solution of computational tasks, the
dynamics leads to asymptotic regimes characterized by fixed points,
oscillations and chaos. Finally, we will discuss the possible existence of
a universal law regulating the way in which the benefit of cooperation is
manifested in the system.
NOTE FOR VISITORS TO SRI:
Please arrive at least 10 minutes early in order to sign in and
be shown to the conference room.
SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors
may park in the visitors lot in front of Building E (a tall tan
building on Ravenswood Ave; the turn off Ravenswood has a sign
for Building E), or in the visitors lot in front of Building A
(red brick building at 333 Ravenswood Ave), or in the conference
parking area at the corner of Ravenswood and Middlefield. The
seminar room is in Building E. Visitors should sign in at the
reception desk in the Building E lobby.
Visitors from Communist Bloc countries should make the necessary
arrangements with Fran Leonard (415-859-4124) in SRI Security as
soon as possible.
------------------------------
Date: Thu, 5 Nov 87 14:25:04 PST
From: Amy Lansky <lansky@venice.ai.sri.com>
Subject: Seminar - Evolving Knowledge and TMS (SRI)
EVOLVING KNOWLEDGE AND TMS
Anand S. Rao (ANAND@IBM.COM)
IBM T.J. Watson Research Center and Sydney University
(joint work with
Normal Y. Foo
IBM Systems Research Education Center and Sydney University)
11:00 AM, MONDAY, November 9
SRI International, Building E, Room EJ228
The traditional view of knowledge in the AI literature has been that
'Knowledge' is 'true belief'. The semantic account of this notion
suffers from a major problem called Logical Omniscience, where the
agent knows all valid formulas and his knowledge is closed under
implication. In this talk we propose an alternative viewpoint where
knowledge or EVOLVING KNOWLEDGE (as we call it) is treated as
'indefeasibly justified true belief'. This notion of knowledge solves
the problem of logical omniscience and also captures the
resource-bounded reasoning of agents in a natural way. We give the
semantics and axiomatization of this logic of evolving knowledge and
discuss its properties.
The logic of evolving knowledge also serves as the logical foundation
for the Truth Maintenance System (TMS). We provide a transformation to
and from TMS nodes to formulas in this logic. We show that a set of
nodes has a 'well founded labelling' iff their corresponding IN nodes
are 'satisfiable' in this logic and their corresponding OUT nodes are
'not satisfiable' in this logic. We conclude the talk by comparing our
logic with Autoepistemic Logic, Deduction model of Belief and the
Awareness model of belief.
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
------------------------------
Date: Thu, 5 Nov 87 09:17:21 PST
From: luntzel@csl.sri.com (Elizabeth Luntzel)
Subject: Seminar - Conceptual Graphs (SRI)
SRI COMPUTER SCIENCE LAB SEMINAR ANNOUNCEMENT:
KNOWLEDGE REPRESENTATION WITH CONCEPTUAL GRAPHS
John F. Sowa
IBM Systems Research
and Stanford University
Wednesday, November 11 at 4:00 pm
SRI International, Computer Science Laboratory, Room A113B
Conceptual graphs form a complete system of logic designed to map
as simply as possible to and from natural languages. Like the predicate
calculus, they are general enough to represent anything that can be
represented in rules, frames, and other languages. But they also have
certain formal and practical advantages over the predicate calculus.
Their formal advantages arise from their treatment of objects, contexts,
and sets. Their practical advantages arise from the standard guidelines
they provide for mapping to and from natural languages. Because of their
generality and flexibility, they have been used as the knowledge
representation language for a variety of applications, including planning,
information retrieval, and interfaces between heterogeneous databases and
knowledge bases. This talk will introduce conceptual graphs and show how
they handle a variety of knowledge representation tasks.
John Sowa is a member of the IBM Systems Research Institute in Thornwood,
New York. This fall, he has been visiting the IBM Palo Alto Scientific
Center and teaching a course in the Stanford Computer Science Department.
His work on conceptual graphs has appeared in his book, Conceptual
Structures (Addison-Wesley, 1984), and a new collection of papers on
conceptual graphs will be released in the spring of 1988.
NOTE FOR VISITORS TO SRI:
Please arrive at least 10 minutes early in order to sign in and
be shown to the conference room.
SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors
may park in the visitors lot in front of Building A (red brick
building at 333 Ravenswood Ave) or in the conference parking area
at the corner of Ravenswood and Middlefield. The seminar room is in
Building A. Visitors should sign in at the reception desk in the
Building A lobby.
IMPORTANT: Visitors from Communist Bloc countries should make the
necessary arrangements with Fran Leonard (415-859-4124) in SRI Security
as soon as possible.
------------------------------
Date: Thu, 29 Oct 87 16:55:04 PST
From: Amy Lansky <lansky@venice.ai.sri.com>
Subject: Seminar - Hypothetical Reasoning (SRI)
DEFAULTS AND CONJECTURES:
HYPOTHETICAL REASONING FOR EXPLANATION AND PREDICTION
David Poole (dlpoole%watdragon.waterloo.edu@relay.cs.net)
Logic Programming and Artificial Intelligence Group
University of Waterloo
11:00 AM, MONDAY, November 2
SRI International, Building E, Room EJ228
Classical logic has been criticised as a language for common sense
reasoning as it is monotonic. In this talk I wish to argue that the
problem is not with logic, but with how logic is used. An alternate
way to use logic is by using theory formation; logic tells us what a
theory implies, an inconsistency means that the theory cannot be true
of the world. I show how the simplest form of theory formation, namely
where the user supplies the possible hypotheses, can be used as a
basis for default reasoning and model-based diagnosis. This is the
basis of the "Theorist" system being built at the University of
Waterloo. I will discuss what we have learned from building and using
our system. I will also discuss distinctions which we have found to
be important in practice, such as between explaining observations and
making predictions; and between normality conditions (defaults) and
abnormality conditions (prototypes, conjectures, diseases). The
effects of these distinctions on recognition and prediction problems
will be presented along with algorithms, theorems and examples.
------------------------------
Date: Fri, 30 Oct 87 17:55:10 PST
From: JARED%PLU@ames-io.ARPA
Subject: Seminar - Application of Fuzzy Control in Japan (NASA Ames)
NASA Ames Research Center
Intelligent Systems Forum
Professor Yamakawa, Kumamoto University
and
Professor Hirota, Hosei University (Japan)
The Application of 'Fuzzy Control' in Japan
SUMMARY:
A seminar on the application of 'Fuzzy Control' in Japan and recent work
leading to the creation of 'fuzzy chips', 'fuzzy hardwares', and 'Fuzzy
computers'.
The list of interesting applications include the famous control of the
trains (metro) in the city of Sendai, Japan and a fuzzy controlled in-
telligent robot. This seminar will include illustrations of these
systems.
An abstract of the talk will be sent-out as soon as its received.
Time: 2:00 -- 3:30 p.m.
Date: Nov. 5, 1987
Place: Conf. room 103, Buliding 244
Inquires: Hamid Berenji, (415) 694-6525, berenji%plu@ames-io.arpa
------------------------------
Date: Wed, 4 Nov 87 12:45:07 cst
From: stevens@anl-mcs.ARPA (Rick L. Stevens)
Subject: Conference - CADE-9 Automated Deduction
Final Call for Papers
9th International Conference on Automated
Deduction
May 23-26, 1988
CADE-9 will be held at Argonne National Laboratory (near
Chicago) in celebration of the 25th anniversary of the
discovery of the resolution principle at Argonne in the sum-
mer of 1963. Papers are invited in the following or related
fields:
Theorem Proving Logic Programming
Unification Deductive Databases
Term Rewriting ATP for Non-Standard Logics
Program Verification Inference Systems
The Program Committee consists of:
Peter Andrews Ewing Lusk
W.W. Bledsoe Michael MacRobbie
Alan Bundy Hans-Jorgen Ohlbach
Robert Constable Ross Overbeek
Seif Haridi William Pase
Larry Henschen Jorg Siekmann
Deepak Kapur Mark Stickel
Dallas Lankford Jim Williams
Jean-Louis Lassez
Papers are solicited in three categories:
Long papers: 20 pages, about 5000 words
Short papers: 10 pages, about 2500 words
Extended Abstracts of Working Systems: 2 pages
Problem sets: 5 pages
Long papers are expected to present substantial research
results. Short papers are a forum for briefer presentations
of the results of ongoing research. Extended abstracts are
descriptions of existing automated reasoning systems and
their areas of application. Problem sets should present a
complete, formal representation of some collection of
interesting problems for automated systems to attack. The
problems should currently unavailable in the existing
literature. Three copies should be sent to arrive before
November 23rd, 1987 to
Ewing Lusk and Ross Overbeek, chairmen
CADE-9
Mathematics and Computer Science Division
Argonne National Laboratory
9700 South Cass Avenue
Argonne, IL 60439
Schedule:
November 23, 1987: papers due
January 25, 1988: notification of authors
February 21, 1988: final manuscripts due
Questions should be directed to E. L. Lusk (lusk@anl-
mcs.arpa, phone 312-972-7852) or Ross Overbeek
(overbeek@anl-mcs.arpa, phone 312-972-7856)
------------------------------
Date: 5 November 1987, 17:09:31 EST
From: Bruce Shriver <SHRIVER@ibm.com>
Subject: Conference - HICSS-22 System Sciences
HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES
HICSS-22 SOFTWARE TRACK INTENT TO PARTICIPATE FORM
Twenty-Second Annual HICSS Conference
Jan. 3-6, 1989, Hawaii
GENERAL INFORMATION
HICSS provides a forum for the interchange of ideas, re-
search results, development activities, and applications
among academicians and practitioners in the information,
computing, and system sciences. HICSS is sponsored by the
University of Hawaii in cooperation with the ACM, the IEEE
Computer Society, and the Pacific Research Institute for In-
formation Systems and Management (PRIISM). HICSS-22 will
consist of tutorials, open forums, task forces, a distin-
guished lecturer series, and the presentation of accepted
manuscripts which emphasize research and development activ-
ities in software technology, architecture, decision support
and knowledge-based systems, emerging technologies and ad-
vanced applications. The best papers, selected by the pro-
gram committee in each of these areas, are given an award at
the meeting. There is a high degree of interaction and dis-
cussion among the conference participants as the meeting is
conducted in a workshop-like setting.
INSTRUCTIONS FOR SUBMITTING PAPERS
Manuscripts should be 22-26 typewritten, double-spaced pages
in length. Please do not send submissions that are signif-
icantly shorter or longer than this. Papers must not have
been previously presented or published, nor currently sub-
mitted for journal publication. Each manuscript will be put
through a rigorous refereeing process. Manuscripts should
have a title page that includes the title of the paper, full
name of its author(s), affiliation(s), complete physical and
electronic address(es), telephone number(s) and a 300-word
abstract of the paper.
DEADLINES FOR AUTHORS
o A 300-word abstract is due by March 1, 1988
o Feedback to author concerning abstract by March 31, 1988
o Six copies of the manuscript are due by June 6, 1988.
o Notification of accepted papers by September 1, 1988.
o Accepted manuscripts, camera-ready, are due by October
3, 1988.
DEADLINES FOR MINI-TRACK, SESSION, AND TASK-FORCE COORDINATORS
If you would like to coordinate a mini-track, session, or
task force, you must submit for consideration a 3 page ab-
stract in which you describe the topic you are proposing,
its timeliness and importance, and its treatment in recent
conferences and workshops before December 15, 1987.
PLEASE COMPLETE THE FOLLOWING FORM AND RETURN IT TO:
Bruce D. Shriver
HICSS-22 Conference Co-Chairman
and Software Technology Track Coordinator
IBM T. J. Watson Research Center
P.O. Box 704
Yorktown Heights, NY 10598
(914) 789-7626
CSnet: shriver@ibm.com
Bitnet: shriver@yktvmh
Name ______________________________________________________
Address: ______________________________________________________
City: ______________________________________________________
Phone No. ______________________________________________________
Electronic Mail Address: _______________________________________
I would like to coordinate a mini-track or session in:
I would like to coordinate a task-force in:
I will submit a paper in:
I will referee papers in:
___ ___ ___ ___ Algorithms, Their Analysis and Pragmatics
___ ___ ___ ___ Alternative Language and Programming Paradigms
___ ___ ___ ___ Applying AI Technology to Software Engineering
___ ___ ___ ___ Communication & Protocol Software Issues
___ ___ ___ ___ Database Formalisms, Software and Systems
___ ___ ___ ___ Designing & Prototyping Complex Systems
___ ___ ___ ___ Distributed Software Systems
___ ___ ___ ___ Electronic Publishing & Authoring Systems
___ ___ ___ ___ Language Design & Language Implementation Technology
___ ___ ___ ___ Models of Program and System Behavior
___ ___ ___ ___ Programming Supercomputers & Massively Parallel Systems
___ ___ ___ ___ Reuseability in Design & Implementation
___ ___ ___ ___ Software Design Tools/Techniques/Environments
___ ___ ___ ___ Software Related Social and Legal Issues
___ ___ ___ ___ Testing, Verification, & Validation of Software
___ ___ ___ ___ User Interfaces
___ ___ ___ ___ Workstation Operating Systems and Environments
___ ___ ___ ___ Other ______________________________
------------------------------
End of AIList Digest
********************
