Copy Link
Add to Bookmark
Report

AIList Digest Volume 5 Issue 198

eZine's profile picture
Published in 
AIList Digest
 · 15 Nov 2023

AIList Digest            Friday, 14 Aug 1987      Volume 5 : Issue 198 

Today's Topics:
Literature - TRLIST Technical Reports,
Seminars - Object-Based Knowledge Representation Systems (Lockheed) &
Evidential Reasoning: Overview and Implementation (SRI),
Conferences - Symposium on Logic Programming &
ACL 1988 Annual Conference CALL FOR PAPERS

----------------------------------------------------------------------

Date: Tue, 16 Jun 1987 17:14 CST
From: Leff (Southern Methodist University)
<E1AR0002%SMUVM1.BITNET@wiscvm.wisc.edu>
Subject: TRLIST Technical Reports

[The following is a reminder by Lawrence Leff of the technical
report abstracts that he keep available. -- KIL]


List of Tech Report Files and their contents

award1.x Fiscal Year 1986 Research Projects Funded by Knowledge and
Database Systems Program, IST 8504726 to IST8607303
award2.x Fiscal Year 1986 Research Projects Funded by Knowledge and
Database Systems Program, IST 8644864 to IST8600412
award3.x Fiscal Year 1986 Research Projects Funded by Knowledge and
Database Systems Program, IST 8603407 to IST-8607849
award4.x Fiscal Year 1986 Research Projects Fundeded by Robotics
and Machine Intelligence Program (No Abstracts)
canai1 Canadian AI Tech Report listing part 1 (Courtesy Graeme Hirst)
canai2 Canadian AI Tech Report listing part 2 (Courtesy Graeme Hirst)
cmu-robotics Robotics Institute of Carnegie Mellon University
CMU-RI-TR-85-10 to CMU-RI-TR-85-22
cmu-robotics2 Robotics Institute of Carnegie Mellon University
CMU-RI-TR-84-1 to CMU-RI-TR-85-10
issco Reports from ISSCO, Switzerland (mostly natural language)
japan reports from ICOT, Japan (reprinted from AIList)
mitai MIT AI memos 200 - 334
mitai1 MIT AI memos 335 - 452
mitai2 MIT AI memos 452 - 567
mitai3 MIT AI memos 568 - 641
mitai4 MIT AI memos 642 - 697
mitai6 MIT AI memos 698 - 751
mitai7 MIT AI memos 806 - 868 technical report 219 - 232
mitai8 MIT AI technical report 233 - 860 List of Books and Manuals
mitai9 MIT AI technical report 789 - 860 List of Boioks and Manuals
mitai10 MIT AI memo 752 - 805
robotics3 Robotics Institute of Carnegie Mellon University
CMU-RI-TR-86-1 to CMU-RI-TR-86-8 + (theses and dissertations)
robotics4 Robotics Institute of Carnegie Mellon University
CMU-Ri-TR-86-9 to CMU-RI-TR-86-14
SRI AI materials, sent by Dr. Laws, order from D. Arceo, AI Center,
SRI International, 333 Ravenswood Ave, Menlo Park, CA 94025
st2.x SRI #1 Technical Note 73 to 120
st3.x SRI #13 Technical Note 337 to 354
st4.x SRI #9 Technical Note 280 to 292
st5.x SRI #4 Technical Note 173 to 200
st6.x SRI #12 Technical Note 332 to 336
st7.x SRI #2 Technical Note 121 to 145
st8.x SRI #11 Technical Note 309 to 321
st9.x SRI #6 Technical Note 226 to 245
st10.x SRI #3 Technical Note 151 to 171
st11.x SRI #5 Technical Note 203 to 225
st12.x SRI #7 Technical Note 246 to 263
st13.x SRI #8 Technical Note 264 to 278
st14.x SRI #15 Technical Note 374 to 388
st15.x SRI #14 Technical Note 355 to 373
st16.x SRI #10 Technical Note 293 to 301

ucbcog University of California at Berkeley Cognitive Science
Program
ut-ai Artificial Intelligence Laboratory, University of Texas
at Austin
ut-ai1 Second List from University of Texas at AUSTIN AI lab

+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_+_



TRLIST is for redistribution of lists of technical reports from Universities
and R&D labs. All tech report lists to be redistributed should include
information on ordering the technical reports themselves. We prefer bib
or refer format but we would rather get a weird format than no list at all.

Administrative matters go to E1AR0002 @ SMUVM1 (bitnet),
trlist-request%smu@csnet-relay, or ihnp4!convex!smu!trlist-request.
Submitted tech report lists go to E1AR0002 @ SMUVM1 (bitnet),
trlist%smu@csnet-relay, or ihnp4!convex!smu!trlist. (Please send large
files to the first or third of these as we are charged by the byte for
mail received via CSNET.)

