Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 167
AIList Digest Wednesday, 16 Jul 1986 Volume 4 : Issue 167
Today's Topics:
Seminars - SIDESMAN Silicon Design System (CMU) &
Automata Theory, Nuprl Proof Development System (SRI),
Conference - AAAI Workshop on Parallel Models, Symbolic Processing &
3rd IEEE Conference on AI Applications
----------------------------------------------------------------------
Date: 9 Jul 1986 1227-EDT
From: Laura Forsyth <FORSYTH@C.CS.CMU.EDU>
Subject: Seminar - SIDESMAN Silicon Design System (CMU)
Wednesday, July 9th, 2:00 p.m.
Room 5409 Wean Hall
Professor Hilary J. Kahn
SIDESMAN
A Silicon Design System Which Has Knowledge Based Components
Hilary J. Kahn
Department of Computer Science
University of Manchester
Oxford Road
Manchester M13 9PL
England
The SIDESMAN system is a silicon design system which has the
following properties:
- Facilities to ensure that application processes are
technology adaptable
- Support for Knowledge Based CAD applications where
appropriate
- A range of tools to support a general silicon
compilation system
- Access to a specialist hardware simulation
machine
This walk will discuss the general structure and motivations behind the
SIDESMAN system and will briefly discuss some of the SIDESMAN application
processrs.
The work detailed is part of a current research project being undertaken
by H.J. Kahn and N.P. Filer
------------------------------
Date: Mon 14 Jul 86 11:54:31-PDT
From: Richard Waldinger <WALDINGER@SRI-WARBUCKS.ARPA>
Subject: Seminar - Automata Theory, Nuprl Proof Development System (SRI)
Title: Implementing Automata Theory within the Nuprl Proof Development
System
Speaker: Christoph Kreitz, Dept. of Computer Science, Cornell University
Time: Wednesday, 16 July, 4:15pm (Visitors from
outside please come to reception desk a little
early. Coffee at 3:45 in Waldinger office)
Place: EJ228 (New AI Center Conference Room) SRI
International, Building E
IMPLEMENTING AUTOMATA THEORY
with the
Nuprl Proof Development System
by
Christoph Kreitz
Department of Computer Science
Cornell University
Problem solving is a significant part of science and mathematics and
is the most intellectually significant part of programming. Nuprl is
a computer system which provides assistance with solving a problem.
It supports the creation of formulas, proofs and terms in a formal
theory of mathematics; with it one can express concepts associated
with definitions, theorems, theories, books and libraries. Moreover
the formal theory behind it is sensitive to the computational meaning
of terms, assertions and proofs, and the computer system is able to
carry out the corresponding actions. Thus Nuprl includes
computer-aided program development, but in a broader sense it is a
system for proving theorems and implementing mathematics.
The actual implementation of a mathematical theory, such as the theory
of finite automata, with the Nuprl proof development system gives lots
of insights into its strengths and weaknesses and shows that it is
powerful enough to obtain nontrivial results within reasonable amounts
of time.
The talk will give a brief overview of Nuprl, its object language and
inference rules (Type Theory), and of features of the computer system
itself. These features support partial automatization of the problem
solving process and extensions of the object language by a Nuprl user.
Details of the implementation of automata theory will be shown
afterwards. I will describe some of the techniques and extensions to
Nuprl which were necessary to formulate and prove theorems from
automata theory. In particular, these techniques keep Nuprl proofs
small and understandable. I will present a complete Nuprl proof of
the pumping lemma and an evaluation of its computational content as
performed on a computer. Finally an outline for possible future
developments is given.
------------------------------
Date: Mon, 14 Jul 86 16:44:58 edt
From: Beth Adelson <adelson@YALE.ARPA>
Subject: Conference - AAAI Workshop on Parallel Models, Symbolic Processing
WORKSHOP ON PARALLEL MODELS AND SYMBOLIC PROCESSING
Chair: Beth Adelson
The purpose of the workshop is to look at current connectionist models in
light of traditional AI problems. We will ask how the connectionist and the
traditional approaches inform and constrain each other. Several new
connectionist approaches to central AI problems will be presented. These new
approaches address some issues which have previously been important but
difficult in connectionism.
SCHEDULE:
Drew McDermott
Yale University
What AI Needs From Connectionism
Jerome Feldman
University of Rochester
Semantic Networks and Neural Nets
Geoffrey Hinton
Carnegie Mellon University
Connectionists Make Better Bayesians:
Bayesian Inference In A Connectionist Network
David Waltz
Thinking Machines
Challenges and Directions for Connectionism
Organizer: Beth Adelson
adelson@yale
Before July 26:
NSF
Washington, DC 20550
(202) 357-9569
After July 26:
Tufts University
Department of Computer Science
Medford, MA 02155
(617) 381-3214
Length: 3 hours:
Four 20 minute talks with 10 minutes for questions after each
One hour for audience discussion.
Date: August 14
Time: 1-4 PM
Place: Room 213 in the Law School
Attendees: Open to anyone registered at the conference
(but audience size is limited to 100)
------------------------------
Date: Fri 11 Jul 86 18:57:46-CDT
From: Jim Miller <HI.JMILLER@MCC.COM>
Subject: Conference - 3rd IEEE Conference on AI Applications
CALL FOR PAPERS
THE THIRD IEEE CONFERENCE ON
ARTIFICIAL INTELLIGENCE APPLICATIONS
ORLANDO HYATT REGENCY
ORLANDO, FLORIDA
FEBRUARY 22-28, 1987
SPONSORED BY THE IEEE COMPUTER SOCIETY
This conference is devoted to the application of artificial intelligence
techniques to real-world problems. Two kinds of papers are appropriate:
- Papers that focus on knowledge-based techniques that can be applied
effectively to important problems, and
- Papers that focus on particular knowledge-based application programs
that solve significant problems.
AI techniques include: Application areas include:
- Knowledge representation - Science and engineering
- Reasoning - Medicine
- Knowledge acquisition - Business
- Learning - Natural language
- Uncertainty - Intelligent interfaces
- General tools - Vision
- Robotics
Only new, significant, and previously unpublished work will be accepted. Two
kinds of papers may be submitted:
- Full papers: 5000 words maximum, describing significant completed
research.
- Poster session papers: 1000 words, describing interesting ongoing
research.
Both categories of papers will be reviewed by the Program Committee.
CONFERENCE COMMITTEE
General chair: Program committee chairs:
Jan Aikins, Aion James Miller and Elaine Rich, MCC
Program committee:
Jan Aikins, Aion Benjamin Kuipers, University of Texas
Byron Davies, Texas Instruments John McDermott, Carnegie-Mellon
William Clancey, Stanford University Charles Petrie, MCC
Keith Clark, Imperial College John Roach, Virginia Polytechnic
Michael Fehling, Teknowledge J. M. Tenenbaum, Schlumberger
Mark Fox, Carnegie-Mellon University Harry Tennant, Texas Instruments
Bruce Hamill, Johns Hopkins/APL Charles R. Weisbin, Oak Ridge
Peter Hart, Syntelligence Michael Williams, Intellicorp
Elaine Kant, Schlumberger
SUBMISSION INFORMATION
- Full length papers: Submit four copies of the paper by September 9,
1986 to the Program Committee chairs, listed below. The first page of
the paper should contain the author's (or authors') name, affiliation,
and address, a 100 word abstract, and a list of appropriate subject
categories, both AI topics and application areas. Conference sessions
may be organized around either kind of subject category. Authors are
not restricted to only those categories listed above. Accepted papers
will be allocated six manuscript pages in the proceedings.
- Poster session papers: Submit four copies of a 1000 word abstract by
December 1, 1986 to the Program Committee chairs, listed below.
Indicate on the front of the paper all appropriate subject categories.
Accepted abstracts will be reprinted and distributed at the
conference. In addition, authors of accepted poster session papers
will be provided with table space at the conference to display
examples of their work and to discuss their findings with others.
IMPORTANT DATES
- Full-length papers must be received by: September 9, 1986
- Authors notifications mailed: October 24, 1986
- Accepted full-length papers returned to IEEE for proceedings:
November 15, 1986
- Poster session papers must be received by: December 1, 1986
- Conference: February 22 - 28, 1987, Orlando, Florida
FOR FURTHER INFORMATION, CONTACT:
Jan Aikins James Miller
General Chair Elaine Rich
Third IEEE Conference on Program Committee Chairs
Artificial Intelligence Third IEEE Conference on
Applications Artificial Intelligence
Aion Corporation Applications
101 University Avenue MCC
Palo Alto, California 94301 9430 Research Blvd.
Austin, Texas 78759
------------------------------
End of AIList Digest
********************
