Copy Link
Add to Bookmark
Report
AIList Digest Volume 5 Issue 038
AIList Digest Wednesday, 11 Feb 1987 Volume 5 : Issue 38
Today's Topics:
Seminars - High-Level Architecture for LISP (SMU) &
Combinatorics of Rule-Based Expert Systems (Rutgers) &
Optimal Histories for Default Reasoning (SU),
Conference - Extended Deadline for AAAI Uncertainty in AI Workshop &
IEEE First Annual Conference on Neural Networks &
Office Knowledge
----------------------------------------------------------------------
Date: WED, 10 oct 86 17:02:23 CDT
From: leff%smu@csnet-relay
Subject: Seminar - High-Level Architecture for LISP (SMU)
Wednesday, February 11, 1987, Computer Science and Engineering, Southern
Methodist University, Dallas, Texas 315SIC, 1:30 PM
High-Level Language Architecture for LISP
Steve Krueger (kreuger%home@TI-CSL)
Symbolic Computing Laboratory
Texas Instruments
The TI LISP Machine family utilizes a high-level language architecture
for LISP in order to gain high performance, preserve the full dynamic
behavior of LISP and support software debugging. These processors
support a complex high-level language instruction set for Common LISP (a
rich dialect of LISP) implemented in hardware and microcode. Support
for LISP and the instruction set gives high LISP performance. An
overview and motivation of the HLL instruction set will be given, as
will an overview of TI's LISP architecture.
Steven D. Krueger
S.M. Massachusetts Institute of Technology, Computer Science, 1980.
S.B. Massachusetts Institute of Technology, Electrical Engineering,
1980.
Mr Krueger is a Sr. Member of Technical Staff in TI Computer Science
Center where his research interests are in computer architecture
and hardware/software interfaces. He is responsible for the
architecture of the Explorer Lisp Machine processor and its
successors. He has been involved in Explorer since early 1983 and has
made contributions to the processor and system architecture, and was
leader of the hardware and software integration team. He also
contributed to the architecture of the single chip Lisp processor
(CLM) and is responsible for an improved instruction set architecture
for Explorer and CLM.
------------------------------
Date: 4 Feb 87 22:30:28 EST
From: KALANTARI@RED.RUTGERS.EDU
Subject: Seminar - Combinatorics of Rule-Based Expert Systems
(Rutgers)
RUTGERS COMPUTER SCIENCE AND RUTCOR COLLOQUIUM SCHEDULE - SPRING 1987
Computer Science Department Colloquium :
DATE: Friday, Feb. 6, 1987
SPEAKER: Wiktor Marek
AFFILIATION: University of Kentucky
TITLE: "On the logic and combinatorics of rule-based expert systems"
TIME: 2:50 (Coffee and Cookies will be setup at 2:30)
PLACE: Hill Center, Room 705
We discuss some basic issues of rule-based expert systems, their
logic and the main complexity issues related to the algorithms of
deciding the consistency and completeness of such systems. In
addition we study the connections to the theory of non-first
normal form relational databases and find the applications of our
theory to non-first normal form relations.
------------------------------
Date: 06 Feb 87 1028 PST
From: Vladimir Lifschitz <VAL@SAIL.STANFORD.EDU>
Subject: Seminar - Optimal Histories for Default Reasoning (SU)
Commonsense and Nonmonotonic Reasoning Seminar
OPTIMAL HISTORIES: A TEMPORAL APPROACH TO DEFAULT REASONING
Van Nguyen
IBM T.J.Watson Research Center
Yorktown Heights, NY 10598
Thursday, February 12, 4pm
Bldg. 160, Room 161K
A new technique in default reasoning (non-monotonic reasoning)
is presented. It is based on the notion of optimal histories.
Intuitively, an optimal history contains a sequence of sets S(n),
n = 0, 1, ..., of first-order formulae. Each S(n) is a description of
the state of the world, as seen by some computing agent, at time
(situation) n. State S(n+1) is computed from S(n) and the event
(action) E(n+1) that occurs at time n+1 by a default-inference rule,
so that facts that are true in S(n) tend to stay true in S(n+1), unless
something falsifies them. Other parameters of an optimal history are
the deductive ability of the computing agent and a set of basic axioms
and constraints. Thus an optimal history is a description of how the
world changes with new events, as time passes.
The technique is applicable to such problems in default reasoning as
belief revision, dealing with exceptions to general rules, the frame
problem of McCarthy and Hayes, the qualification problem of McCarthy,
and the temporal projection problem of Hanks and McDermott. Optimal
histories can also be formulated in the framework of temporal logic of
Manna and Pnueli.
------------------------------
Date: Sat, 7 Feb 87 21:39:25 pst
From: levitt@ads.ARPA (Tod Levitt)
Subject: Conference - Extended Deadline for AAAI Uncertainty in AI
Workshop
EXTENSION OF SUBMISSION DEADLINE
for
AAAI UNCERTAINTY IN ARTIFICIAL INTELLIGENCE WORKSHOP
Seattle, Washington
July 10-12, 1987
Due to conflicts with a number of other submission deadlines for
related conferences and workshops, the deadline for the 1987
Uncertainty in AI workshop is being extended until March 10, 1987.
Please send four copies of papers or extended abstracts to
Tod S. Levitt
c/o Advanced Decision Systems
201 San Antonio Circle, Suite 286
Mountain View, California 94040
------------------------------
Date: Fri, 6 Feb 87 17:58 EDT
From: MIKE@BUCASA.BITNET
Subject: Conference - IEEE First Annual Conference on Neural Networks
From: <grossberg@nprdc.arpa> (Stephen Grossberg)
IEEE First Annual Conference on Neural Networks, San Diego,
California, 21-24 June 1987. Requests from many scientists who
heard about the meeting only recently have led to a revised
deadline for abstracts and papers.
Extended abstracts should be submitted for conference
presentation by April 1, 1987
Abstracts received after April 1, 1987 will be returned.
Please submit abstract plus 4 clean copies. Abstracts
must be neatly typed, single spaced, and no more than four
pages.
Abstracts will be carefully refereed as they are received.
Authors of accepted abstracts will be notified as soon after
receipt as possible, and no later than the first week of May.
Authors of accepted abstracts will promptly be sent materials
for paper preparation. Papers can be up to 8 pages in length.
Final papers for publication in the book of proceedings are
due no later than June 21, 1987 at the meeting. The
proceedings will be published in the Fall of 1987.
Address all correspondence referring to abstracts and papers
to:
Maureen Caudill
IEEE - ICNN
10615G Tierrasanta Blvd.
Suite 346
San Diego, California 92124
Telephone: (619) 457-5550, ext. 221
------------------------------
Date: Mon, 9 Feb 87 07:49:30 est
From: rba@flash.bellcore.com (Robert B. Allen)
Subject: Conference - Office Knowledge
CALL FOR PARTICIPATION
IFIP WG8.4 Workshop on
Office Knowledge: Representation, Management and Utilization
17-19 August 1987
University of Toronto
Toronto, Canada
WORKSHOP CHAIRMAN PROGRAM CHAIRMAN
Prof. Dr. Alex A. Verrijn-Stuart Dr. Winfried Lamersdorf
University of Leiden IBM European Networking Center
ORGANIZING CHAIRMAN
Prof. Fred H. Lochovsky
University of Toronto
This workshop is intended as a forum and focus for research in
the representation, management and utilization of knowledge in
the office. This research area draws from and extends techniques
in the areas of artificial intelligence, data base management
systems, programming languages, and communication systems. The
workshop program will consist of one day of invited presentations
from key researchers in the area plus one and one half days of
contributed presentations. Extended abstracts, in English, of
4-8 double-spaced pages (1,000-2,000 words) are invited. Each
submission will be screened for relevance and potential to
stimulate discussion. There will be no formal workshop
proceedings. However, accepted submissions will appear as
2
submitted in a special issue of the WG8.4 newsletter and will be
made available to workshop participants.
How to submit
Four copies of double-spaced extended abstracts in English of
1,000-2,000 words (4-8 pages) should be submitted by 15 April
1987 to the Program Chairman:
Dr. Winfried Lamersdorf
IBM European Networking Center
Tiergartenstrasse 15
Postfach 10 30 68
D-6900 Heidelberg
West Germany
Important Dates
Extended abstracts due: 15 April 1987
Notification of acceptance for presentation: 1 June 1987
Workshop: 17-19 August 1987
------------------------------
End of AIList Digest
********************