TRLIST goes out as the moderated group mod.techreports as well as being
mailed to a list of 84 addresses as of April 20, 1986, many of which
correspond to multiple people looking at an electronic bulletin board.

Bib and refer are UNIX products which allow for users to have references
automatically included in text and reformatted as needed for different
journal styles. In addition, they support a primitive information retrieval
function. Refer is produced by AT&T and should be part of most UNIX systems
or their writer's workbench if the system comes unbundled. Refer comes as
user contributed software under BSD 4.2. Contact Dr. Budd
at University of Arizona for more info on bib.

For those wishing to put material in bib or refer format but who do not have
the software, here is an example of the way the text should look. The
abstract and dollar field are optional. Note that each field
begins with a percent followed by a one letter key followed by a space.
Any line not beginning with a percent sign is a continuation of the previous
line. One blank line separates each reference form the next.

We publish materials that are not CS. The majority of materials coming are
CS related and in the event that there is substantial non-CS tech reports
being published, I will split the list as needed.

__________________________________________________________________________


%R CS-84-124
%T SOME CONSIDERATIONS ON INTERCONNECTIONS OF COMPUTER NETWORKS
%A Govind P. Gupta
%A Arjun Gupta
%I Washington State University, Computer Science Department
%X This technical report is a review of the considerations on Interconnection
of Computer Networks. Fundamental concepts of Network architecture,
implementation levels, routing and addressing are also reviewed.
%$ $2.60

%R CS-84-125
%T MOVEMENT COORDINATION FOR SINGLE--TRACK ROBOT SYSTEMS
%I Washington State University, Computer Science Department
%A Michael A. Langston
%A Chul E. Kim
%X We consider problems associated with the coordination of movement within a
multiple robot system in which all motion is restricted to a single track.
Our objective is to minimize the reconfiguration time, that is, the total time
required to move a collection of robots from an initial to a goal
configuration. We show that various models give rise to a wide range of
problem complexities. For these problems we design and analyze optimization
and approximation strategies.
%$ $2.50

------------------------------

Date: Tue, 4 Aug 87 07:35:30 PDT
From: wiley!joe@lll-lcc.ARPA (Joseph Sullivan)
Subject: Seminar - Object-Based Knowledge Representation Systems
(Lockheed)

[Forwarded from the Stanford bboard.]


INTERDEPARTMENTAL COMMUNICATION

TO: DISTRIBUTION
FROM: JOSEPH W. SULLIVAN O/90-06 B/259 354-5213
DATE: 1 August 1987
SUBJECT: AIC COLLOQUIUM


The Lockheed AI Center is pleased to announce a presentation by
Dr. Peter F. Patel-Schneider of the Schlumberger Palo Alto
Research. An abstract of the presentation is provided below.


Weak, Object-Based Knowledge Representation Systems
Dr. Peter F. Patel-Schneider


Recent work in semantics for terminological logics -- logics
about the relationship between classes -- has demonstrated that
the tradeoff between expressive power and computational
tractability in such logics can be circumvented. This indicates
that tractable object-based knowledge representation systems can
be built, albeit at the cost of weakening deduction. These
systems, because of their tractability, could be used in large
knowledge-based systems. Their representational semantics would
provide a cleaner foundation for object-oriented knowledge-based
systems than do object-oriented programming systems, the systems
currently used to build object-oriented knowledge-based systems.
This cleaner foundation means that fewer complications would
arise in the building and analysis of knowledge-based systems,
thus making these difficult tasks easier.

