Copy Link
Add to Bookmark
Report
AIList Digest Volume 5 Issue 194
AIList Digest Wednesday, 5 Aug 1987 Volume 5 : Issue 194
Today's Topics:
Administrivia - New Host Computer,
Queries - Request for Bibliographic Data &
Common Lisp OPS5 & Kyoto Common Lisp &
Image Feature Tracking,
AI Tools - NLP Front-Ends to INGRES,
Journal - Journal of Automated Reasoning,
Seminars - Comparative Analysis (SRI) &
Uncertainties in Robot Planning (SU),
Conference - Logic in Computer Science
----------------------------------------------------------------------
Date: Tue 4 Aug 87 21:27:51-PDT
From: Ken Laws <Laws@SRI.Com>
Subject: New Host Computer
SRI has moved AIList from STRIPE.SRI.COM to a new computer,
now known as SRI.COM. The old address will continue to work,
but you may use the shorter form if you prefer.
It took me a couple of days to get the hang of the new system,
but the mailer seems to be working for me again. Let me know
if any new problems show up at your end.
-- Ken
------------------------------
Date: 30 Jul 87 13:39:42 GMT
From: mcvax!dnlunx!lippolt@seismo.css.gov (Ben Lippolt)
Subject: Request for bibliographic data
Does anyone know where I could get files with bibliographic data
(in "refer" format) of the following proceedings:
IJCAI '79 '81 '83 '85 (and '87)
AAAI '80 '82 '83 '84 '86 and '87
Just the titles, authors and pagenumbers would be enough (although
keywords and abstracts would also be nice).
----
Ben Lippolt, tel: +31 70 435439
PTT - Dr. Neher Labs, telex: 31236 dnl nl
P.O. Box 421, telefax: +31 70 436477
2260 AK Leidschendam, UUCP: ..!mcvax!dnlunx!lippolt
Netherlands.
------------------------------
Date: Thu 30 Jul 87 08:32:07-EDT
From: John C. Akbari <AKBARI@CS.COLUMBIA.EDU>
Subject: request for cl ops5
anyone know of, or willing to give out, a reasonably good (fast) common
lisp interpreter [for OPS5]? an efficient version for symbolics (release 7.1)
would be ideal.
ad...THANKS...vance!
-*- Mode: Text -*-
John C. Akbari
380 Riverside Drive, No. 7D
New York, New York 10025
Tele. 212.662.2476
ARPANET & Internet akbari@CS.COLUMBIA.EDU
BITnet akbari%CS.COLUMBIA.EDU@WISCVM.WISC.EDU
UUCP columbia!cs.columbia.edu!akbari
------------------------------
Date: 3 Aug 87 14:52:51 GMT
From: astroatc!murphy@rsch.wisc.edu (Kathy Murphy)
Subject: Kyoto Common Lisp
We are in the process of selecting a Lisp package to port to a new
computer system (target market is NOT the AI community but we would
like to have a Lisp compiler and interpreter available on the
system). At the moment our choice is limited to either Kyoto
Common Lisp or the pd version of FRANZ LISP. KCL appears to be
much simpler to port and maintain but we have no idea how potential
users view KCL vs pd FRANZ. I would appreciate comments on the
following:
General experience with KCL.
KCL vs pd FRANZ LISP.
The importance of Lisp compiler speed - KCL's compiler is very slow.
Please mail replies directly to me. If there is enough interest I
can summarize results. Thank you.
--
Kathleen Murphy ...!uwvax!astroatc!murphy
Astronautics Technology Center
5800 Cottage Grove Rd. (608) 221-9001, x137
Madison, WI 53716
------------------------------
Date: 1 Aug 87 19:18:48 GMT
From: jbn@glacier.stanford.edu (John B. Nagle)
Subject: Low-level feature extraction and interframe matching
software wanted
Does software exist for following moving objects from frame to frame
in video images? I'm looking for something that works by finding low-level
features such as edges and corners and matches them from one frame to the
next. I'm aware of "optical flow" calculation, but the usual numeric
method for doing this is differentiation-oriented and too noise-sensitive
to be useful on real-world images, I am told by someone who has tried it.
So I'd like something that finds many low-level features and tries to
match them up.
The intended application is a vision system for a robot vehicle. But it
is possible that techniques used for colorizing B/W films would be useful
for this purpose. So I'd like to hear from people who know how colorizing
is done.
Software, algorithms, hardware, or indications of research activity
would be useful.
John Nagle
Center for Design Research, Stanford
------------------------------
Date: Tue 4 Aug 87 22:00:54-PDT
From: Ken Laws <Laws@SRI.Com>
Subject: Feature Tracking
John Nagle asked about image processing systems for tracking
scene features. Such systems do exist, but are often tied to
specific applications. A system for tracking missiles or stars
against a simple background will be quite different from one
for tracking vehicles in a street scene. Robotic applications
can be anywhere in between, depending on the robot's environment
and function. SRI currently has a robot vehicle that can navigate
hallways by detecting the door frames and other simple linear
features. We also have more elaborate systems for doing edge
matching or correlation matching in stereo pairs. I'm working
combined segmentation/classification/tracking. Others here are
doing matching in range imagery, including model-based matching
of the type useful in industrial inspection and bin picking.
Similar work has been done at Stanford, where Tom Binford would
be a good contact, and at CMU and most vision labs. The work
of Hans-Hellmut Nagel and of Moravec come to mind for the tracking
of low-level features, but there are many relevant papers in any
conference on computer vision or robotics.
-- Ken
------------------------------
Date: 31 Jul 87 07:06:54 GMT
From: ihnp4!lll-lcc!esl.ESL.COM!ssh@ucbvax.Berkeley.EDU (Sam)
Reply-to: ssh@esl.UUCP (Sam)
Subject: Re: NLP Front-Ends to INGRES
->vor!cris@esosun.UUCP (Cris Kobryn) sez ->
->I am interested in developing an NLP front-end to INGRES. Lest I
->reinvent: Is there any "stock" software which already does this?
->(INTELLECT does not *currently* accommodate INGRES; I've heard "DataTalker"
->mentioned as a possibility, but have no details--capabilities, company name,
->phone#, etc.)
->-- Cris Kobryn
Datatalker is from Natural Language, Incorporated. Their phone number
is 415-841-3500, and I believe their address is 1759 Fifth Street,
Berkeley. Founders are Jerrold Ginsparg and John Manferdelli.
Product is good, and accommodates Ingres. Tell 'em Sam sent you -- Sam
------------------------------
Date: Thu, 30 Jul 87 22:07:29 cdt
From: stevens@anl-mcs.ARPA (Rick L. Stevens)
Subject: Journal of Automated Reasoning
Because of the rapidly growing interest in the interconnected
fields of automated reasoning, automated theorem proving, logic
programming, and artificial intelligence, the following information
might be of particular interest.
The Journal of Automated Reasoning, which is very inexpensive
compared to most computer science journals, now includes in each issue
two interesting columns: The Problem Corner, which presents test
problems from the world of puzzles, from mathematics, and from various
applications; and Basic Research Problems, which presents open problems
for research in automated reasoning.
The journal is published quarterly, each issue containing
approximately 110 pages. Beginning next year, each issue will contain
approximately 20% more material. Subscription costs are lower for
individuals that are members of the Association of Automated Reasoning.
The Journal of Automated Reasoning published its first issue in
February, 1985. It is an interdisciplinary journal that maintains a
balance between theory and application. The spectrum of material
ranges from the presentation of a new inference rule with proofs of its
logical properties to a detailed description of a computer program
designed to solve some problem from industry. The papers published in
this journal are from, among others, the fields of automated theorem
proving, logic programming, expert systems, program synthesis and
validation, artificial intelligence, computational logic, robotics, and
various industrial applications. The papers share the common feature
of focusing on some aspect of automated reasoning.
The journal provides a forum and a means for exchanging
information for those interested in theory, in implementation, and
in specific industrial or commercial applications.
For subscription information write to
Kluwer Academic
PO Box 358, Accord Station
Hingham, MA 02018-0358
For outside the U.S. and Canada:
Kluwer Academic Publishers Distribution Center PO Box 322 3300 AH
Dordrecht The Netherlands
$97 for institutions, $39 for private non-members of AAR,
$29.50 for members of AAR
AAR, Association for Automated Reasoning
The Association for Automated Reasoning is an organization for
disseminating and exchanging information. It is international in form,
and publishes a newsletter acyclically to announce workshops, discuss
software advances, present problem sets, etc.
To Join send a $5 check to Larry Henschen 780 S. Warrington
Road Des Plaines, IL 60016
------------------------------
Date: Mon, 3 Aug 87 15:42:27 PDT
From: Amy Lansky <lansky@venice.ai.sri.com>
Subject: Seminar - Comparative Analysis (SRI)
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
Note: Change in day of week and location.
COMPARATIVE ANALYSIS
Dan Weld (WELD@XEROX.ARPA)
MIT and Xerox PARC
11:00 AM, WEDNESDAY, August 5
SRI International, Building E, Room EK242
Comparative analysis is the problem of predicting how a system will
react to perturbations in its parameters, and why. For example,
comparative analysis could be asked to explain why the period of an
oscillating spring/block system would increase if the mass of the
block were larger. This talk formalizes the problem of comparative
analysis and presents a technique, differential qualitative (DQ)
analysis, which solves the task.
DQ analysis uses inference rules to deduce qualitative information
about the relative change of system parameters. Multiple perspectives
are used to represent relative change values over intervals of time.
Differential analysis has been implemented, tested on a dozen
examples, and proven sound. Unfortunately, the technique is
incomplete; it always terminates, but does not always return an
answer.
------------------------------
Date: Thu, 30 Jul 87 10:39:47 PDT
From: Jutta McCormick <jutta@whitney.stanford.edu>
Subject: Seminar - Uncertainties in Robot Planning (SU)
Thursday, August 6, 2:30 p.m.
Robotics Lab Conference Room, Cedar Hall, A6.
DEALING WITH UNCERTAINTIES IN ROBOT PLANNING
USING PROGRAM PROVING TECHNIQUES
Dr. Jocelyne Pertin-Troccaz
LIFIA Laboratory - INPG
46, Avenue Felix Viallet
38031. Grenoble Cedex - France
(uucp: lifia!jocelyne@seismo.css.gov)
Abstract: A global approach for dealing with uncertainties using
program proving in Robotics is presented. We consider a manipulation
program automatically generated by a planner according to spatial and
geometric criteria and ignoring uncertainties. Such a program is
correct only if, at each step, uncertainties are smaller than the
tolerances imposed by the assembly task. We propose an approach which
consists in verifying the correctness of the program with respect to
uncertainties in position and possibly modifying it by adding
operations in order to reduce uncertainties. These two steps based on
a forward and a backward propagation borrowed from formal program
proving techniques are described in a general framework suitable for
robotics environments. Forward propagation consists in computing
successive states of the robot world from the initial state and in
checking for the satisfaction of constraints. If a constraint is not
satisfied, backward propagation infers new constraints on previous
states. These new constraints are used for patching the program. The
approach is described in technical details in the case of a simple
manipulation language and of a relational model of the world including
a representation of uncertainties.
Thanks.
-Jutta
------------------------------
Date: Fri, 31 Jul 87 11:58:02 +0300
From: Moshe Vardi <MAVARDI%WEIZMANN.BITNET@wiscvm.wisc.edu>
Subject: Conference - Logic in Computer Science
CALL FOR PAPERS
THIRD ANNUAL SYMPOSIUM ON
LOGIC IN COMPUTER SCIENCE
5-8 July 1988
University of Edinburgh, Edinburgh, Scotland
Concepts and methods from Logic are influential throughout Computer
Science. The Annual IEEE Symposium on Logic in Computer Science (LICS)
aims to attract broad participation of Computer Scientists, whose design
or research activities involve Logic, and Logicians interested in Computer
Science. Suggested (but not exclusive) topics of interest include:
abstract data types, computer theorem proving, concurrency, data base
theory, knowledge representation, finite model theory, lambda and
combinatory calculi, logic programming, modal and temporal logics,
program logic and semantics, software specification, types and categories,
constructive mathematics, verification.
PROGRAM COMMITTEE: M. Dezani, Y. Gurevich (chair), J. Halpern, C.A.R.
Hoare, G. Huet, P. Kanellakis, J.-L.Lassez, J. Mitchell, R. Platek,
G. Plotkin, S. Rosenschein, P. Sistla, J. Tiuryn, M. Wand
PAPER SUBMISSION: Send 14 copies of an extended abstract to the
program chairman:
Yuri Gurevich - LICS (313) 971-2652
Electrical Engineering and Yuri_Gurevich@um.cc.umich.edu
Computer Science Department
University of Michigan
Ann Arbor, Michigan 48109-2122
The package must be airmail postmarked by 27 NOVEMBER 1987 or received by
4 DECEMBER 1987. The abstract should be clearly written and provide
sufficient detail to allow the program committee to assess the merits of
the paper. References and comparisons with related work should be
included where appropriate. The entire extended abstract should not
exceed 10 double-spaced pages in 10 or 12-point font. Late abstracts or
those departing significantly from these guidelines run a high risk of
not being considered. If a copier is not available to the author, a
single copy of the abstract will do.
The authors will be notified of acceptance or rejection by 27 JANUARY
1988. Accepted papers, typed on special forms for inclusion in the
symposium proceedings, will be due 14 MARCH 1988.
The symposium is sponsored by the IEEE Computer Society, Technical
Committee on Mathematical Foundations of Computing , and the University
of Edinburgh, in cooperation with ACM SIGACT, ASL, and EATCS.
ORGANIZING COMMITTEE: J. Barwise, W. Bledsoe, A. Chandra (chair),
E. Dijkstra, E. Engeler, J. Goguen, D. Gries, D. Kozen, Z. Manna,
A. Meyer, R. Parikh, G. Plotkin, D. Scott
GENERAL CHAIRMAN: LOCAL ARRANGEMENTS:
Ashok K. Chandra George Cleland
IBM T. J. Watson Research Center Department of Computer Science
P.O. Box 218 The King's Buildings
Yorktown Heights, NY 10598 University of Edinburgh
(914) 945-1752 Edinburgh EH9 3JZ, SCOTLAND
ashok@ibm.com 011 44 31 667 1081 ext. 2775
glc%lfcs.edinburgh.ac.uk@ucl-cs.arpa
------------------------------
End of AIList Digest
********************
