Copy Link
Add to Bookmark
Report
AIList Digest Volume 5 Issue 008
AIList Digest Monday, 19 Jan 1987 Volume 5 : Issue 8
Today's Topics:
Seminars - General Logic (SRI) &
Using Fast and Slow Weights (UCB) &
An Implementation of Adaptive Search (SRI) &
The Semantics of Clocks (CSLI) &
Intelligent Database Systems (SRI) &
Formal Theories of Action (SU) &
Mid-Atlantic Math Logic Seminar (UPenn),
Conference - Directions & Implications of Advanced Computing
----------------------------------------------------------------------
Date: Wed 14 Jan 87 11:26:56-PST
From: Jose Meseguer <MESEGUER@CSL.SRI.COM>
Subject: Seminar - General Logic (SRI)
GENERAL LOGIC
by
Prof. Gordon Plotkin
C.S. Dept. Univ. of Edinburgh, Scotland
WHEN: Thursday Jan. 15, at 1:30 pm
WHERE: SRI, Room AA298
A wide variety of logics have been proposed for use in Computer
Science , such as first-order , higher-order , type theories , temporal and
modal logics , dynamic logic etc etc . One would like to write proof-checkers
and (semi-) automatic theorem provers for them , but implementing any one is
a major undertaking and it is very hard to vary the logic once work is
underway . We propose a general syntactic theory of logic building on
work of Martin-Lof and employing a lambda calculus of dependent types.It
enables one to use a signature to enter the syntax and rules , in natural
deuction style. It seems likely to allow the efficient production of basic
proof checkers from the signature and to provide the user the tools to
write theorem provers.
------------------------------
Date: Thu, 15 Jan 87 10:35:57 PST
From: admin%cogsci.Berkeley.EDU@berkeley.edu (Cognitive Science
Program)
Subject: Seminar - Using Fast and Slow Weights (UCB)
BERKELEY COGNITIVE SCIENCE PROGRAM
SPRING - 1987
Cognitive Science Seminar - IDS 237B
Tuesday, January 27, 11:00 - 12:30
2515 Tolman Hall
Discussion: 12:30 - 1:30
2515 Tolman Hall
``Using fast weights to deblur old memories and assimilate new ones."
Geoff Hinton
Computer Science
Carnegie Mellon
Connectionist models usually have a single weight on each connection. Some
interesting new properties emerge if each connection has two
weights -- a slow, plastic weight which stores long-term
knowledge and a fast, elastic weight which stores temporary
knowledge and spontaneously decays towards zero. Suppose that a
network learns a set of associations, and then subsequently
learns more associations. Associations in the first set will be-
come "blurred", but it is possible to deblur all the associations
in the first set by rehearsing on just a few of them. The
rehearsal allows the fast weights to take on values that cancel
out the changes in the slow weights caused by the subsequent
learning.
Fast weights can also be used to minimize interference by minim-
izing the changes to the slow weights that are required to as-
similate new knowledge. The fast weights search for the smallest
change in the slow weights that is capable of incorporating the
new knowledge. This is equivalent to searching for analogies
that allow the new knowledge to be represented as a minor varia-
tion of the old knowledge.
---------------------------------------------------------------
UPCOMING TALKS
Feb 10: Anne Treisman, Psychology Department, UC Berkeley.
---------------------------------------------------------------
ELSEWHERE ON CAMPUS
Geoff Hinton will speak at the SESAME Colloquium on Monday Jan. 26, in
Tolman 2515 from 4-6.
------------------------------
Date: Thu, 15 Jan 87 16:56:24 PST
From: lansky@sri-venice.ARPA (Amy Lansky)
Subject: Seminar - An Implementation of Adaptive Search (SRI)
AN IMPLEMENTATION OF ADAPTIVE SEARCH
Takashi Sakuragawa (TAKASHI@IBM.COM)
IBM T. J. Watson Research Center and Kyoto University
3:00 PM, FRIDAY, January 16
SRI International, Building E, Room EK242
The Adaptive Optimizer is a program that optimizes Prolog programs by
reordering clauses. It is an implementation of Natarajan's adaptive
search algorithm that reorders the subproblems of a disjunctive
problem and minimizes the expected search effort. This talk will
describe implementation details as well as how the efficiency of an
example tree search program is improved. In this particular example,
the execution speed of the optimized program is more than 200 times
faster than the original one. The speed improvement observed is for
an artificial example and is not necessarily representative of what
might be obtained from real applications.
------------------------------
Date: Wed 14 Jan 87 17:45:10-PST
From: Emma Pease <Emma@CSLI.STANFORD.EDU>
Subject: Seminar - The Semantics of Clocks (CSLI)
The Semantics of Clocks
Brian Smith
January 22
Clocks participate in their subject matter. Temporal by nature, they
also represent time. And yet, like other representational systems,
clocks have been hard to build, and can be wrong. For these and other
reasons clocks are a good foil with which to explore issues in AI and
cognitive science about computation, mind, and the relation between
semantics and mechanism.
An analysis will be presented of clock face content and the
function of clockworks, and of various notions of chronological
correctness. The results are intended to illustrate a more general
challenge to the formality of inference, to widen our conception of
computation, and to clarify the conditions governing representational
systems in general.
Please note that this Thursday's Seminar will be in the Ventura
Trailer Classroom, not in Redwood G-19. Future Thursday Seminars will
also meet in the Ventura Trailer Classroom until a better room can be
found.
------------------------------
Date: Fri 16 Jan 87 17:10:18-PST
From: Amy Lansky <LANSKY@SRI-VENICE.ARPA>
Subject: Seminar - Intelligent Database Systems (SRI)
INTELLIGENT DATABASE SYSTEMS
Matthew Morgenstern (MORGENSTERN@SRI-CSL)
SRI International
11:00 AM, THURSDAY, January 22
SRI International, Building E, Room EK242
The goal is to create databases which are more intelligent about the
application they serve and more active as part of an overall system. Our
approach builds upon expert systems and other A.I. techniques to develop
capabilities for: (1) knowledge-based support for managing data,
(2) integrity and fault tolerance of the database, (3) interactive
formation and evaluation of what-if scenarios (plans), and (4) offloading
data-oriented activities and requirements from application programs --
thus aiding the software development process by providing a higher level
interface to the database.
We also are interested in (5) the relationship between inference and DB
security -- that is, detecting potential violations of security in a
multi-level database due to inference of high level data from visible
lower level data; and (6) support for heterogeneous distributed databases.
These capabilities require that the database be augmented with knowledge
of the application. We utilize constraints to describe the structure,
behavior, and requirements (semantics) of the application. Collections of
rules are associated with these constraints and automatically invoked in
response to database activity to enforce the application requirements.
------------------------------
Date: 17 Jan 87 2119 PST
From: Vladimir Lifschitz <VAL@SAIL.STANFORD.EDU>
Subject: Seminar - Formal Theories of Action (SU)
Commonsense and Nonmonotonic Reasoning Seminar
FORMAL THEORIES OF ACTION
Vladimir Lifschitz
Thursday, January 22, 4pm
Bldg. 160, Room 161K
We apply circumscription to formalizing reasoning about the effects
of actions in the framework of situation calculus. An axiomatic description
of causal connections between actions and changes allows us to solve the
qualification problem and the frame problem using only simple forms of
circumscription.
In this talk the method is illustrated by constructing a
circumscriptive theory of the blocks world in which blocks can be moved
and painted. We show that the theory allows us to compute the result of
the execution of any sequential plan.
------------------------------
Date: Fri, 16 Jan 87 19:04:25 EST
From: dale@linc.cis.upenn.edu (Dale Miller)
Subject: Seminar - Mid-Atlantic Math Logic Seminar (UPenn)
MID-ATLANTIC MATHEMATICAL LOGIC SEMINAR
PHILADELPHIA, FEBRUARY 21-22, 1987
This meeting will be held at the University of Pennsylvania, Alumni Room,
Towne Building. Please use ground level entrance on the west side just off
Smith Walk, between 33rd and 34th Streets, south of Walnut Street.
SATURDAY, FEBRUARY 21
12 noon Coffee and snacks
1:00 - 2:00 Dana S. Scott, Carnegie-Mellon University
HOW DESIRABLE IS THE REALIZABILITY UNIVERSE?
2:10 - 3:10 Albert R. Meyer, Massachusetts Institute of Technology
FIXED POINT AND LOOPING COMBINATORS IN POLYMORPHIC LAMBDA
CALCULUS
3:40 - 4:40 Peter J. Freyd, University of Pennsylvania
CATEGORIES AND POLYMORPHIC LAMBDA CALCULUS
4:50 - 5:50 John C. Mitchell, A.T.&T. Bell Laboratories
KRIPKE STRUCTURES AND TYPED LAMBDA CALCULUS
SUNDAY, FEBRUARY 22
8:30 Coffee and doughnuts
9:00 - 10:00 Speaker T.B.A., Cornell University
RECURSIVE TYPES IN THE NUPRL PROOF DEVELOPMENT SYSTEM
10:10 - 11:10 Garrel Pottinger, Odyssey Research Associates, Inc.
STRONG NORMALIZATION FOR TERMS OF THE COQUAND-HUET THEORY
OF CONSTRUCTIONS
11:25 - 12:25 Gaisi Takeuti, University of Illinois at Urbana-Champaign
BOUNDED ARITHMETIC AND A WEAK CONSISTENCY
12:35 - 1:35 Scott Weinstein, University of Pennsylvania
SOME RECENT RESULTS IN THE THEORY OF MACHINE INDUCTIVE
INFERENCE
ACCOMMODATIONS
A block of 10 rooms has been set aside at the Sheraton Inn University City,
Chestnut and 36th Streets (215/387-8000) for the participants of the "Logic
Meeting", Saturday night, February 21. The price per room is $64 if you make
your reservation by February 7. Private accommodations will be available for
up to 10 people with sleeping bags. Please call at least 3 days in advance
215/898-8475 or 215/545-5443.
Andre Scedrov
ARPANET: Andre@cis.upenn.edu
------------------------------
Date: 12 Jan 87 20:56:26 GMT
From: jade!iris.berkeley.edu!michael@ucbvax.Berkeley.EDU (Tom Slone
[(415)486-5954])
Subject: Conference - Directions & Implications of Advanced Computing
DIRECTIONS AND IMPLICATIONS OF ADVANCED COMPUTING
Seattle, Washington
July 12, 1987
The adoption of current computing technology, and of technologies that seem
likely to emerge in the near future, will have a significant impact on the
military, on financial affairs, on privacy and civil liberty, on the medical
and educational professions, and on commerce and business.
The aim of the symposium is to consider these influences in a social and
political context as well as a technical one. The social implications of
current computing technology, particularly in artificial intelligence, are such
that attempts to separate science and policy are unrealistic. We therefore
solicit papers that directly address the wide range of ethical and moral
questions that lie at the junction of science and policy.
Within this broad context, we request papers that address the following
particular topics. The scope of the topics includes, but is not limited to, the
sub-topics listed.
RESEARCH FUNDING: Sources; Effects; Funding alternatives.
DEFENSE APPLICATIONS: Machine autonomy and the conduct of war; Practical limits
on the automation of war; Can an automated defense system make war
obsolete?
COMPUTING IN A DEMOCRATIC SOCIETY: Community access; Computerized voting; Civil
liberties; Computing and the future of work; Risks of the new technology
COMPUTERS IN THE PUBLIC INTEREST: Computing access for handicapped people;
Resource modeling; Arbitration and conflict resolution; Educational,
medical and legal software
Submissions will be read by members of the program committee, with the
assistance of outside referees. Tentative program committee includes Andrew
Black (U.Wa), Alan Borning (U.Wa), Jonathan Jacky (U.Wa), Nancy Leveson (UCI),
Abbe Mowshowitz (CCNY), Herb Simon (CMU) and Terry Winograd (Stanford).
Complete papers, not exceeding 6000 words, should include an abstract, and a
heading indicating to which topic it relates. Papers related to AI and/or
in-progress work will be favored. Submissions will be judged on clarity,
insight, significance, and originality. Papers (3 copies) are due by April 1.
Notices of acceptance or rejection will by mailed by May 1. Camera ready copy
will by due by June 1.
Proceedings will be distributed at the Symposium, and will be on sale during the
1987 AAAI conference.
For further information contact Jonathan Jacky (206-548-4117) or Doug Schuler
(206-783-0145).
Sponsored by Computer Professionals for Social Responsibility, P.O. Box 85481,
Seattle, WA 98105.
michael@ucbiris.berkeley.edu michael%ucbiris@berkeley.arpa
{bellcore|cbosgd|decvax|hplabs|ihnp4| \
nbires|sdcsvax|tektronix|ulysses}!ucbvax!ucbiris!michael
"If there's going to be a bloodbath, let's get it over with." --Reagan
------------------------------
End of AIList Digest
********************