DATE: 19 August 1987
TIME: 3:30
PLACE: Lockheed Artificial Intelligence Center
Main Conference Room
2710 Sand Hill Rd. (Lockheed Bld. #259)
Menlo Park

------------------------------

Date: Thu, 13 Aug 87 10:20:45 PDT
From: lunt@csl.sri.com (Teresa Lunt)
Subject: Seminar - Evidential Reasoning: Overview and Implementation
(SRI)


SRI COMPUTER SCIENCE LAB SEMINAR SERIES ANNOUNCES:



EVIDENTIAL REASONING: OVERVIEW AND IMPLEMENTATION


TOM GARVEY

AI CENTER, SRI INTERNATIONAL

Monday, August 17 at 4:00 pm
SRI International, Computer Science Laboratory, BN182


Evidential reasoning consists of theoretical and practical methods for
reasoning from evidence, the uncertain, imprecise, and sometimes
incorrect information that is typically provided by "real-world"
information sources. This theory evolved in response to the apparent
representational and computational inadequacies of classical probability
methods when dealing with such information in an expert system
framework. Evidential reasoning is (currently) theoretically grounded
in the Shafer-Dempster theory of evidence. Using this theory, we have
developed procedures for fusing multiple, distinct bodies of evidence,
for projecting evidential statements in time, for translating statements
in one vocabulary into a different one, for interpreting selected
propositions based on a given body evidence, and for summarizing and
"gisting" a body of evidence. This seminar will be in the nature of a
high-level tutorial describing the Shafer-Dempster theory and Gister,
our current implementation of evidential reasoning.

------------------------------

Date: Thu 13 Aug 87 17:16:37-CDT
From: "Roger Nasr (MCC-AI)" <AI.NASR@MCC.COM>
Reply-to: Nasr@MCC
Subject: Conference - Symposium on Logic Programming - 1987

This is a last minute call to fill the remaining commercial exhibit booths
at the Fourth IEEE Symposium on Logic Programming to be held August 31st
through September 4th at the Hyatt Union Square, San Francisco, California.

The Symposium is the main gathering event in the United States for the
worldwide Logic Programming community. The program includes 49 research
papers presented by leading researchers from around the world and covering
a wide range of topics in the area. Included in those topics are:
Databases, Language Issues, Applications, Program Development Environments,
and Parallelism in Logic Programming.

Parties interested in getting more information about the commercial
exhibits part of this symposium are urged to contact Roger Nasr on the
network at 'nasr@mcc.com', or by phone at (512)-338-3424.

------------------------------

Date: Tue, 11 Aug 87 23:17:22 edt
From: walker@flash.bellcore.com (Don Walker)
Subject: Conference - ACL 1988 Annual Conference CALL FOR PAPERS

CALL FOR PAPERS

26th Annual Meeting
of the
Association for Computational Linguistics

7-10 June 1988
State University of New York at Buffalo
Buffalo, New York

TOPICS OF INTEREST: Papers are invited on substantial, original, and
unpublished research on all aspects of computational linguistics,
including, but not limited to, pragmatics, discourse, semantics,
syntax, and the lexicon; phonetics, phonology, and morphology;
interpreting and generating spoken and written language; linguistic,
mathematical, and psychological models of language; machine translation
and translation aids; natural language interfaces; message
understanding systems; and theoretical and applications papers of every
kind.

REQUIREMENTS: Papers should describe unique work that has not been
submitted elsewhere; they should emphasize completed work rather than
intended work; and they should indicate clearly the state of completion
of the reported results.

FORMAT FOR SUBMISSION: Authors should submit twelve copies of an
extended abstract not to exceed eight double-spaced pages (exclusive of
references) in a font no smaller than 10 point (elite). The title page
should include the title, the name(s) of the author(s), complete
addresses, a short (5 line) summary, and a specification of the topic
area. Submissions that do not conform to this format will not be
reviewed. Send to:

Jerry R. Hobbs
ACL88 Program Chair
Artificial Intelligence Center
SRI International
333 Ravenswood Avenue
Menlo Park, CA 94025, USA
415:859-2229; hobbs@warbucks.ai.sri.com

SCHEDULE: Papers are due by 4 January 1988. Authors will be notified
of acceptance by 8 February. Camera-ready copies of final papers
prepared in a double-column format, either on model paper or in a
reduced font size using laserprinter output, must be received by 4
April along with a signed copyright release statement.

OTHER ACTIVITIES: The meeting will include a program of tutorials
organized by Ralph Grishman, Computer Science Department, New York
University, 251 Mercer Street, New York, NY 10012, USA; 212:460-7492;
grishman@nyu.arpa. Anyone wishing to arrange an exhibit or present a
demonstration should send a brief description together with a
specification of physical requirements (space, power, telephone
connections, tables, etc.) to Lynda Spahr, Department of Computer
Science, SUNY Buffalo, Buffalo, NY 14260, USA; 716:636-2464 or 3181;
spahr@gort.cs.buffalo.edu, spahr@buffalo.csnet, spahr@sunybcs.bitnet,
or {ames,boulder,decvax,rutgers}!sunybcs!spahr.

CONFERENCE INFORMATION: Local arrangements are being handled by
William J. Rapaport (ACL), Department of Computer Science, SUNY Buffalo,
Buffalo, NY 14260, USA; 716:636-3193, 3180; rapaport@gort.cs.buffalo.edu,
rapaport@buffalo.csnet, rapaport@sunybcs.bitnet, or
{ames,boulder,decvax,rutgers}!sunybcs!spahr. For other information on
the conference and on the ACL more generally, contact Don Walker (ACL),
Bell Communications Research, 445 South Street, MRE 2A379, Morristown,
NJ 07960, USA; 201:829-4312; walker@flash.bellcore.com or
{ucbvax,decvax,allegra}!bellcore!walker.

PROGRAM COMMITTEE: Jared Bernstein, Roy Byrd, Sandra Carberry, Eugene
Charniak, Raymonde Guindon, Lynette Hirschman, Jerry Hobbs, Karen
Jensen, Lauri Karttunen, William Rounds, Ralph Weischedel, and Robert
Wilensky.

------------------------------

End of AIList Digest
********************

← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT