%T World Watch
%J Datamation
%V 32
%N 4
%D February 15, 1986
%P 60
%P 19
%K GA01 India Institute for New Generation Technology
%X "India hopes to curry favor with Japan's Institute for New Generation
Computer Technology.  So, a few of India's premier fifth-generation
researchers may soon be packing their bags for a trip to India."

%A John R. Dixon
%T Will Mechanical Engineers Survive Artificial Intelligence
%J Mechanical Engineering
%V 108
%N 2
%D February 1986
%P 8+
%K AA05 AT14
%X Raj Reddy stated 'In the twenty-first century, much of what mechanical
engineers now do will be done by machines'  The rest of the editorial,
discusses whether this is a reality.

%A Howard K. Dicken
%T Turning Micros Into Mavens
%J High Technology
%V 6
%N 3
%D March 1986
%P 71
%K AI01 H01 Expertelligence Macintosh AT16 Migent Software Intellicorp
Enrich Transform Logic AA15
%X Expertelligence, which sells expert-system shells, Lisp and Prolog
for the Macintosh had fiscal 1985 revenue of $834,000.
Losses were $411,000.  Intellicorp had 1985 sales of $8.7 million
dollars with a loss of $724,000.  Migent Software
has purchased an expert system for interfaces to user software from
Transform Logic.  The software is called Enrich and sells for $595.00

%A Stanley Aronoff
%A Glyn F. Jones
%T From Data to Image to Action
%J IEEE Spectrum
%V 22
%N 12
%D December 1985
%P 45-52
%K AI06 Mult-Spectral Scanner Landsat AA03 forestry crop yields Cropcast AI01
%X discusses various aspects of the hardware for image processing.
Crop forecasting now achieve 97% accuracy with 95% accuracy three months
prior to harvest.  They state that expert systems will combined with image
processing to create a new generation of information systems.

%T Adept, Kawasaki in Japan Accord
%J Electronic News
%V 32
%N 1588
%D February 10, 1986
%P 45
%K AI07 GA01 GA02 AT16  AI06
%X Adept has licensed Kawasaki Heavy industries to manufacture and sell
its robotics line in Japan.  Adept estimated it will receive one million
dollars in the next three years.  This also includes the AdeptVision systems.
Adept has shipped more than $500,000 worth of robotics equipment ot
Kawaski since last September

%T Notes: Software and Services
%J ComputerWorld
%V 20
%N 4
%D January 27, 1986
%P 33
%K LogicWare MProlog Revelations Control Data Corp Cyber H04 T02 AT16
%X Logicware and Revelations Research have joined efforts to put a
version of MProlog on the Control Data Corp's Cyber 205

%A Eric Bender
%T DBMS tools: Not Natural Yet
%V 20
%N 3
%D January 20, 1986
%P 19+
%K Ashton-Tate H01 AA09 AI02 Clout Lotus Development Human Access Language
Brodie Associates
%X Interviews with various people about natural language and data base
management systems, particularly for micros.  Of note, David Hull
of Ashton Tate said that although they are evaluating natural language
systems, they have not seen any that deliver the benefits that they
think their clients want

%T New Products
%V 20
%N 3
%D January 20, 1986
%P 85
%K Experience in Software Idea Generator H01 AI01
%X Experience in Software, Inc. announced the Idea Generator a tool
to help the user solve problems.  It costs $195.00 and runs on the IBM PC.

%A Steven Burke
%T Arity/Prolog Tools Assist in Creating AI-Based Software
%J InfoWorld
%V 8
%N 3
%D January 20, 1986
%P 14
%K Unitek Technology Arity Dr. vance Giboney Arthur Young and Company
Peter Gabel Darryl Rubin Kim Frazier AI01 AA06 AA08 GA04 H01 T01 T02
%X Unitek Technologies is using Arity's tools to enhance accounting
sofware.  Knowledgeware is using it to automate writing computer
code which is being developed in conjunction with Arthur Young
and Company.

%A Alice LaPlante
%T Talking with your Computer
%J InfoWorld
%V 8
%N 2
%D January 13, 1986
%P 25-26
%K Digital Equipment Corporation DECtalk AI05 AI01
%X general discussion of applications of uses of voice input and output
systems.  DEC says that 90 percent of its customer's use DECTALK for
telephone applications; it expects that its next generation system
will have voice recognition and voice synthesis as part of an expert system.

%A Keith Thompson
%T Q&A is Fun, Useful Business System
%J InfoWorld
%V 8
%N 2
%D January 13, 1986
%K AI02 AA15 AA09 H01 AT17
%X review of Q and A, which is a database and word processor claiming
to be based on artificial intelligence.  It has a natural language interface
to the data base.  It uses AI to tell where the address is in a letter
automatically to print out the envelope.  It received a rating of 9.0
out of 10 with very good in performance and excellent in documentation,
ease of learning, ease of use, error handling, support and value.

%A Barbara Robertson
%T The AI Typist: Writing Aid is Fast and Easy, But Bug Plagued
%J InfoWorld
%V 8
%N 2
%D January 13, 1986
%P 35
%K AT17 AT03 H01 AA15
%X AI Typist is a word processing system for IBM PC's that "uses
artificial intelligence to provide a real-time typist."  The program
scans a dictionary looking for character-by-character matches while typing.
It highlights characters at the point it finds a mismatch.  For example,
if a user types appearing, highlighting appears as one types the second
a since ape matches a word in the dictionary.  It doesn't correct the
spelling nor allow the user to look at the dictionary.  It also had
bugs in the basic word processing capability.  It received a 2.4 out
of 10 with unacceptable ratings under performance and value, poor
in documentation, satisfactory in error handling and very good under
ease of learning, ease of use and support.

%T TI Introduces PC Scheme Lisp Device
%J InfoWorld
%V 8
%N 2
%D January 13, 1986
%P 51
%K T01 H01 AT02
%X TI has introduced PC Scheme for $95.00 which runs on IBM PC's and
TI Instruments PC's.  It has a compiler.

%T Advertisement
%J Unix/World
%V 11
%N 11
%D December 1985
%P 56
%K Silogic Knowledge WorkBench AT01 AI01 AI02 AA09 T03

%T For the Record
%J Unix/World
%V 11
%N 11
%D December 1985
%P 10
%K Flexible Computer NASA Johnson Space Center Unix
%X "NASA's Johnson Space Center, Dallas, has purchased a massively
parallel Flex/32 Computer from Flexible Computer Corp. for its
Artificial Intelligence section, which is responsible for evaluating
fifth generation computing systems for AI development and applications."

%T Review of Introduction to Robotics by Arthur J. Critchlow
%J BYTE
%V 11
%N 1
%D January 1986
%P 57-60
%K AI07 AT07

%T Software Notes
%J ComputerWorld
%V 20
%N 2
%D January 13, 1986
%P 25+
%K Inference Corp NASA Symbolics AT16 AI01 AA08
%X "Inference Corp. and the National Aeronautics and Space Administration have
agreed to develop jointly a software development workstation design Inference's
expert system technology."  It will use Symbolics 3600 and assist both in reuse
of code and generation of new code.

%A Edward Warner
%T Gold Hill, Intel Developing LISP for Multimicroprocessors
%J ComputerWorld
%V 20
%N 2
%D January 13, 1986
%P 26
%K T01 H03
%X Intel announced an Agreement with Gold Hill to develop and market jointly
a Common Lisp Computer Intel's HyperCube IPSC.

%T Executive Report/Expert Systems
%J ComputerWorld
%V 20
%N 2
%D January 13, 1986
%P 43-62
%K T01 T02 T03 H02 AI01 AA04 AA08 AA21 AT08 O02 Sterling Wentworth PlanMan
Fountain Hills Software semiconductor Travellers Insurance Teknowledge
%X Half of all Fortune 500 companies actively pursue expert system
development.  Fountain Hills Software sells Fair Cost, a cost
modelling program for semiconductor components Sterling Wentworth
Corpo offers Planman, a financial panning expert system targetted at
tax advisors.  Ion Technology Services, markets Diagnostic
Troubleshooter an expert system for the maintenance of specialized
semiconductor equipment The expert system market is worth 75 million
with government and research efforts account for as much as two thirds
of this.  Fortune 500 companies efforts make up most of the rest of
the market.  Custom Development Life Span for Expert Systems compiled
by Arthur D. Little in developing 30 "large-scale strategic
knowledge-based systems, typically for Fortune 500 companies:"
.TS
tab(~);
c c c c
l l l l.
Phase~Duration~Level of Effort~Cost
Proof of Concept:~4 to 6 months~1 to 2 man years~$150,000 to $400,000
Demonstration~4 to 6 months~1 to 2 man years~$150,000 to $400,000
Prototype~12 to 18 months~8 to 12 man years~$1.2 to 2.4 million
Total Resource Comm~20 to 30 months~10 to 16 man years~$1.5 to 3.2 milion
.TE
Travelers Insurance developed a successful expert system to help diagnose
failures on IBM 8100 controllers.  It had 70 rule programs and was done with
Teknowledge's M-1 system.

%T SuperShorts
%J ComputerWorld
%V 20
%N 2
%D January 13, 1986
%P 108
%K AI01 AA20 T03 H02 AT16
%X Lisp Machine, Inc. and the Process Management Divison of Honeywell announced
that they will work to bring artificial intelligence to the process control
market.  As part of that effort, they will work together to interface
PICON with the Honeywell control system TDC3000.
[In Applied Artificial Intelligence, it was reported that this interfacing
was already accomplished and is running at one site.  LEFF]

%T GM Delco to Fund Cognex Vision Systems
%J Electronic News
%V 32
%N 1583
%D January 6, 1986
%P 58
%K AI06 AA04 AT16
%X Delco Electronics has agreed to give COGNEX $500,000 to develop
an engineering prototype of a machine vision system for automatically
inspecting the placement of surface-mounted devices on printed
circuit boards.  Cognex's Checkpoint 1100 system was reported
to have achieved measurements accurate to within 2 mils within 99.8
percent of the test cases.

%A James Fallon
%T Racal Electronics, Norsk Data to End 2-Year AI Joint Venture
%J Electronic News
%V 32
%N 1584
%D January 13, 1986
%P 29
%K AT16 GA03
%X A 1.44 million joint investment to develop an artificial
system was terminated since the project was delayed and the market
for that particular product no longer existed.

%T Plessey to Develop Speech-Input CPU
%J Electronic News
%V 31
%N 1582
%D December 30, 1985
%P 8
%K Alvey Edinburgh University Imperial College University of Loughborough
AI05 GA03 H03
%X The Alvey Directorate has selected Plessey as a prime
contractor in a 19.88 million dollar project to develop
a system that receives human speech and displays the words on the screen.
No vocabulary size or response time was given for the proposed system.
It will use parallel processing

%A Peggy Watt
%T Scanner Puts Text On-Line
%J ComputerWorld
%V 19
%N 52
%D Dec 30, 1985/January 6, 1986
%P 1+
%K Dest Corporation AI06 AT02
%X DEST Company announced PCSCAN which is a system that recognizes
the type faces in most business documents.  It costs $3000.00.
The optical reader equipment supports 300 dpi printers.
The optical reader alone is $1995.00.  The software inserts
appropriate formatting codes for such things as tabs, paragraphs
and page breaks.

%A J. Mostow
%T Forword: What is AI? And What Does It Have to Do with Software Engineering?
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1253-1256
$K AA08

%A R. Balzert
%T A Fifteen Year Perspective on Automatic Programming
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1257-1267
%K AI08 SAFE AA08 Insformation Sciences Institute GIST RSL TRW
symbolic evaluation software maintenance POPART PADDLE
%X SAFE was a system that took up to a dozen informal sentences
that specified a piece of software and produced a formal specification.
GIST is a formal specification language that
attempted to minimize the translation from the way people think
about processes to the way they write about them.
They developed a prototype of a system to convert GIST to
natural language and they have a joint effort underway
with TRW to design a system to convert RSL specifications to
natural language.  They also developed a system to
symbolically evaluate GIST specifications.  They also have a natural
language behavior explainer.

%T New Products/Microcomputers
%J ComputerWorld
%V 20
%N 8
%D February 24, 1986
%P 89
%K T01 H02 Practical Artificial Intelligence VAX DS-32 AP-10
%X Practical Artificial Intelligience has announced the DS-32 and AP/10
which are attached processors for the IBM personal computer and Digital
Equipment VAX designed to support artificial intelligence.
The DS-32 costs $2700 and the AP/10 costs $6000

%T Ben Rosen's Ansa: Will it Ever be Another Lotus?
%J Business Week
%V 2935
%D March 3, 1986
%P 92-95
%K Paradox SRI AA09 H01
%X discusses the founding and prospects for Paradox, a data base system
with artificial intelligence features

%A Mary Petrosky
%T Expert Software Aids Large Systems Design
%J Infoworld
%V 8
%N 7
%P 1+
%K AI01 AA08 H01    AT02 AT03
%X Knowledge-Ware announced Information Engineering Workstation that
provides tools for data flow diagrams and action diagrams.  It runs
on IBM PC/AT's and cost $7500.00.  I could not find an explanation of
where AI was used, in spite of the title of the article.

%T Expert System Moves Into Military Cockpit
%J Electronics
%V 58
%N 51
%D December 23, 1985
%P 15
%K AA18 Air Force Wright Aeronautical Laboratory Threat Expert Analysis System
AI01
%X The Air Force's Wright Aeronautical Laboratory, Wright-Patterson Air Force
Base had set a deadline of January 10 for the Threat Expert Analysis System,
a system that would warn pilots of enemy threats and recommend
possible responses.

%T Device Mixes Images from Eight Cameras
%J Electronics
%V 58
%N 51
%D December 23, 1985
%P 76
%K Pattern Processing Technologies Framesplitter AI06
%X Framesplitter is a system that combines the input from several
solid state video cameras into a single composite image.  This system
allows a system to gain a 360 degree view while only processing one image.

%A Clifford Barney
%T Language Boils Down to Boolean Expressions
%J Electronics
%V 58
%N 51
%D December 23, 1985
%P 25-26
%K G. Spencer-Brown Wittgenstein Bertrand Russel Laws of Form
Advanced Decision Systems Air Force pictorial logic canonical forms Losp
Symbolics AI10 AI14 AA18 H02 T01 T02
%X Losp is a system based on the "Laws of Form" which was developed
by G. Spencer-Brown a British Mathematician who studied with
Bertrand Wittgenstein.  The system was developed by Advanced Decision Systems
and will be put to use in an Air Force project on pictorial logic.
The language is being microcoded to run on a Symbolics work station.
Lisp and Prolog will be translated to LOSP

%A Clifford Barney
%T Expert Systems Makes it Easy to Fix Instruments
%J Electronics
%V 58
%N 51
%D December 23, 1985
%P 26
%K AI01 AA04 AA21 Ada Lockheed Missiles and Space Lockheed Expert
System
%X Lockheed Missiles and Space has developed a generic expert system
to assist in repairing and calibrating 55000 instruments.
This system has been used successfully on a Hewlett-Packard 6130C
digital voltage source.  The epxert system was written in ADA.  The
system is being applied to 20 different systems including signal-switching
and computer aided design.

%A Robert T. Gallagher
%T French Make Retools to Fight the Japanese
%J Electronics
%V 58
%N 51
%D December 23, 1985
%P 26-28
%K AA05 GA03 RTC La Radiotechnique Compelec cathode-ray tube AI07
%X RTC La Radiotechnique Compelec has converted a cathode-ray tube
to robotics.  Robots are being used to place the
luminescent materials on the tube screens, testing, and placement
in packing materials.  The areas requiring manual work are
fitting the shadow masks on to the CRT's frames and the final test
where tuning is done.

%A H. Berghel
%T Spelling Verification in Prolog
%J SIGPLAN Notices
%V 21
%N 1
%D January 1986
%P 19-27
%K T02
%X describes a system to check words against table and if mispelled to
suggest possible correct spellings.

%A D. Brand
%T On Typing in Prolog
%J SIGPLAN Notices
%V 21
%N 1
%D January 1986
%P 28-30
%K T02

%T Advertisement
%J BYTE
%V 11
%N 1
%D January 1986
%P 348
%K T01 T02 T03 H01 AT01
%X Price List on AI type products from The Programmers SHOP
800-421-8006 128B Rockland Street, Hanover MA 02339
.TS
tab(~);
l l l.
EXSYS~PCDOS~$359
INSIGHT 1~PCDOS~$95
INSIGHT 2~PCDOS~$449
APES~~$359
ADVISOR~~$949
ES Construction~~$100
ESP~~ $845
Expert CHOICE~~$449
GC LISP (Large Model)~~$649
Compiler and LM Interpreter~~$1045
TLC LISP~CPM-86~$235
~MSDOS
Waltz LISP~CPM~$149
~MSDOS
ExperLisp~~$439
IQ LISP~~$155
TRANSLISP-PC~~$75
BYSO~~$125
MuLISP-86~$199
ARITY PROLOG
~Compiler~$1950
~MSDOS~$495
MPROLOG~PCDOS~~$725
PROLOG-1~~$359
PROLOG-2~~$1849
MicroProlog~~$229
Prof. Micro Prolog3~~$359
.TE

%A Hugh Aldersey-Williams
%T Computer Eyes Turn to Food
%J High Technology
%V 6
%N 1
%D January 1986
%P 66-67
%K Vision Systems International Nello Zuech Roger Brook strawberry
citrus juice mixed vegetables AI06
%X At the University of Florida, Gainseville, they are working on a
vision system to pick citrus fruit when it is ripe.  Arthur D. Little
is working on a sytem that would determine whether the mixture in a package
of mixed vegetables contains the correct proportion of different ingredients.

%T International Robomation Gets Two Million in Orders
%J Electronic News
%V 32
%N 1591
%D March 3, 1986
%P 46
%K AI07 AA04 Chrysler AT&T Hewlett-Packard Zenith SMD printed-circuit
board solder paste
%X Orders included $750,000 from Chrysler for a surface mounted device
inspection system, $400,000 from HP, $270,000 for inspection of through-hole
components, $400,000 from AT&T and $305,000 from Zenith for high-through
put SMD inspection

%T Asahi to Market Lincoln Inspector
%J Electronic News
%V 32
%N 1591
%D March 3, 1986
%P 46
%K AA04 AI06 Lincoln Laser GA01 GA02
%X Asahi Optical Company has agreed to market Lincoln Laser Co's line
of automatic optical inspection systems in Japan.  Lincoln Laser plans
to manufacture the equipment in Japan.  First year sales are projected
to be 40 systems valued at approximately $16.7 million.

%A Peggy Watt
%T Expert System: Boeing AI Academy Schools In-House Talent
%J ComputerWorld
%V 20
%N 9
%D March 3, 1986
%P 1+
%K AI01 AT18  AA18 Janusz S. Kowalik connectors AA04 space station.
%X U. S. Department of Defense announced in 1981 that artificial intelligence
will be a requisite in defense contract bids in the late 1980's.  Boeing
Computer Services established an Artificial Intelligence Support
Center which graduates associates after a year of training including
developing a project of relevance to Boeing.  The system acommodates
20 people in two classes scheduled each year and receives inquiries from
40 people a year out of 106,000 total employees of Boeing.  They are
developing an expert system for process specs for connector assemblies.
It recommends actions in about 60% of the situations it encounters.  It
runs in Prolog on a DEC VAX.  They are developing an expert system
to monitor space-station cabin environment changes.  Also developed
are systems for airplane part design maintenance and diagnosis.
Another helps determine air resistance assists the aerodynamicist in defining
and evaluating parameters.

%T Top of the News
%J ComputerWorld
%V 20
%N 9
%D March 3, 1986
%P 1+
%K Kurzweill Applied Intelligence Voice Writer AI05
%X "Kurzweil Applied Intelligence, Inc.'s Voice Writer, a voice-recognition
word processing device that will handle discrete, noncontinuous speech
at up to 60 words per minute, is on track for a third-quarter introduction,
inventor Raymond Kurzweil disclosed last week."  It will support between
5000 and 10000 words and will cost under $20,000.

%T Borland Enters AI Arena with Turbo Prolog Development Tool
%J ComputerWorld
%V 20
%N 9
%D March 3, 1986
%P 14
%K Turbo-Prolog Borland International T02 H01
%X Turbo-Prolog costs $99.95.  It has an incremental compiler that
generates native code and linkable object modules compatible with the
IBM MS-DOS linker.  It includes a full screen editor,
pull-down menus, graphical and text-based windows.  It will be available
April 25.  The next version of Turbo Pascal will be able to exchange information
with Turbo Prolog.  The system runs at 100,000 LIPS.

%T New Products/Microcomputers
%J ComputerWorld
%V 20
%N 9
%D March 3, 1986
%K OPS-83 Production Systems Technologies T03 H01
%X Production Systems Technologies, Inc. has announced that OPS83 is
now available for use on the IBM PC.  It costs $1950.00

%T New Products/Systems and Peripherals
%J ComputerWorld
%V 20
%N 9
%D March 3, 1986
%K Maxvideo Minvideo Datacube Multibus Addgen-1 frame store DSP Systems
AI06
%X Datacube Inc. has introduced Minivideo, a real time image
processing subsystem, and has added three modules to its MaxVideo product
line.  Minvideo-10 and Minvideo 7 are 8-bit 512 by 512 and 384 by 512 boards
for Intel Multibus or IIbx based computers.
X
DSP system has announced a FRAME STORE that can store a snap shot
of 50 Mhz data.  It can store up to 32K 16 bit words

%A Gadi Kaplan
%T Industrial Electronics
%J IEEE Spectrum
%V 23
%N 1
%D January 1986
%P 61-64
%K Fujitsu General Electric process control Foxboro Farot-M6 AI06  AA05 AI07
counterweights
%X GE has developed a system that can weld using inert gas at 40 mm per second
or about twice the rate of any other system.  It uses a vision system.
General Electric has developed an expert system tool called GEN-X.
Foxboro announced controllers with 200 rules.  Japanese manufacturers last year
made 50,000 industrial robots valued at 1.2 billion.  Fujitsu expects to
sell $2.1 billion in Japanese industrial robots and $4 billion in 2000 years.
Japanese auto manufacturers buy 40 percent of the robots produced.  Farot
M6 robots made by Fujitsu have two arms which can be worked in coordination.
Fujitsu has eliminated the need for counterweights and can place components
with 30 micrometer accuracy at speeds up to 2 meters per second.

%A Mark A. Fischeti
%A Glenn Zorpette
%T Power and Energy
%J IEEE Spectrum
%V 23
%N 1
%D January 1986
%K AA04 AI01 Westinghouse Electric Corporation nuclear power Babcock and Wilson
EG&G Idaho reactor
%X "Westinghouse Electric Corporation of Pittsburgh, PA offers
the Genaid diagnostic software package to monitor changing conditions
in power plant generators, analyze them, and warn plant operators of
potential trouble."  EG&G Idaho of Idaho Falls has a Reactor Safety Assessment
system which "processes large amounts of data from a nuclear power
plant during an emergency, makes diagnoses, and outliens the consequences of
subsequent actions.  After final refinements, this expert system program
is to go on line this year at he Nuclear Regulatory Commison's
Operations Center in Washington Center.  The system was
developed for use with Babcock and Wilcox Pressurized-water reactors and
will be adapted for use with other reactors."  [In Spang-Robinson
report, they indicated that the Japanese are putting major amounts
of money into expert systems for nuclear reactor operations.  See my
summary for more info.  LEFF ]

%A Richard Brandt
%T Micromechanics: The Eyes and Ears of Tomorrow's Computers
%J BusinessWeek
%N 2937
%D March 17, 1986
%P 88-89
%K AI07 AI06 signature verification Novasensor Schlumberger
diabetes insulin Clini-Therm Corporation NEC Solartron Transducer
Hiroshi Tanigawa
%X Micromechanics, the making of mechanical sensors completely out of
semiconductors, is a $250,000,000 business.  Europe is increasing
its market share.  The most widely used devices are pressure sensors
with a silicon chip with a hole etched nearly through it leaving
a thin membrane.  Hitachi sells about a million of such sensors
per year which it sells at ten dollars a piece.  Millar
Instruments puts such sensors at the end of a blood pressure monitor to
take readings inside a blood vessel.  Researchers
at MIT are working on a system that will translate nerve impulses
into controls for prosthetics.  The MIT team anticipates the first
tests on humans with three years.  There are devices with a set of
diving boards for measuring accelerations.  IBM is using such a device
in a pen to detect the hand motions in writing a signature.  This
data is analyzed to determine if there is  a forger.
Texas Instruments is perfecting a silicon chip
with one million mirrors for use in optical computing.

%T AI to Dominate Optics Symposium
%J Electronics
%V 59
%N 9
%D March 3, 1986
%P 70
%K George Gilmore AI06 evidencing AA18
%X Discussion of the Society of Photooptical Instrumentation
Engineers Symposium on Optics symposium on Applications
of Artificial Intelligence III.

%A Alice LaPlante
%T Stock Market Finds AI Attractive Buy
%J InfoWorld
%V 8
%N 9
%D March 3, 1986
%K Teknowledge Harvey Newquist Intellicorp AT16
%X Discussions of public offerings
of Teknowledge's new public offering.

%A Ivars Peterson
%T Computing Art
%J Science News
%V 129
%N 9
%D March 1, 1986
%P 138-140
%K Richard Diebenkorn Frank Lloyd Wright Architecture grammar art
architecture Russell Kirsch Joan Marvin Minsky AA25
%X Using a grammar, scientists have developed
grammars for Frank Lloyd Wright's architecture and Richard Diebenkorn's
"Ocean Park" canvasses.  These have been used to develop works
that appeared to by the author.  Diebenkorn when shown the works said
"I looked and felt immediate recognition."

%A Scott Mace
%T Microrim Team To Study Data Management
%J Infoworld
%V 8
%N 10
%D March 10, 1986
%K AA09
%X Microrim is setting a R&D group to exploit what it calls
a 'potentially revolutionary' technology for making database
management easier.  [Microrim makes RBASE database products
for microcomputers and CLOUT, a natural language interface.]

%A Karen Sorensen
%T Scientific Application for Expert System in Works
%J Infoworld
%V 8
%N 10
%D March 10, 1986
%K gas chromatography Award Software AI01 AA02 Award Software C H01
%X Award Software is developing an expert system
for making identifications of chemical substances.  It is designed for
use with gas chromatography.  They are using C to develop the
software.

%T Infomarket
%J Infoworld
%V 8
%N 10
%D March 10, 1986
%K H01 T03 Intelligent Machine Co. Knowledge Oriented Language
Knowol Rock Mountain Medical Software HouseCall AI01 AA01
%X Intelligent Machine Co is advertising The Knowledge Oriented
Language for $39.95.  HouseCall is a home medical system
which can make over 400 diagnoses.  It costs $49.95 and runs
on IBM PC's and Apples

%A Daniel R. Pfau
%A Barry A. Zack
%T Understanding Expert System Shells
%J Computerworld Focus
%V 20
%N 7A
%D February 19, 1986
%P 23-24
%K T03

%A Girish Parikh
%T Restructuring Your Cobol Programs
%J Computerworld Focus
%V 20
%N 7A
%D February 19, 1986
%P 39-42
%K AI01 AA08 Cobol-SF

%A Elisabeth Horwitt
%T LISP Systems Tied to SNA
%J ComputerWorld
%V 20
%N 10
%D March 10, 1986
%P 1
%K Symbolics H02 AA06 CICS IBM
%X Symbolics introduced a product to allow their Symbolics 3600's
to communicates via SNA.   They also provide an interface
to use CICS to access VSAM files.  The hardware + software
costs $17,900 for the first Symbolics and $4900 for each additional
Symbolics or IBM.

%A Eric Bender
%T The Concerted Kurzweil Effort
%J ComputerWorld
%V 20
%N 10
%D March 10, 1986
%P 33+
%K Voice Writer AI05
%X describes demonstration of Kurzweill's add on for the IBM PC to
do speech recognition.    Kurzweill will be selling a Voice
Writer which will handle 5000 words and allow eight users.  It uses
parallel processing to accept dictation at 60 words per minute.

%T New Products/Microcomputers
%J ComputerWorld
%V 20
%N 10
%D March 10, 1986
%P 81
%K AA08 H01
%X P-Cube Corb has annoucned Mansys/IRM a "knowledge-based"
system to help assess the quality of the procedures and processes
within an information systems department.  It costs $1800 and runs
on IBM PC's.

%T Spin-Offs
%J IEEE Spectrum
%V 23
%N 3
%D March 1986
%P 17
%K Color Systems Technology colorization AA25
%X describes the system used to color old movies.

%A Ernest W. Kent
%A Michael O. Shneier
%T Eyes for Automatons
%J IEEE Spectrum
%V 23
%N 3
%D March 1986
%P 37
%K Honeywell Navy AI06 AI07 cleaning agriculture printed circuit-board
propeller CAD/CAM  Control Automation Interscan Odetics range images
Environmental REsearch Institute AA18 AA19 Automatix Advanced Vision
Systems ITMI Marketing Corp Analog Devices Automation Intelligence
%X At Honeywell, they are using a vision system to identify missing
leads in printed-circuit boards.  It uses four videocamera's 90 degrees
apart to capture light reflections.  There are 200 companies offering
a product or service related to machine-vision.  50 of these
offer complete systems.  At a Navy ship-building system, a video
system inspects propellors and compares the results against the
CAD/CAM database to see if it was made possible.  Autonomous
mobile robots are under commercial development for
materials transport, commercial cleaning, and construction.
Total sales for machine vision systems have double in each of the last
two years.

%A Mark A. Fischetti
%T A Review of Progress at MCC
%J IEEE Spectrum
%V 23
%N 3
%D March 1986
%P 76-82
%K AA04 VLSI-CAD reconvergent fanout problem H02 LDL AI10 T02 AA09
%X In the VLSI-CAD, area, they are using 81 LISP machines.
They developed a module editor which lays out circuitry
graphically.  They have developed an algorithm for solving
the reconvergent fanout problem.
Discusses the knowledge-base that is supposed to contain
"common-sense"  They have developed a test application that will
help IC chip designers.  The database group is developing
a system to compile large logic systems on disks

%A Glenn Zorpette
%T Robots for Fun and Profit
%J IEEE Spectrum
%V 23
%N 3
%D March 1986
%P 71-75
%K AA25 AI07 Survival Research Labs
%X discusses various robots that are part of art shows or used
for entertainment.  Survival Research Labs puts on
demonstrations where large mobile robots destroy props, animal
carcasses or one another.

%T Gould Acquires Vision Systems Unit
%J Electronic News
%V 32
%N 1592
%D March 10, 1986
%P 14
%K Gould Automated Intelligence Opti-Vision AI06 AT16
%X Gould has acquired the VisionSystems division of
Automated Intelligence.  This division makes the Opti-Vision system.

%A Richard L. Wexelblat
%T Editorial
%J SIGPLAN Notices
%V 21
%N 3
%D March 1986
%P 1
%K AI03 AA17 Queens Problem H03 ADA
%X SIGPLAN is having a contest to determine the
best solution for the N<=8 Queens problem using
concurrency in ADA in a substantive manner.
Deadline for submissions is June, 1986.

%A Scott Mace
%T Ansa Upgrades Paradox, Drops Copy Protection
%J InfoWorld
%V 8
%N 11
%D March 17, 1986
%P 3
%K Paradox AA09 H01
%X Ansa software announced upgrades to its system and has dropped
copy protection

%T Resources
%J InfoWorld
%V 8
%N 11
%D March 17, 1986
%P 17
%K AI01 H01 Cahners Publishing Company Users Group Expert Systems Strategies
%X The New York IBM PC Users Group has announced a special interest
group for Expert Systems.  The meetings are held March 25.  For more info
contact NYPC, Suite 614, 30 Wall Street, 10005 (212) 533 NYPC.  Cahners
Publishing Company produces a newsletter called Expert Systems Strategies.
Charter rate is $207, regular rate is $247.  Address is Cahners Publishing
Co. P. O. Box 59, New Town Branch Boston, MA 02258 (617) 964 3030

%A Cornelius Willis
%T The Problems with AI
%J InfoWorld
%V 8
%N 11
%D March 17, 1986
%P 20
%K Insight 1 Level Five Research AI01 T03 H02 AT14 AT12
%X The director of marketing for Level Five Research writes that the
reason that artificial intelligence has not been embraced by corporate
MIS directors is that the charges for Lisp machines and knowledge engineers
are way too high.  He also claims that his product, Insight 1, is
"the most widely used knowledge engineering tool in the world."

%A Peggy Watt
%T Ansa Move Woos Corporate Users
%J ComputerWorld
%V 20
%N 11
%D March 17, 1986
%P 1+
%K H01 AA09 Paradox Ashton-Tate AT04
%X Ansa Software's Paradox has been approved by only about two dozen
large-account evaluators.  In November and December, they sold 1,449
copies against 13,156 copies of Ashton Tate's DBASE products.  In January,
it was 813 copies of Paradox against 6,154 copies of DBASE.  Ansa
is investigating the micro-to-mainframe data base file exchange.

%A Douglas Barney
%T AI-Based Financial Systems Allocates Assets Based on Goals
%J ComputerWorld
%V 20
%N 11
%D March 17, 1986
%P  6
%K H02 AI01 AA06 First Financial Planner Services Plan Power Xerox personal
planning
%X discussion of First Financial Planner Services, Plan Power which
is an expert system that performs personal
financial planning.  It has 6000 rules.

%A Elisabeth Horwitt
%T AI Integration Gets a Shot in the ARm as Vendors Link Products
%J ComputerWorld
%V 20
%N 11
%D March 17, 1986
%P 47+
%K Harvey Newquist Symbolics H03 SNA Texas Instruments Explorers Gould
LMI SUN Apollo AT16
%X Symbolics has announced a link to IBM mainframes via SNA.
Flavors Technology brought out a high speed bus to bus link between
Lisp Machine, Inc. machines or Texas Instruments Explorer's.
and Gould, Inc. superminicomputers.  It costs $36,000.
Texas Instruments plans to integrate their Explorer with SUN and
Apollo.

%A Eric L. Schwartz
%A Bjorn Merker
%T Computer-Aided Neuroanatomy: Differential Geometry of Cortical
Surfaces and an Optimal Flattening Algorithm
%J IEEE Computer Graphics and Applications
%V 6
%N 3
%D March 1986
%P 36-44
%K AA10 AI08
%X describes the mapping of the visual field on the visual cortex
of the monkey

%T Apollo, TI to TIE Network, Workstation
%J Electronic News
%V 32
%N 1593
%D March 17, 1986
%P 18+
%K SUN LMI Flavor Common LISP Compact Lisp Machine H02 AT02 AT16
%X [Much of the material in this article was reported
recently elsewhere in AILIST; only new stuff is in this abstract]
Apollo will be selling a $3,500 Common Lisp.  The link between
Apollo and TI will be made using Apollo's Open Systems Tookit
and TI's Flavor package.  Apollo also hopes to use TI's single
chip LISP machine.  LMI's marketing director said that it is
has always been the position of his company that Lisp machines
and LISP cannot survive alone.  He predicted that alignment of
TI, SUN and Apollo will not affect LMI.  Furthermore, he predicts
that the single chip LISP machine development effort at TI
will take at least 12 months.

%A Richard H. McSwain
%A Robert W. Goutld
%T Taking the Fatigue Out of Fracture Surface Analysis
%J Metal Progress
%V 129
%N 4
%D March 1986
%K AA05 Metallurgy Failure Analysis AI06 striation Fourier
Transform
%X Describes use of the Fourier transform method to analyze
the fracture surface of a material failing from fatigue.
[When a material is repeatedly subjected to changes in
stress, it may fail from fatigue.  This is even true when
the maximum load is well below the limit which would cause
failure if it was applied in a steady state condition.  When
this happens, a characteristic striation appears on the
fracture surface.  This can be viewed with Scanning
Electron Microscopy or even with the naked eye or magnifying
glass.  LEFF]

%A Barry Meier
%T Robot Subs Begin to Surface as Versatile Exploration
Tools
%J Wall Street Journal
%V 78
%N 46
%D March 7, 1986
%P 19
%K Deep Ocean Engineering Company
International Submarine Engineering Ltd.
AA03 AI07 AA18 AA19 GA04
%X Describes some uses and research therein for robot
submarines:
Canadian Oceanographers will use one to hunt for oil
below the icecap.  It will be dropped through
a hole in the ice 1000 miles from the North Pole.
It will then navigate in a grid like pattern in
a ten square mile area mapping the bottoms.  Sonar
will help the sub avoid icebergs.  The thing is being
build by International Submarine Engineering Ltd.
.sp 1
R&D exists in applications
of submarines to prospecting, repair of oil installations,
perform rescue and recovery missions, and engage in
spying.
Work is done on developing sensors based on sound,
AI systems to help robots react to currents and fiber
optics for exchange of data with mother ships.
Deep Ocean Engineering Company has developed a system
of sensors to detect the weight and composition of
objects under water.  They are using tones to inform
the operator of what the robot has in its arms.
They are also perfecting AI to the point that submarines
can be free-swimming.  NASA is funding some of this work
since they hope to apply the results to space travel.

%T Advertisement
%J BYTE
%V 11
%N 4
%D April 1986
%P 284
%K Solution Systems TransLisp T01 H01 AT01
%X Lisp for IBM PC for only $75.00  It is a 230+ function
subset of Common Lisp and has MSDOS interface and graphics.
(Solution Systems also sells the BRIEF editor

%T Star Wars Divides A Campus
%J BusinessWeek
%N 2936
%D March 10, 1986
%P 82-86
%K Carl Hewitt MIT
%X Discusses reactions of MIT people to SDI funding
Carl Hewitt has decided to apply for SDI funding.
The AI Lab at MIT received 55 percent of its 8 million
dollar budget from the defense department.

%A Michael Lesk
%T Writing to be Searched: A Workshop on Document Generation Principles
%J SIGIR Forum
%V 19
%N 1-4
%D WINTER 1986
%P 9-14
%K Cucumber Information Knowledge Systems AI02 A08  AA14
%X "It is now possible to design full-text retrieval systems that
accept conventional docuements and questions in natural English, and then retrie
ve
documents ofr passages from documents that probably answer the questions."
Cucumber Information
Systems and Knowledge Systems, Inc. sell such systems.
A high degree of grammatical variation does not seem important to produce
natural effects in short paragraphs (as evidenced by Karen Kukich's
stock market report generator)"  "Syntax is much less important
for retrieval than semantics; you need to know what the words mean more
than you need to know their relationship."  "Editing manuals to make
them suitable for machine translation, requiring simple translation, has
turned out to make them better in the original language as well."

%A Susanne M. Humphrey
%T Automated Classification and Retrieval Program: Indexing Aid Project
%J SIGIR Forum
%V 19
%N 1-4
%D WINTER 1986
%P 16-17
%K AA14 AI02 AA01
%X Lister Hill Center of the National Library of Medicine is
developing this system to generate indices consistent with
those normally used by MEDLINE.  They are using a frame based system.

%A Frank Tansey
%T Guru's Power Cuts Out the Competition
%J Infoworld
%V 8
%N 12
%D March 24, 1986
%P 14
%K AI01 AA09 AA06 university administration residency T03 H01 AT17
%X This is a review of GURU, an expert system tool that interfaces
with MDBS's Knowledge Man.  It supports up to 3000 rules, forward
and backward chaining, inexact reasoning.  The system also includes
a text processor, graphics, spreadsheet, graphics and telecommunications.
The system received a rating of 5.8 out of 10 with very good
for performance and ease of use, satisfactory for documentation and value,
It takes 1700 pages of documentation to describe the system.
.sp 1
As of much interest as the review itself are the two systems that were
two expert systems developed using GURU described in this review.
The first was a system to assist in determining residency status
of students
for the California Universities for the purpose of determining
tuition.  The final expert system was judging cases with the
experience of a person with six months to one year in
evalulating such matters.  The system was already able to
impress people in the field with only fifty rules.
They also wrote an expert system to do personal financial planning.
This took 300 rules and embodied the entire expertise of the
person writing the software.
.sp 1
[I read elsewhere that MDBS has sold $6,000,000 of these packages
since they came out.  They cost $3,000 each.  MDBS is known
for Knowledge Man, probably the most powerful relational
data base for micros.  Keep in mind that InfoWorld tends
to downgrade systems if they weren't written so as to be used
by people lacking knowledge or aptitude for computers and
thus most readers of AILIST  would have a higher opinion of the
package than 5.8 out of 10.  LEFF ]

%T Chairman Resigns From Automatix
%J Electronic News
%V 32
%N 1594
%D Mar 24, 2986
%K AT16 AT11 AI07
%X Philippe Villers resigned as chairman of robotics maker
Automatix.  Automatix has yet to turn a profit and lost $5,594,000
in 1985 and $14,193,000 in 1984.

%A Michael Bucken
%T Symbolics Starts VAR Program for 36-BIT Processing Systems
%J Electronic News
%V 32
%N 1594
%D Mar 24, 2986
%K AA04 H02 AT16
%X Symbolics has signed its first VAR contract with ICAD which
is developing an engineering design software package.  40 percent
of Symbolics customers are using the system for applications other than
artificial intelligence.  The system has sold about 2000 processors.

%A Criag Stedman
%T Management Seeking GCA Robotics Group
%J Electronic News
%V 32
%N 1594
%D Mar 24, 2986
%K Industrial Systems Group AT16 AI07
%X The management of the robotics division of GCA Corporation
is trying to arrange a leveraged buyout.  The division has lost
10 to 15 million dollars on sales of about $35 million.

%A Tony Baer
%T Finding the Titanic
%J Mechanical Engineering
%V 108
%N 3
%D March 1986
%K Jason Angus control chattering ARGO submersible salvage
underwater AI06 AI07
%X One of the problems in underwater vision is backscattering
from the light source of suspended particles.  A good way of
fighting this problem is to mount the light source away from
the camera.  The new lighting system on the Angus has yielded readable
images of areas about as large as a city block.  A system called
Jason is being developed that will mount in the ARGO submersible.
This system will be self-propelled and have its own manipulator arm.
However, it is NOT going to need artificial intelligence [Emphasis mine,
Leff]

%A J. Houseley
%T Getting a Grip on Sensors
%J IEEE Spectrum
%V 23
%N 4
%D April 1986
%P 8
%K tactile sensors AI07 AT12 AT13
%X This is a comment by an article by Paolo Darlo and Danilo De Rossi
of August 1985 on the subject of using tactile sensors in gripping
objects in robotics.  In a human being picking up an egg, the
human being would apply enough force to prevent the weight of
the egg from deflecting it.  In gripping a hammer, friction between
the hammer is used.  There is a comment on the role of learning in
applying the right amount of force to adjust for the change when
the hammer impacts the nail.  (There is also a response by
the  author.

%T Advertisement
%J Byte
%V 11
%N 3
%D March 1986
%K AT03 H01 T03 AA18 AT01 Thunderstone Corporation Clarity Software
Comprehension Logic-Line
%X Add for Thunderstone Corporation's Logic Line 1 ($250), Logic-Line
2 ($400.00) and Comprehension ($75.00) for the IBM PC It is not clear
from the advertisement what LOGIC-LINE1 and LOGIC-LINE2 actually do.
Comprehension is supposed to enable a person to diagnose their
weakness in a given discipline.  Some quotes from this advertisement:
"Our success has effectively stompted the mortal spit out of the brain
damaged geeks whose rancid cells have been polluting the gene pool of
legitimate AI professionals."  "LOGIC-LINE1, a major breakthrough in
sub-cognitive mathematics, distills the DNA/RNA like analog to any
writer's thought processes.  It allows you to search any textbase for
actual concepts and inference patterns unique to that writer.  In
other words, even though Einstein may never have had a single thought
about ecology, you can apply his thinking patterns to solving
ecological problems!"  "And at its highest level?  You just might use
Thunderstone tools to save the free world, again.  That's right:
Again! LOGIC-LINE 2 began with the mathematics of possibilistic
analysis and recursion (developed by men like Alan Turing and Norbert
Weiner) that directly led the Wellington College team to breaking the
German naval codes in World War II."

%A Melissa Calvo
%T Japanese Firms Granted License by Compuserve
%J InfoWorld
%V 8
%N 8
%D February 24, 1986
%P 14
%K Network Information Forum Nissho Iwai Corporation machine translation AI02
%X Fujitsu announced an English to Japanese translator which works
at 60,000 words per hour.
Compuserve and Network Information Forum plan a database exchange which
might use this translation software.

%A M. Celenk
%A S. H. Smith
%T A New Systematic Method for Color Image Analysis
%R Tech. Rep EE 8509
%I Stevens Institute of Technology Electrical Engineering and Computer
Science Departments
%D December 1985
%K AI06

%A S. A. Friedberg
%T Symmetry Evaluators
%R TR134 (revised)
%I The University of Rochester Computer Science Department
%D January 1986
%K AI06 Hough transform
%X $1.25 24 pages

%A D. H. Ballard
%A P. J. Hayes
%T Parallel Logical Inference and Energy Minimization
%R TR142
%I The University of Rochester Computer Science Department
%D December 1985
%K connectionist H03 AI08
%X $1.50 34 pages

%A J. A. Feldman
%T Parallelism in High Level Vision
%R TR146
%I The University of Rochester Computer Science Department
%D January 1985
%K H03 AI08 AI06
%X 33 pages $1.50

%A J. Tenenberg
%T Reasoning Using Exclusion: an Extension of Clausal Form
%R TR147
%I The University of Rochester Computer Science Department
%D January 1986
%K common sense reasoning AI10 AI11
%X 25 pages $1.25

%A D. H. Ballard
%T Form Perception as Transformation
%R TR148
%I The University of Rochester Computer Science Department
%D January 1986
%K AI06 AI07
%X 34 pages $1.50

%A A. Basu
%A C. M. Brown
%T Algorithms and Hardware for Efficient Image Smoothing
%R TR149
%I The University of Rochester Computer Science Department
%D December 1984
%K AI06 H03 median mean filters
%X 20 pages $1.00

%A B. Sarachan
%T Experiments in Rotational Egomotion Calculation
%R TR152
%I The University of Rochester Computer Science Department
%D February 1985
%K AI06
%X 26 pages $1.25 [Seems to be a paper for a robot to determine if it got
rotated.  LEFF]

%A G. W. Cottrell
%T A Connectionist Approach to Word Sense Disambiguation
%R TR154
%I The University of Rochester Computer Science Department
%D May 1985 (PHD Thesis)
%K AI02 AI08
%X 242 pages $7.25

%A J. A. Feldman
%T Energy and the Behavior of Connection Models
%R TR155
%I The University of Rochester Computer Science Department
%D November 1985
%K H03 AI12
%X 41 pages, $1.75

%A D. Sher
%T Template Matching on Parallel Architectures
%R TR156
%I The University of Rochester Computer Science Department
%D July 1985
%K H03 AI06 Fourier Transform WARP Butterfly
%X 28 pages, $1.25

%A A. Bandopadhay
%A J. Aloimonos
%T Perception of Rigid Motion from Spatio-Temporal Derivatives of Optical Flow
%R TR157
%I The University of Rochester Computer Science Department
%D March 1985
%K AI06
%X 18 pages $1.00 [Seems to be another paper on getting a robot to tell
whether somebody rotated it or not LEFF]

%A J. Aloimonos
%A A. Bandopadhay
%T Perception of Structures from Motion: Lower Bound Results
%R TR158
%I The University of Rochester Computer Science Department
%D March 1985
%K AI06
%X 16 pages $1.00

%A J. Aloimonos
%T One Eye Suffices: a Computational Model of Monocular Robot Depth Perception
%R TR160
%I The University of Rochester Computer Science Department
%D December 1984
%K AI06 optical flow depth perception orthographic perspective projection
%X 16 pages $1.00

%A J. Aloimonos
%A P. B. Chou
%T Detection of Surface Orientation and Motion from Texture: 1. The
Case of Planes
%R TR161
%I The University of Rochester Computer Science Department
%K AI06 Gibson
%X 21 pages $1.25

%A Henry A. Kautz
%T Toward a Theory of Plan Recognition
%R TR162
%I The University of Rochester Computer Science Department
%D July 1985
%K AI09
%X 15 pages $1.00

%A L. Shastri
%T Evidential Reasoning in Semantic Networks: A Formal Theory and its
Parallel Implementation
%R TR166
%I The University of Rochester Computer Science Department
%D September 1985
%K H03 O04
%X 256 pages $7.50

%A D. H. Ballard
%A P. Gardner
%A M. Srinivas
%T Graph Problems and Connection Architectures
%R TR167
%I The University of Rochester Computer Science Department
%D December 1985
%K H03 AI12
%X 24 pages $1.25

%A  A. Bandopadhay
%T Constraints on the Computation of Rigid Motion Parameters from
Retial Displacements
%R TR168
%I The University of Rochester Computer Science Department
%D October 1985
%K AI07 AI06
%X 77 pages, $2.75 [Seems to be another paper on getting a robot to tell
whether somebody rotated it or not LEFF]

%A A. Bandopadhay
%A J. Aloimonos
%T Perception of Structure and Motion of Rigid Objects
%R TR169
%I The University of Rochester Computer Science Department
%D December 1985
%K AI07 AI06
%X 55 pages $2.00 [Seems to be another paper on getting a robot to tell
whether somebody rotated it or not LEFF]

%A D. J. Litman
%T Plan Recognition and Discourse Analysis: An Integrated Approach for
Understanding Dialogues
%R TR170
%I The University of Rochester Computer Science Department
%D  1985
%K AI02 AI09
%X 197 pages $6.00

%A J. A. Feldman
%A D. H. Ballard
%A C. M. Brown
%A G. S. Drell
%T Rochester Connectionist Papers 1979-85
%R TR172
%I The University of Rochester Computer Science Department
%D December 1985
%K AI12 AT21
%X no charge

%A N. Murray
%A E. Rosenthal
%T On Deleting Links in Semantic Graphs
%R TR 85-4
%I State University of New York at Albany, Computer Science Department
%K predicate calculus path resolution AI11

%A S. Chaiken
%A N. Murray
%A E. Rosenthal
%T An Application of $P sub 4$ Free Free Graphs in Theorem Proving
%R TR85-8
%I State University of New York at Albany, Computer Science Department
%K AI11
%X We describe the application of graphs that have no induced $P sub 4$
(4 vertex path) subgraphs to automatic theorem proving.  The semantics of
a propositional formula are expressed in terms of the maximal cliques in
a $P sub 4$ free graph rather than by truth assignments.  Arc sets of s-t
paths in a series parallel network provide an equivalent formulation.
We provide combinatorial foundations for Murray and Rosenthal's work
on path resolution (e. g. TR84-1, TR 84-12 and TR 85-4)  For
any graph G, a c-block (resp d-block) is an induced subgraph H in G such
that for all  maximal cliques (resp maximal stable sets) C in G, C $int$
H is $PHI$ or is a maximal clique (resp. maximal stable set) in H.  A
full block is botha c-block and a d-block.  Blocks are generalizations of
substitution subgraphs which occur in Lovasz's work on perfect graphs.
Theorem:  If full block H is $P sub 4$-free then H must arise by
substitution.  Other properties in these blocks in arbitrary graphs and
in $P sub 4$-free graphs are given.  These constructs are instrumental
in the development of several closely related inference rules collectively
referred to as path resolution.  Finally we show how semantics of $P sub 4$
graphs are
generalized to blocking systems by Minty's painting lemma.  This suggests
possible generalization of path resolution to other combinatorial structures.

%A M. Balaban
%T Western Tonal Music - A New Domain for AI Research
%R TR 85-10
%I State University of New York at Albany, Computer Science Department
%K AI02 AA25

%A M. Balaban
%T Knowledge Representation and Inferencing in a Musical Database
%R TR 85-11
%I State University of New York at Albany, Computer Science Department
%K frames AA25 AA14 T02

%A M. Balaban
%T The Generalized Concept Formalism - A Frame and Logic Based
Representation Model
%R TR 85-20
%I State University of New York at Albany, Computer Science Department
%K AA25 T02

%A Mira Balaban
%T Foundations for Artificial Intelligence Research of Western Tonal Music
%R TR 85-22
%I State University of New York at Albany, Computer Science Department
%K AA25

%A M. Balaban
%T CSM: An AI Approach to the Study of Western Tonal Music
%R TR 85-24
%I State University of New York at Albany, Computer Science Department
%K AA25

%A H. B. Hunt
%A R. E. Stearns
%T Distributive Lattices and the Complexity of Logics and Probability
%R TR 85-28
%I State University of New York at Albany, Computer Science Department
%K AI11 O04
%X Relationships between number of repetitions of variables in formulas
and complexity of decision problems for the formulas.
Applications to logic and probability:
1) Any reasonable propositional calculus with a reasonable implication
operator has a coNP-hard logical Validy problem.  This is true for very
simple formulas involving or, and and a single occurrence of the implication
operator
2) The set of theorems of the propositional calculus of classical
implicative logic is coNP complete
3. Computing the probabilities of a joint event and a conditional event becomes
"hard" almost immediately when the events E1 and E2 are not statistically
independent

%A H. B. Hunt
%A R. E. Stearns
%T Monotone Boolean Formulas, Distributive Lattices, and the Complexities
of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)
%R TR85-29
%I State University of New York at Albany, Computer Science Department
%K AI11 O04

%A Andrew Laine
%A Seymour V. Pollack
%T The Enhanced Wudma Image Processing
%R WUCS-85-1
%I Department of Computer Science, Washington University
%C St. Louis, Missouri
%K AI06

%A S. E. Elnahas
%A R. G. Jost
%A J. R. Cox
%A R. L. Hill
%T Transmission Progressive of Digital Diagnostic Images
%R WUCS-85-8
%I Department of Computer Science, Washington University
%C St. Louis, Missouri
%K AI06 AA01
%X Progressive transmission of digital pictures permits the receiver
to construct an approximate picture first, then gradually improve the quality
of reconstruction.

%A James R. Slagle
%A John M. Long
%A Michael R. Wick
%A John P. Matts
%A Arthur  S. Leon
%T Expert Systems in Medical Studies- A New Twist
%R TR 86-3
%I University of Minessota, Department of Computer Science
%D 1986
%K AA01 AI01

%A Robert M. Herndon,\ Jr.
%A Valdis A. Berzins
%T An Interpretive Technique for Evaluating Functional Attribute
Grammars
%R TR 86-5
%R 1986
%I University of Minessota, Department of Computer Science

%A Robert M. Herndon,\ Jr.
%A Valdis A. Berzins
%T A Method for the Construction of Dynamic, Lazy Evaluators for
Functional Attribute Grammars
%R 86-6
%R 1986
%I University of Minessota, Department of Computer Science

%A J. Schwartz
%A M. Sharir
%T Efficient Motion Planning Algorithms in Environments of
Bounded Local Complexity
%R 164
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D June 1985
%K AI07

%A J. Schwartz
%A M. Sharir
%T Identification of Partially Obscured Objects in Two Dimensions
by Matching of Noisy 'Characteristic Curves'
%R 165
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D June 1985
%K AI06

%A G. Landau
%A U. Vishkin
%T Efficient String Matching with k Mismatches
%R 167
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D June 1985
%X Give a text of length n, a pattern of length m and an integer k,
we present an algorithm for finding all occurrences of the patterns in
the text, with at most k mismatches running in O(k(mlogm + n)

%A G. Landau
%A U. Vishkin
%T An Efficient String Matching Algorithm with k Differences for
Nucleotide and Amino Acid Sequences
%R 168
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D June 1985
%X Algorithm to allow for optimal alignment of one sequence, the
pattern of length m, with another longer sequence the text, of
length n.  These algorithms allow mismatches, deletions
and insertions.  If k is the maximum number of differences,
then the time is O(k sup 2 n).

%A R. Hummel
%A A. Rojer
%T Connected Component Labeling in Image Processing with
MIMD Architectures
%R 173
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D September 1985
%K AI06  H03

%A S. Zucker
%A R. Hummel
%T Receptive Fields and the Representation of Visual Information
%R 176
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D September 1985
%K AI06 AI08 Gaussian retina
%X Hypothesis that the receptive fields of the retina provide
a suitable method for transmitting the image over the optic nerve
which is a limited bandwidth channel.

%A M. Landy
%A R. Hummel
%T A Brief Survey of Knowledge Aggregation Methods
%R 177
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D September 1985
%K AI04

%A G. Landau
%A U. Vishkin
%T Efficient String Matching with k Differences
%R 186
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D October 1985
%X If the mismatches considered are a single character mismatch,
a superfluous character in the text or pattern, there exists an
algorithm that runs in time O(m+k sup 2 n ) when the
alphabet size is fixed and O(m log m + k sup 2 n) otherwise
where m is length of pattern, k is the number of mismatches
and n is the text.

%A D. Leven
%A M. Sharir
%T On the Number of Critical Free Contacts of a Convex Polygonal
Object Moving in 2-D Polygonal Space
%R 187
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D October 1985
%K AI07

%A J. Burdea
%A H. Wolfson
%T Automated Assembly of a Jigsaw Puzzle Using the IBM 7565 Robot
%R 188
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D November 1985
%K AI07

%A E. Davis
%T Constraint Propagation on Real-Valued Quantities
%R 189
%I New York University, Courant Institute of Mathematical Sciences,
Department of Computer Science
%D November 1985
%K AI03

%A N. S. Sridharan
%T Representing Knowledge in Introduction using TAXMAN Examples
%R LRP-TR-12
%I Rutgers University, Department of Computer Science
%D 11/81

%A L. T. McCarty
%A N. S. Sridharan
%T "A Computational Theory of Legal Argument"
%R LRP-TR-13
%I Rutgers University Department of Computer Science
%D 1/82
%K AA24 tax
%X The TAXMAN project is an experiment in the application of artificial
intelligence to the study of legal reasoning and legal argumentation,
using corporate tax law as an experimental problem domain.  Legal
concepts possess what is often termed "open-texture", that is, their
definitions are subject to a continual process of construction and
modification during the analysis of a contested case.  We have
developed a "prototype-plus-deformation" representation for the
structure of such concepts, a representation which facilitates the
formulation of several systematic methods of conceptual modification.
We propose now to construct a cognitive model of the process of legal
argument, using this representation.  The research is aimed at
developing explanations for the persuasiveness of certain strategies
of legal argument, and at developing further the criteria of
conceptual coherence, both task-specific and task-independent, which
seem to constrain the space of plausible arguments.  We emphasize not
only the contributions of this research to Artificial Intelligence,
but also the insights that may result for some of the fundamental
issues in jurisprudence.

%A N.S. Sridharan
%T "A Flexible Structure for Knowledge"
%R LRP-TR-14
%I Rutgers University Department of Computer Science
%D 9/82
%K AA24 tax  AI04
%X Concepts often dealt with in legal reasoning and argumentation are
amorphous.  For TAXMAN II, we have proposed in the past a Prototype
and Deformation model for these amorphous concepts.  In this model, a
concept is represented as a structured space of exemplars, that is as
a set of exemplars, structured by transformations and relationships
among them.  In this paper, the idea of representing a concept as a
structured space of exemplars is extended; suggesting that all
knowledge represented in a computer be organized as structured spaces
and subspaces.  Concepts are represented as spaces; concepts are also
members of spaces.  This duality is exploited to gain flexibility in
the representation, that is, changes to the structure can be effected
through computation.

%A Donna Nagel
%T "Concept Learning by Building and Applying Transformations Between
Object Descriptions"
%R LRP-TR-15
%I Rutgers University Department of Computer Science
%D 6/83
%K AI04 analogy matching
%X The Concept Learning presented here emphasizes the building of a
transformation between an instance of a concept and another instance
which is distinguished as a prototype of the concept.  A recursive
partial matcher is used to pinpoint components of structural object
descriptions of the training instances for matching.  Three procedures
are described for inducing matches:  building simple analogies,
applying primitive transformations, and finding projections of the
instances into domains of knowledge relevant to the concept being
learned.  This research is experimental in nature and directed at
discovering flexible ways to define and represent concepts which are
amorphous and open-textured.

%A N.S. Sridharan
%T "EVOLVING SYSTEMS OF KNOWLEDGE"
%R LRP-TR-16
%I Rutgers University Department of Computer Science
%D 3/84
%K AI01
%X The enterprise of developing knowledge-based systems, is currently
witnessing great growth in popularity.  The central unity of such
programs is that they interpret knowledge that is explicitly encoded
as @i[rules].  This paper is a statement of personal perspective by a
researcher interested in fundamental issues in the symbolic
representation and organization of knowledge.  The discussion covers
the nature of rules (Sec. 3), and methods of rule-handling (Sec. 4).
The paper concludes with a discussion of how most concepts we use are
open-textured and how they continually evolve with use (Sections
5,6,7).  While rule-based programming comes with certain clear
pay-offs, further fundamental advances in research is needed to extend
the scope of tasks that can be adequately represented in this fashion.

%A S.Kedar-Cabelli
%T "Analogy with Purpose in Legal Reasoning from Precedents"
%R LRP-TR-17
%I Rutgers University Department of Computer Science
%D 6/84
%D 10/84
%K AA24 taxman tax AA04
%X One open problem in current artificial intelligence (AI) models of
learning and reasoning by analogy is: which aspects of the analogous
situations are relevant to the analogy, and which are irrelevant?  It
is currently recognized that analogy involves mapping some underlying
causal network of relations between situations [Winston 82], [Gentner
83], [Burstein 83a], [Carbonell 83].  However, most current models of
analogy provide the system with exactly the relevant relations,
tailor-made to each analogy to be performed.  As AI systems become more
complex, we will have to provide them with the capability of
automatically focusing on the relevant aspects of situations when
reasoning analogically.  These will have to be sifted from the large
amount of information used to represent complex, real-world
situations.
.sp 1
In order to study these general issues, we are examining a particular
case study of learning and reasoning by analogy: forming legal
concepts by legal reasoning from precedents.  This is studied within
the TAXMAN II project, which is investigating legal reasoning using AI
techniques [McCarty & Sridharan 82], [Nagel 83].
.sp 1
In this dissertation proposal, we will discuss the problem and a
proposed solution.  We examine legal reasoning from precedents within
the context of current AI models of analogy.  We then add a focusing
capability.  Current work on goal-directed learning [Mitchell 83a],
[Mitchell & Keller 83], and explanation-based learning [Dejong 83]
applies here: the explanation of how the precedent satisfies the
intent of the law (i.e. its goals, or purposes) helps to automatically
focus the reasoning on what is relevant.

%A A. Yasuhara
%A F. Hawrusik
%A K.N. Venkataraman
%T Computability on Binary Trees - An Extended Abstract
%R CTA-TR-2
%I Rutgers University
%D 8/80
%D 1/82
%X We propose an effective method of computation on finite binary trees
that is analogous to the effective computation on the natural numbers
determined by the partial recursive functions.  Not surprisingly, the
method is LISP-like.  A finitely axiomatizable theory is given that is
shown to be just strong enough to represent the class of functions
computable by this method.  Several natural subclasses; of this class
of functions are delineated and they are shown to be different from
one another.

%A K.N. Venkataraman
%T Sub Classes of Programs for Computing on Binary Trees
%R CTA-TR-3
%I Rutgers University
%D 3/81
%D 1/82
%K T01
%X Several sub-classes of the deterministic regular programs that compute
on binary trees are defined and relations of inclusion and inequality
among these classes in terms of functions computable (by these
programs) are established.  Certain properties of these classes of
programs are studied.  In particular the sets recognized by these
programs are characterized in terms of the domain and range of these
programs.  Most of the results that appear in this paper can easily be
extended to programs computing on other recursively defined data
structures.

%A K.N. Venkararaman
%T Decidability of the Purely Existential Fragment of the Theory of
Term Algebras
%R CTA-TR-4
%D 10/81
%X This thesis is concerned with the question of the decidability and
the complexity of the decision problem for certain fragments of the
theory of free term algebras.
.sp 1
The existential fragment of the theory of term algebras is shown to be
decidable by presenting a non-deterministic algorithm which given a
quantifier free formula P, constructs a solution for P if it has one
and indicates failure if there are no solutions.  A detailed proof of
the correctness of the algorithm is given.  It is shown that the
decision problem is in NP by proving that if a quantifier-free formula
P has a solution then there is one that can be represented as a dag in
space at most cubic in the length of P.  The decision problem is
shown to be complete for NP by reducing 3-SAT to that problem.  It is
also shown that the @ @ @-[o] hierarchy over a term algebra
corresponds to the polynomial time hierarchy.
.sp 1
The proof of the fact that the introduction of the selector functions
into the first order language does not increase the complexity of the
existential fragment of the theory is indicated.  Thus it is
established that the existential fragment of the theory of list
structures in the language of NIL, CONS, CAR, CDR, = , @u[<] is
NP-complete.
.sp 1
It is shown that the equivalence of PB[;@u{<}] straight line programs
is decidable follows easily from the decidability of the existential
fragment of the theory of list structures.
.sp 1
It is also shown that for any quantifier free formula P (in
the language of a term algebra) there is an algorithm which given a
recursive set S of cardinal numbers @u{<} @ @ @-[o], can decide
whether or not the number of solutions of P is in S.

%A Smadar Kedar-Cabelli
%T Purpose-Directed Analogy
%R ML-TR-1
%I Rutgers University
%D 7/85
%X Recent artificial intelligence models of analogical reasoning are
based on mapping some underlying causal network of relations between
analogous situations.  However, causal relations relevant for the
purpose of one analogy may be irrelevant for another.  We describe
here a technique which uses an explicit representation of the purpose
of the analogy to automatically create the relevant causal network.
We illustrate the technique with two case studies in which concepts of
everyday artifacts are learned by analogy.

%A T.M. Mitchell
%A R.M. Keller
%A S.T. Kedar-Cabelli
%T Explanation-Based Generalization: A Unifying View
%R ML-TR-2
%D 8/85
%X The problem of formulating general concepts from specific training
examples has long been a major focus of machine learning research.
While most previous research has focused on empirical methods for
generalizing from a large number of training examples using no
domain-specific knowledge, in the past few years new methods have been
developed for applying domain-specific knowledge to formulate valid
generalizations from single training examples.  The characteristic
common to these methods is that their ability to generalize from a
single example follows from their ability to explain why the training
example is a  member of the concept being learned.  This paper
proposed a general, domain-independent mechanism, called EBG, that
unifies previous approaches to explanation-based generalization.  The
EBG method is illustrated in the context of several example problems,
and used to contrast several existing systems for explanation-based
generalization.  The perspective on explanation-based generalization
afforded by this general method is also used to identify open research
problems in this area.

%A John Thomas
%T A Method of Studying Natural Language Dialogue
%R RC-5882
%I IBM Watson Research Center, User Interface Institute
%D February 1976
%K AI02

%A John Thomas:
%T Artificial Intelligence and Human Factors.
%R RC-10823
%I IBM Watson Research Center, User Interface Institute
%D November 1984
%K AI08

%A  Carbonell, Jaime
%T  Derivational analogy: a theory of reconstructive problem solving
and
expertise acquisition.
%R  CMU-CS-85-115.
%I  Carnegie-Mellon University. Department of Computer Science.
%D  1985.
%K  Case-based reasoning.

%A  Kahn, Gary
%A  McDermott, John
%T  MUD: a drilling fluids consultant
%R  CMU-CS-85-116
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985
%K  Diagnostic systems,  Knowledge acquisition AI01 AA03  AA21

%A Doyle, Jon
%T  Reasoned assumptions and Pareto optimality
%R  CMU-CS-85-121
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985.
%K Economic theory  Group decision making  Inference rules
Non-monotonic reasoning AA11

%A David M. McKeown, Jr
%A  Pane, John F
%T  Alignment and connection of fragmented linear features in aerial
imagery
%R  CMU-CS-85-122
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985
%K Cultural features Feature extraction Image segmentation
Region interpolation Spline approximation AI06

%A Dill, David
%A  Clarke, Edmund
%T  Automatic verification of asynchronous circuits using temporal
logic
%R CMU-CS-85-125
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985
%K  Circuit design
Timing constraints AA04 AI11

%A Lehr, Theodore
%T  The implementation of a production system machine
%R  CMU-CS-85-126
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985
%K Computer architecture  OPS5  Performance improvement Production systems
RISCF Rete algorithm AI01

%A  Minton, Steven
%T A game-playing program that learns by analyzing examples
%R  CMU-CS-85-130
%I  Carnegie-Mellon University. Department of Computer Science
%D  1985
%K Concept acquisition
Constraint based generalization
Forcing configurations
Learning from examples
Machine learning
Tactical combinations
Winning combinations
AI04 AA17

%A Fox, Mark
%A  Wright, J. Mark
%A  Adam, David
%T  Experiences with SRL: an analysis of a frame-based knowledge
representation
%R CMU-RI-TR-85-10
%I  Carnegie-Mellon University. Robotics Institute
%D  1985
%K  Knowledge representation languages

%A  Smith, Stephen
%A  Ow, Peng Si
%T  The use of multiple problem decompositions in time constrained
planning tasks
%R  CMU-RI-TR-85-11
%I  Carnegie-Mellon University. Robotics Institute
%D  1985
%K  Job shop scheduling
%K  Multi-agent planning systems
%K  Resource allocation AI10

%A Brost, Randy
%T  Planning robot grasping motions in the presence of uncertainty
%R  CMU-RI-TR-85-12
%I  Carnegie-Mellon University. Robotics Institute
%D  1985
%K  Manipulators AI07 O04 AI09

%A  Darlington,
%A  Field, A.
%A  Pull, H.
%T  The unification of functional and logic languages
%R  Research report DOC 85/3
%I Imperial College of Science and Technology. Department of
Computing
%D  1985
%K  Functional programming
Reduction
Resolution AI10

%A  Gregory, Steve
%A  Neely, Rob
%A  Ringwood, Graem
%T  Parlog for specification, verification and simulation
%R  Research report DOC 85/7
%I  Imperial College of Science and Technology. Department of
Computing
%D  1985
%K  PARLOG AI10 H03

%A  Saint-Dizier, Patrick
%T  On syntax and semantics of adjective phrases in logic
programming
%R  Rapport de recherche 381
%I  Institut National de Recherche en Informatique et en Automatique
(INRIA)
%D  1985
%K AI10

%A  Deransart, Pierre
%A  Maluszynski, Jan
%T Relating logic programs and attribute grammars
%R  Rapport de recherche 393
%I  Institut National de Recherche en Informatique et en Automatique
(INRIA)
%D  1985
%K Attribute dependency scheme Data flow analysis Logic programming AI10

%A  Gazdar, Gerald
%A  Pullum, Geoffrey K
%T  Computationally relevant properties of natural languages and their
grammars
%R  CSLI-85-24
%I  Stanford University. Center for the Study of Language and
Information
%D  1985
%P  45
%K AI02

%A  Fagin, Ronald
%A  Vardi, Moshe
%T  An internal semantics for modal logic: preliminary report
%R  CSLI-85-25
%I  Stanford University. Center for the Study of Language and
Information
%D  1985
%P  24p
%K AI10

%A  Barwise, Jon
%T  The situation in logic - III: simulation, sets and the axiom of
foundation
%R  CSLI-85-26
%I  Stanford University. Center for the Study of Language and
Information
%D  1985

%A  van Benthem, Johan
%T  Semantic automata
%R  CSLI-85-27
%I  Stanford University. Center for the Study of Language and
Information
%D  1985

%A  Sells, Peter
%T  Restrictive and non-restrictive modification
%R  CSLI-85-28
%I  Stanford University. Center for the Study of Language and
Information
%D  1985

%A  Abadi, Martin
%A  Manna, Zohar
%T  Nonclausal temporal deduction
%R  STAN-CS-85-1056
%I  Stanford University. Department of Computer Science
%D  1985
%P  17p
%K  Nonclausal resolution Propositional temporal logic
AI10 AI11

%A  Mason, Ian A
%A  Talcott, Carolyn L
%T  Memories of S-expressions: proving properties of Lisp-like
programs that destructively alter memory
%R  STAN-CS-85-1057
%I  Stanford University. Department of Computer Science
%D  1985
%K  Computations over memory structures Correctness proofs
Robson copying algorithm AI11 AA08

%A  Taubenfeld, G
%A  Francez, N
%T  Proof rules for communication abstractions
%R  Technical report 332
%I  TECHNION - Israel Institute of Technology. Department of Computer
Science
%D  1984
%K  Concurrent programming Deadlock Invariants Program verification
%K Scripts AA08

%A  Shmueli, O
%A  Tsur, S
%A  Zfira, H
%T  Rule supporting in PROLOG
%R  Technical report 337
%I  TECHNION - Israel Institute of Technology. Department of Computer
Science
%D  1984
%K T02

%A  Shapiro, Ehud
%T  A subset of Concurrent Prolog and its interpreter
%R  CS83-06
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K T02 H03
%X  "This is a revised version of technical report TR-003,
ICOT-Institute
for New Generation Computing Technology.";

%A  Shapiro, Ehud
%A  Takeuchi, Akikazu
%T  Object oriented programming in Concurrent Prolog
%R  CS83-08
%I Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K H03 T02

%A  Harel, David
%A  Peleg, David
%T  Process logic with regular formulas
%R  CS83-11
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983

%A  Hellerstein, L
%A  Shapiro, Ehud Y
%T  Implementing parallel algorithms in Concurrent Prolog
%R  CS83-12
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K T02 H03
%X Summary/draft, August 1983

%A  Manna, Zohar
%A  Pnueli, Amir
%T  How to cook a temporal proof system for your pet language
%R  CS83-13
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K  AA08 AI11

%A  Harel, David
%A  Peleg, David
%T  On static logics, dynamic logics and complexity classes
%R  CS83-15
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K AI11

%A  Feldman, Yishai A
%T  A decidable propositional probabilistic dynamic logic
%R  CS83-18
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1983
%K AI11

%A  Barringer, Howard
%A  Kuiper, Ruurd
%A  Pnueli, Amir
%T  Now you may compose temporal logic specifications
%R  CS84-09
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K AI11

%A  Shapiro, Ehud Y
%T  The Bagel: a systolic Concurrent Prolog machine (lecture notes)
%R  CS84-10
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K H03 T02

%A  Peleg, David
%T  Concurrent dynamic logic
%R  CS84-14
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K T02 H03

%A  Mierowsky, Colin
%T  Design and implementation of flat Concurrent Prolog
%R  CS84-21
%I Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K H03 T02
%X Thesis (M.S.)

%A  Bloch, Charlene
%T  Source-to-source transformations of logic programs
%R  CS84-22
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K AI10
%X Thesis (M.S.)

%A  Viner, Omri
%T  Distributed constraint propagation
%R  CS84-24
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K H03
%X Thesis

%A  Peleg, David
%T  Concurrent program schemes and their logics
%R  CS84-25
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K H03 T02

%A Lichtenstein, Orna
%A  Pnueli, Amir
%T  Checking that finite state concurrent programs satisfy their
linear specification
%R  CS84-26
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984
%K AA08

%A  Nygate, Yossi
%T  Python: a bridge expert on squeezes
%R  CS84-27
%I  Weizmann Institute of Science. Department of Applied Mathematics
%D  1984

%A  Nixon, I. M.
%T I.F.: an Idiomatic Floorplanner
%R  CSR-170-84
%I  University of Edinburgh. Department of Computer Science
%D  1984
%K  VLSI AA04

%A  Sannella, Donald
%A  Tarlecki, Andrzej
%T  On observational equivalence and algebraic specification
%R  CSR-172-84
%I  University of Edinburgh. Department of Computer Science
%D 1984

%A  Prasad, K. V. S
%T  Specification and proof of a simple fault tolerant system in CCS
%I  University of Edinburgh. Department of Computer Science
$R  CSR-178-84
%D  1984
%K AA08 AI11

%A  Blake, Andrew
%T  Inferring surface shape by specular stereo
%R CSR-179-84
%I  University of Edinburgh. Department of Computer Science
%D  1984
%K AI06

%A  Dolan, Charles
%T  Memory based processing for cross contextual reasoning: reminding
and
analogy using thematic structures
%R  CSD-850010
%I  University of California, Los Angeles. Computer Science
Department
%D  1985
%X Thesis (M.S.)

%A  Hooper, Richard
%T  An application of knowledge-based systems to electronic
computer-aided
engineering, design, and manufacturing data base transport
%R  CSD-850011
%I  University of California, Los Angeles. Computer Science
Department
%D  1985
%K AA05 AA04
%X  Thesis (Ph.D.)

%A  Rendell, Larry
%T  Induction, of and by probability
%R  UIUCDCS-R-85-1209
%I  University of Illinois, Urbana-Champaign. Department of Computer
Science
%D  1985
%K  Conceptual clustering Inductive inference AI04
Noise management Probabilistic learning systems

%A  Rendell, Larry
%T  Genetic plans and the probabilistic learning system: synthesis and
results
%R  UIUCDCS-R-85-1217
%I  University of Illinois, Urbana-Champaign. Department of Computer
Science
%D  1985
%K  Conceptual clustering AI12  AI04

%A  Anderson, James W.
%T  Portable Standard LISP on the Cray
%R  LA-UR-84-4049
%I  Los Alamos National Laboratory
%D  1984
%K T01 H04 PSL

%A  Arnon, Dennis S.
%T  Supercomputers and symbolic computation
%R  CSD-TR-481
%I  Purdue University. Department of Computer Sciences
%D  1984
%K AI14 H04

%A  J. Schwartz
%T A Survey of Program Proof Technology
%R 001
%I New York University, Courant Institute, Department of Computer
Sciences
%D September 1978
%K AA08 AI11

%A S. Stolfo
%A M. Harrison
%T Automatic Discovery of Heuristics for Non-Deterministic Programs
%R 007
%I New York University, Courant Institute, Department of Computer
Sciences
%D January 1979
%K AI04 AI03

%A M. Sharir
%T Algorithm Derivation by Transformations
%R 021
%I New York University, Courant Institute, Department of Computer
Sciences
%D October 1979
%K AA08

%A A. Walker
%T Syllog: A Knowledge Based Data Management Systems
%R 034
Sciences
%I New York University, Courant Institute, Department of Computer
Sciences
%D June 1981
%K AA09

%A J. Schwartz
%A M. Sharir
%T On the Piano-Movers Problem, I. Case of A Two Dimensional Rigid
Polygonal Body Moving Amidst Polygonal Barriers
%R 039 R1
Sciences
%I New York University, Courant Institute, Department of Computer
Sciences
%D October 1981
%K AI07

%A J. T. Schwartz
%A M. Sharir
%T On the Piano Movers Problem, II General Techniques for Computing
Topologic Properties of Real Algebraic Manifolds
%R 041 R2
%I New York University, Courant Institute, Department of Computer
Sciences
%D February 1982
%K AI07

%A J. Schwartz
%A M. Sharir
%T On the Piano Movers Problem III Coordinating the Motion of Several
Independent Bodies: The Special Bodies Moving Amidst Polygonal Bariers
%R 052 r3
%I New York University, Courant Institute, Department of Computer
Sciences
%D September 1982
%K AI07

%A C. O'Dunlaing
%A C. Yap
%T The Voronoi Diagram Method of Motion-Planning: I. The Case of a Disc
%R 053 R4
%I New York University, Courant Institute, Department of Computer
Sciences
%D March 1982
%K AI07

%A M. Sharir
%A E. Azriel-Sheffi
%T On the Piano Movers Problem IV Various Decomposable Two-Dimensional
Motion Plannings Problems
%R 058 R6
%I New York University, Courant Institute, Department of Computer
Sciences
%D February 1983
%K AI07

%A J. Schwartz
%T Structured Light Sensors for 3-D Robot Vision
%R 065 R8
%I New York University, Courant Institute, Department of Computer
Sciences
%D March 1983
%K AI06 AI07

%A C. Yap
%T Complexity of Motion Coordination
%R R12
%I New York University, Courant Institute, Department of Computer
Sciences
%K AI07

%A J. Schwartz
%A M. Sharir
%T On the Piano Movers Problem: V. The Case of a Rod Moving in
Three Dimensional Space Amidst Polyhedral Obstacles
%R 083 R13
%I New York University, Courant Institute, Department of Computer
Sciences
%D July 1983
%K AI07

%A R. Cole
%A C. Yap
%T Shape from Probing
%R 104 R15
%I New York University, Courant Institute, Department of Computer
Sciences
%D October 1983
%K AI07 AI06

%A J. Schwartz
%A M. Sharir
%T Some Remarks on Robot Vision
%R 119 R25
%I New York University, Courant Institute, Department of Computer
Sciences
%D April 1984
%K AI07 AI006

%A C. Bastuscheck
%A J. Schwartz
%T Preliminary Implementation of a Ratio Depth Sensor
%R 124 R28
%I New York University, Courant Institute, Department of Computer
Sciences
%D June 1984

%A H. Bernstein
%T Determining the Shape of a Convex n-sided Polygon by Using 2n+k Tactile
Probes
%R 125 R29
%I New York University, Courant Institute, Department of Computer
Sciences
%D June 1984
%K AI07 AI06

%A A. Tuzhilin
%A P. Spirakis
%T A Semantic Approach to Correctness of Concurrent Executions
%R 130
%I New York University, Courant Institute, Department of Computer
Sciences
%D July 1984
%K AA08

%A E. Davis
%T Shape and Function of Solid objects: Some Examples
%R 137
%I New York University, Courant Institute, Department of Computer
Sciences
%D October 1984

%A C. O'Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi Diagrams for Moving a Ladder: I Topological
Analysis
%R 139 R32
%I New York University, Courant Institute, Department of Computer
Sciences
%D November 1984

%A C. O Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi Diagrams for Moving a Ladder: II Efficient
Construction of the Diagram
%R 140 R33
%I New York University, Courant Institute, Department of Computer
Sciences
%D November 1984

%A M. Bastuscheck
%T Look Up Table Computation for A Ratio Image Depth Sensor
%R 141 R34
%I New York University, Courant Institute, Department of Computer
Sciences
%D November 1984

%A J. Schwartz
%A M. Sharir
%A A. Siegel
%T An Efficient Algorithm for Finding Connected Components of a Binary
Image
%R 154 R38
%I New York University, Courant Institute, Department of Computer
Sciences
%D February 1985
%K AI06

%A D. Cantone
%A A. Ferro
%A J. Schwartz
%T Decision Procedures for Elementary Sublanguages of Set Theory VI.
Multi-Level Syllogistic Extended by the Power Set Operator
%R 156
%I New York University, Courant Institute, Department of Computer
Sciences
%D February 1985
%K AI11

%A E. Kishon
%A X. D. Yang
%T A Video Camera Interface for High Speed Region Boundary Locations
%R 157 R40
%I New York University, Courant Institute, Department of Computer
Sciences
%D February 1985
%K AI06

%A N. V. Findler
%A H. Klein
%A W. Gould
%A A. Kowal
%A J. Menig
%T (1) Studies on decision making using the game of poker;
(2) Computer experiments on the formation and optimization
of heuristic rules
%R 13
%I Suny Buffalo Computer Science

%A N. V. Findler
%A D. Chen
%T On the problems of time, retrieval of temporal
relations, causality and co-existence
%R 14
%I Suny Buffalo Computer Science


%A G. T. Herman
%A J. A. Jackowski
%T A decision procedure using discrete geometry
%R 15
%I Suny Buffalo Computer Science
%K AI14

%A N. V. Findler
%T Short note on a heuristic search strategy
%R 20
%I Suny Buffalo Computer Science
%K AI03

%A N. V. Findler
%A H. Klein
%A A. Kowal
%A Z. Levine
%A J. Menig
%T Heuristic programmers and their gambling machines
%I SUNY Buffalo Computer Science
%K AI03

%A G. T. Herman
%A P. W. Aitchison
%T A decision procedure using the geometry of convex sets
%R 72
%I SUNY Buffalo Computer Science
%K AI14

%A G. T. Herman
%A A. V. Lakshminarayanan
%A S. W. Rowland
%T The reconstruction of objects from shadowgraphs
with high contrasts
%R 84
%I SUNY Buffalo Computer Science
%D August 1974
%K AI06

%A G. T. Herman
%A A. Lent
%T A computer implementation of a Bayesian analysis of image
reconstruction
%R 91
%I SUNY Buffalo Computer Science
%D January 1975
%K AI06

%A A. V. Lakshminarayanan
%T Reconstruction from divergent ray data
%R 92
%I SUNY Buffalo Computer Science
%D January 1975
%K AI06

%A G. T. Herman
%A A. Lent
%A P. H. Lutz
%T Iterative relaxation methods for image reconstruction
%R 93
%I SUNY Buffalo Computer Science
%D July 1975
%K AI06

%A N. V. Findler
%T Studies in machine cognition using the game of Poker
%R 99
%I SUNY Buffalo Computer Science
%D June 1975
%K AA17
%X A progress report is presented of our on-going research efforts
concerning human decision making under uncertainty and risk,
human problem solving and learning processes, on one hand,
and machine learning, large scale programming systems
and novel programming techniques, on the other.

%A G. T. Herman
%A A. Lent
%T Quadratic optimization for image reconstruction, Part I
%R 103
%I SUNY Buffalo Computer Science
%K AI06

%A P. H. Lutz
%T Fourier image reconstruction incorporating
three simple interpolation techniques
%R 104
%I SUNY Buffalo Computer Science
%K AI06

%A T. L. Roy
%T A contribution to the Poker Project: The
development of and experience with a
Statistically Fair Player
%R 110
%I SUNY Buffalo Computer Science
%D May 1976
%K AA17
%X This paper is a report on my efforts over the past
several months, in the development of a Player Function
for the Poker System, called the Statistically Fair Player.


%A J. N. Shaw
%T Multi-Pierre, a learning robot system
%R 111
%I SUNY Buffalo Computer Science
%D May 1976
%K AI07
%X The goal of this project is to simulate several robots
under partial human control,
and operating in a lifelike'' environment.
The robots have an overall goal of survival and an instinct''
to explore their environment.
The project is an extension of an existing system
which has a single organism functioning in a similar environment.
The environment consists of a flat terrain,
populated with three-dimensional objects of varying types,
sizes and shapes.

%A T. W. Chen
%A N. V. Findler
%T Toward analogical reasoning in problem
solving by computers
%R 115
%I SUNY Buffalo Computer Science
%D December 1976
%K AA17
%X We attempt in the present paper
to investigate Analogical
Reasoning (AR) detached from specific tasks and to formulate
its general principles so that it may become a component of
problem solving programs as much as the means-ends analysis
has been shown to be one in the literature on GPS.

%A S. C. Shapiro
%T A Scrabble crossword game playing program
%R 119
%I SUNY Buffalo Computer Science
%K AA17

%A J. K. Cipolaro
%A N. V. Findler
%T MARSHA, the daughter of ELIZA \- a simple
program for information retrieval in
natural language
%R 127
%I SUNY Buffalo Computer Science
%K AA02 AA14

%A G. T. Herman
%A S. W. Rowland
%T SNARK77: A programming system for the reconstruction
of pictures from projections
%R 130
%I SUNY Buffalo Computer Science
%D January 1978
%K AI06

%A G. T. Herman
%A H. Hurwitz
%A A. Lent
%A H. P. Lung
%T On the Bayesian approach to image reconstruction
%R 134
%I SUNY Buffalo Computer Science
%D June 1978
%K AI06

%A N. V. Findler
%T A heuristic information retrievalsystem based on
associative networks
%R 141
%I SUNY Buffalo Computer Science
%D February 1978
%K AI12 AA14

%A E. Artzy
%T Boundary detection of internal organs in mini-computers
%R 145
%I SUNY Buffalo Computer Science
%K AI06 AA01

%A S. N. Srihari
%T On choosing measurements for invariant pattern recognition
%R 147
%I SUNY Buffalo Computer Science
%D September 1978
%K AI06

%A J. Case
%A S. Ngo\ Manuelle
%T Refinements of inductive inference
by Popperian machines
%R 152
%I SUNY Buffalo Computer Science
%K AI04

%A J. Case
%A C. H. Smith
%T Comparison of identification criteria
for mechanized inductive inference
%R 154
%I SUNY Buffalo Computer Science
%K AI04

%A C. H. Smith
%T Finite covers of inductive inference machines
%R 155
%I SUNY Buffalo Computer Science
%K AI04

%A D. P. McKay
%A S. C. Shapiro
%T MULTI \- a Lisp based multiprocessing system
%R 164
%I SUNY Buffalo Computer Science
%K H03 T01

%A E. M. Gurari
%A H. Wechsler
%T On the difficulties involved in the
segmentation of pictures
%R 169
%I SUNY Buffalo Computer Science
%K AI0

%A M. M. Yau
%A S. N. Srihari
%T Recursive generation of hierarchical
data structures for multidimensional digital images
%R 170
%I SUNY Buffalo Computer Science
%K AI06

%A A. S. Maida
%A S. C. Shapiro
%T Intensional concepts in propositional semantic networks
%R 171
%I SUNY Buffalo Computer Science

%A S. N. Srihari
%A J. J. Hull
%A R. Bo\o'z\(hc'inovi\o'c\(aa'
%T Representation of contextual knowledge
in word recognition
%R 172
%I SUNY Buffalo Computer Science
%K AI02

%A S. C. Shapiro
%T COCCI:  a deductive semantic network
program for solving microbiology unknowns
%R 173
%I SUNY Buffalo Computer Science
%K AA10

%A J. E. S. P. Martins
%A D. P. McKay
%A S. C. Shapiro
%T Bi-directional inference
%R 174
%I SUNY Buffalo Computer Science

%A J. E. S. P. Martins
%A S. C. Shapiro
%T A belief revision system based on relevance
logic and heterarchical contexts
%R 175
%I SUNY Buffalo Computer Science

%A S. N. Srihari
%A M. E. Jernigan
%T Pattern recognition
%R 177
%I SUNY Buffalo Computer Science
%K AI06

%A K. J. Chen
%T Tradeoffs in machine inductive inference
%R 178
%I SUNY Buffalo Computer Science
%K AI04

%A J. G. Neal
%T A knowledge engineering approach to natural language understanding
%R 179
%I SUNY Buffalo Computer Science
%K AI02

%A R. K. Srihari
%T Combining path-based and node-based inference in SNePS
%R 183
%I SUNY Buffalo Computer Science

%A S. N. Srihari
%A J. J. Hull
%T Experiments in text recognition with binary
\fIn\fP-gram and Viterbi algorithms
%R 184
%I SUNY Buffalo Computer Science

%A H. Shubin
%T Inference and control in multiprocessing environments
%R 186
%I SUNY Buffalo Computer Science
%K H03

%A N. V. Findler
%T A preliminary report on a multi-level learning technique
using production systems
%R 187
%I SUNY Buffalo Computer Science
%K AI04  AI01

%A N. V. Findler
%A E. J. M. Morgado
%T Morph-fitting \- an effective technique of approximation
%R 188
%I SUNY Buffalo Computer Science
%K AI02

%A N. V. Findler
%A N. M. Mazur
%A B. B. McCall
%T A note on computing the asymptotic form of
a limited sequence of decision trees
%R 189
%I SUNY Buffalo Computer Science

%A N. V. Findler
%A J. E. Brown
%A R. Lo
%A H. Y. You
%T A module to estimate numerical values of
hidden variables for expert systems
%R 190
%I SUNY Buffalo Computer Science
%K AI01

%A S. N. Srihari
%A J. J. Hull
%A R. Choudhari
%T An algorithm for integrating
diverse knowledge sources in text recognition
%R 192
%I SUNY Buffalo Computer Science
%K AI06

%A G. L. Sicherman
%T The Advice-Taker/Inquirer
%R 193
%I SUNY Buffalo Computer Science

%A N. V. Findler
%T Toward a theory of strategies
%R 194
%I SUNY Buffalo Computer Science

%A S. Moriya
%T An algebraic structure theory
of rule sets, I: a formalization
of both production systems and decision tables
%R 195
%I SUNY Buffalo Computer Science

%A N. V. Findler
%T An overview of the Quasi-Optimizer system
%R 196
%I SUNY Buffalo Computer Science

%A N. V. Findler
%A G. L. Sicherman
%A B. B. McCall
%T A multi-strategy gaming environment
%R 197
%I SUNY Buffalo Computer Science

%A L. M. Tranchell
%T A SNePS implementation of KL-ONE
%R 198
%I SUNY Buffalo Computer Science

%A M. M. Yau
%T Generating quadtrees of cross-sections from octrees
%R 199
%I SUNY Buffalo Computer Science

%A G. L. Sicherman
%T Parsley 1.1:  A general text parser in LISP
%R 202
%I SUNY Buffalo Computer Science
%D April 1983
%X T01 AI02

%A J. E. S. P. Martins
%T Reasoning in multiple belief spaces
%R 203
%I SUNY Buffalo Computer Science
%D May 1983

%A J. T. Nutter
%T Default reasoning in A.I. systems
%R 204
%I SUNY Buffalo Computer Science
%D October 1983

%A P. F. Kung
%A S. L. Hardt
%T Understanding `Circuit Stories;' or,
Using Micro PAM to explain VLSI systems
%R 206
%I SUNY Buffalo Computer Science
%D December 1983
%K AA04

%A P. Schlossman
%A S. L. Hardt
%T Grinlib \- Grinnell graphics in Lisp
%R 207
%D 1983
%K T01

%A J. Rosenberg
%A M. E. Haefner
%A S. L. Hardt
%T Correcting and translating ill-formed ship messages
%R 208
%I SUNY Buffalo Computer Science
%D January 1984

%A P. Schlossman
%A G. K. Phillips
%A S. L. Hardt
%T A step towards a friendly psychiatric diagnosis tool
%R 209
%I SUNY Buffalo Computer Science
%D April 1984
%K AA01

%A M. E. Haefner
%A S. L. Hardt
%T Developing a knowledge-based psychiatric
diagnostic tool: The investigation of opportunistic processing
%R 210
%I SUNY Buffalo Computer Science
%D February 1984
%K AA01

%A S. L. Hardt
%T Naive physics and the physics of diffusion; or, When intuition fails
%R 211
%I SUNY Buffalo Computer Science
%D June 1984
%X AA16

%A M. Y. Lo
%A S. L. Hardt
%T From CD to mandarin Chinese: The language generation project
%R 212
%I SUNY Buffalo Computer Science
%D August 1984
%X The investigation reported here is centered on
the development of the Chinese language generator, SINO-MUMBLES.
This natural language generator takes as input a CD expression
and expresses its meaning in Mandarin Chinese.
The program is based on the English generator, MICRO-MUMBLE
and on an earlier version of the Chinese generator developed
in our project.

%A J. G. Neal
%A S. C. Shapiro
%T Knowledge based parsing
%R 213
%I SUNY Buffalo Computer Science
%D May 1984
%K AI02
%X An extremely significant feature of any Natural Language (NL)
is that it is its own meta-language.
One can use a NL to talk about the NL itself.
One can use a NL to tutor a non-native speaker, or other poor
language user, in the use of the same NL.
We have been exploring methods of knowledge
representation and NL Understanding (NLU) which would allow an
Artificial Intelligence (AI) system to play the role of
poor language user in this setting.
The AI system would have to understand NL utterances about how
the NL is used, and improve its NLU abilities according to this
instruction.
It would be an NLU system for which the domain being discusses
in NL is the NL itself.

%A J. J. Hull
%A G. Krishnan
%A P. W. Palumbo
%A S. N. Srihari
%T Optical character recognition
techniques in mail sorting: A review of algorithms
%R 214
%I SUNY Buffalo Computer Science
%D June 1984
%K AI06
%X A study of Optical Character Recognition
(OCR) techniques employed in automatic mail sorting equipment
is presented.
Methods and algorithms for image preprocessing,
character recognition, and contextual postprocessing
are discussed and compared.
The objective of this study is to provide a background
in the state-of-the-art of this equipment
as the first element in a search for techniques
to significantly improve the capabilites of postal address recognition.

%A W. J. Rapaport
%T Belief representation and quasi-indicators
%R 215
%I SUNY Buffalo Computer Science
%D August 1984
%K AI02
%X This thesis is a study in knowledge'' representation,
specifically, how to represent beliefs expressed by
sentences containing quasi-indicators.
An \fIindicator\fP is a personal or demonstrative pronoun
or adverb used to make a strictly demonstrative reference.
A \fIquasi-indicator\fP is an expression that occurs within
an intentional context and that represents a use of an indicator
by another speaker.
E.g., if John says, I am rich,'' then if \fIwe\fP say,
John believes that he himself is rich,'' our use of `he himself'
is quasi-indexical.
Quasi-indicators pose problems for natural-language
question-answering systems, since they cannot be
replaced by any co-referential noun phrases without changing
the meaning of the embedding sentence.
Therefore, the referent of the quasi-indicator must be represented
in such a way that no ivnalid co-referential claims are entailed.

%A W. J. Rapaport
%T Searle's experiments with thought
%R 216
%I SUNY Buffalo Computer Science
%D November 1984
%X A critique of several recent objections to John Searle's
Chinese Room argument against the possibility of strong AI
is presented.
The objections are found to miss the point,
and a stronger argument against Searle is presented,
based on a distinction between syntactic and semantic
understanding.

%A W. J. Rapaport
%T Review of Lambert's \fIMeinong and the
Principle of Independence\fP
%R 217
%I SUNY Buffalo Computer Science
%D November 1984
%K AI08
%X This is a critical study of Karel Lambert's
\fIMeinong and the Principle of Independence.\fP
Alexius Meinong was a turn-of-the-century philosopher
and psychologist who played a role in the early development
of analytic philosophy, phenomenology, and Gestalt psychology.
His theory of objects has become of increasing relevance
to intensionally-based semantics and, hence, ought to be
of interest to AI researchers in the field of knowledge
representation.
Lambert's book explores the relevance of Meinong's theory
to free logics.

%A R. M. Bo\o'z\(hc'inovi\o'c\(aa'
%T Recognition of off-line cursive handwriting:
A case of multi-level machine perception
%R 85-01
%I SUNY Buffalo Computer Science
%D March 1985
%K AI06
%X Cursive script recognition by computer (CSR)
is the problem of transforming language from
the form of cursive human handwriting to one of digital
text representation.
Off-line CSR involves elements of computer vision
at a low level of processing
andk those of language perception and understanding at
a higher level.
The problem is approached in this work
as a multi-level machine perception problem
in which an image of a cursive script word is transformed
through a hierarchy of representation levels.
Four distinct levels are employed,
based on descriptions that use pixels, chain codes, features
and letters, before the final
word level of representation is obtained.

%A P. B. Van\ Verth
%T A system for automatic program grading
%R 85-05
%I SUNY Buffalo Computer Science
%D May 1985
%K AA08 AA07
%X This doctoral dissertation presents an automated
system for grading program quality based upon a mathematical model
of program quality.
Our research investigates whether such a system
will perform at least as well as, and perhaps even do better than,
human graders.

%A J. G. Neal
%T A knowledge-based approach to natural language understanding
%R 85-06
%I SUNY Buffalo Computer Science
%D May 1985
%K AI01 AI02
%X In this thesis we present a language processing expert system
that we have implemented in the role of an educable cognitive
agent whose domain of expertise is language understanding
and whose discourse domain includes its own language knowledge.
We present a representation of language processing knowledge
and a core of knowledge, including a Kernel Language, which forms
the knowledge base for this AI system.

%A S. L. Hardt
%A J. Rosenberg
%A M. E. Haefner
%A K. S. Arora
%T The three ERIK\-AMVER progress reports
%R 85-07
%I SUNY Buffalo Computer Science
%D July 1985
%K AA18
%X This is a collection of three progress reports
submitted by our group
to the U. S. Coast Guard.
The reports chart the development of the ERIK
(Evaluating Reports using Integrated Knowledge) system.
The systems design and implementation were orchestrated
by Jay Rosenberg.
The final report as well as the manuals for the system
can be found elsewhere.

%A S. L. Hardt
%A J. Rosenberg
%T The ERIK project: Final report and manuals
%R 85-08
%I SUNY Buffalo Computer Science
%D July 1985
%K AA18 H02
%X The ERIK system is a computer program
that was developed to interpret ship reports for the
United States Coast Guard.
The system is now completed an installed in the Coast Guard's
AMVER Center on Governors Island.
It was running in a testing mode on a dedicated DEC VAX-11/730
system running VMS, from February to June 1985.
The final system will be running on a Symbolics Lisp Machine
in July 1985.
This report provides a brief description of the project, the system,
and user manuals.
The latter contains a detailed description of the theory
behind the system and the necessary
implementation and maintenance information.

%A S. N. Srihari
%A J. J. Hull
%A P. W. Palumbo
%A D. Niyogi
%A C. H. Wang
%T Address recognition techniques in mail sorting:
Research directions
%R 85-09
%I SUNY Buffalo Computer Science
%D August 1985
%K AI06 AI02
%X This report is a discussion of techniques of computer vision,
pattern recognition, and language processing
relevant to the problem of mail sorting as well as a presentation of the results
of preliminary experiments with several new techniques applied
to letter mail images.

%A Gyungho Lee
%A Clyde P. Kruskal
%A David J. Kuck
%T An Empirical Study of Automatic Restructuring of Nonnumerical Programs
for Parallel Processors
%J IEEE Transactions on Computers
%V C-34
%N 10
%D October 1985
%P 927-933
%K H03

%A W. Daniel Hillis
%T The Connection Machine
%I MIT Press
%D 1985
%K H03 AT15
%X $22.50 ISBN 08157-1 175 pages

%A Richard P. Gabriel
%T Performance and Evaluation of Lisp Machines
%I MIT Press
%D 1985
%K T01 H02 AT15
%X $22.50 ISBN 07093-6 350 pages

%A Michael J. O'Donnell
%T Equational Logic as a Programming Language
%I MIT Press
%D 1985
%K AI10 AT15
%X $25.00 ISBN  15028-X 300 pages

%A Ehud Y. Shapiro
%T Algorithmic Programming Debugging
%I MIT Press
%D 1983
%K T02 AT15
%X $35.00 ISBN 19218-7 232 pages

%A Marc H. Raibert
%T Legged Robots That Balance
%I MIT Press
%D 1985
%K AT15 AI07
%X $30.00 ISBN 18117-7 250 pages

%A Matthew T. Mason
%A J. Kenneth Salisbury,\ Jr.
%T Robot Hands and the Mechanics of Manipulation
%I MIT Press
%D 1985
%K AT15 AI07
%X $30.00 ISBN 13205-2 325 pages

%A A. Morecki
%A G. Bianchi
%A K. Kedzior
%T Theory and Practice of Robots and Manipulators
%I MIT Press
%D 1985
%K AT15 AI07
%X $45.00 ISBN 13208-7

%A Richard P. Paul
%T Robot Manipulators: Mathematics, Programming, and Control
%I MIT Press
%D 1981
%K AT15 AI07
%X $34.50 ISBN 16082-X 279 pages

%A Hideo Hanafusa
%A Hirochika Inoue
%T Robotics Research: The Second International Symposium
%I MIT Press
%D 1985
%K AT15 AI07
%X $45.00 ISBN 08151-2 500 pages

%A Michael Brady
%A Richard Paul
%T Robotics Research: The First International Symposium
%I MIT Press
%D 1984
%K AT15 AI07
%X $65.00 ISBN 02207-9 1000 pages

%A James U. Korein
%T A Geometric Investigation of Reach
%I MIT Press
%D 1985
%K AT15 AI07
%X $30.00 ISBN 11104-7 210 pages

%A Michael Brady
%A John M. Hollerbach
%A Timothy L. Johnson
%A Thomas Lozano-Perez
%A Matthew T. Mason
%T Robot Motion: Planning and Control
%I MIT Press
%D 1983
%K AT15 AI07 AI09
%X 585 pages $39.50 ISBN 02182-X

%A Robert Berwick
%T The Acquisition of Syntactic Knowledge
%I MIT Press
%D 1985
%K AT15 AI02
%X 350 pages $27.50 ISBN 02226-5

%A Michael G. Dyer
%T In-Depth Understanding:
A Computer Model of Integrated Processing for Narrative Comprehension
%I MIT Press
%D 1983
%K AT15 AI02 AI08
%X ISBN 04073-5 458 pages $37.50

%A Mitchell P. Marcus
%T A Theory of Syntactic Recognition for Natural Language
%I MIT Press
%D 1980
%K AI02 AT15
%X ISBN 13149-8 335 pages $35.00

%A Henry S. Baird
%T Model-Based Image Matching Using Location
%I MIT Press
%D 1985
%K AI06 AT15
%X ISBN 02220-6 $25.00 115 pages

%A Harold Abelson
%A Gerald Jay Sussman
%T Structure and Interpretation of Computer Programs
%I MIT Press
%D 1984
%K Scheme T01 AT15
%X ISBN 01077-1 542 pages $34.95

%A Scott E. Fahlman
%T NETL: A System for Representing and Using Real-World Knowledge
%I MIT Press
%D 1979
%K H03 AT15
%X ISBN 06069-8 278 pages $27.50

%A Ellen Catherine Hildreth
%T Measurement of Visual Motion
%I MIT Press
%D 1984
%K AT15 AI06
%X ISBN 08143-1  241 pages $32.50

%A Herbert A. Simon
%T The Sciences of the Artificial
%I MIT Press
%D 1981
%K AT15
%X ISBN 69073-X 247 pages $6.95 paper

%A Michael Brady
%A Robert C. Berwick
%T Computational Models of Discourse
%I MIT Press
%D 1983
%K AI02 AT15
%X ISBN 02183-8 $37.50 403 pages

%A Marvin L. Minsky
%T Semantic Information Processing
%I MIT Press
%D 1969
%K AT15
%X ISBN 13044-0 $35.00 440 pages

%A Eric Leifur Grimson
%T From Images to Surfaces: A Computational STudy of the Human
Early Visual System
%I MIT Press
%D 1981
%K AT15 AI06 AI08
%X ISBN 07083-9 274 pages $35.00

%A Shimonn Ullman
%T The Interpretation of Visual Motion
%I MIT Press
%D 1979
%K AT15 AI06
%X ISBN 21007-4 229 pages $30.00

%A John Haugeland
%T Mind Design: Philosophy, Psychology, Artificial Intelligence
%I MIT Press
%D 1981
%K AT15 AI08
%X ISBN 58052-7 368 pages $10.95  paper

%A Daniel C. Dennet
%T Brainstorms: Philosophical Essays on Mind and Psychology
%I MIT Press
%D 1980
%K AT15 AI08
%X 353 pages ISBN 54037-1 $10.00 paper
Cloth: $30.00 ISBN 04064-6

%A Zenon W. Pylyshyn
%T Computation and Cognition: Toward a Foundation for Cognitive Science
%I MIT Press
%D 1984
%K AI08 AT15
%X 320 pages $27.50 ISBN 16098-6

%A D. Bobrow
%T Qualitative Reasoning about Physical Systems - An Introduction
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4
%K AA16

%A J. de Kleer
%A J. Seely Brown
%T A Qualitative Physics Based on Confluences
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4
%K AA16

%A K. Forbus
%T Qualitative Process Theory
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4

%A B. Kuipers
%T Common Sense Reasoning about Causality: Deriving Behavior From Structure
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4

%A J. de Kleer
%T How Circuits Work
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4
%K AA04

%A B. C. Williams
%T Qualitative Analysis of MOS Circuits
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4
%K AA04

%A R. Davis
%T Diagnostic Reasoning Based on Structure and Behavior
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4

%A M. R. Genesereth
%T The Use of Design Descriptions in Automated Diagnosis
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4

%A H. Barrow
%T VERIFY: A Program for Proving Correctness of Digital
Hardware Designs
Qualitative Reasoning about Physical Systems
%E Daniel G. Bobrow
%D 1985
%I MIT PRESS
%X 504 pages $$232.50 ISBN 02218-4
%K AA04

%A Rachel Reichman
%T Getting Computers to Talk Like You and Me:
Discourse Context, Focus and Semantics
%I MIT PRESS
%D 1985
%X 144 pages $20.00 ISBN 18118-5

%A Steven Pinker
%T Visual Cognition: An Introduction
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A D. D. Hoffman
%A W. A. Richards
%T Parts of Recognition
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A Shimon Ullman
%T Visual Routines
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A Roger Shepard
%A Shelley Hurwitz
%T Upward Direction, Mentasl Rotation, and Discrimination of Left and Right
Turs in Maps
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A Stephen M. Kosslyn
%A Jennifer Brunn
%A Kyle R. Cave
%A Roger W. Wallach
%T Individual Differences in Mental Imagery: A Computational Analysis
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A Martha J. Farah
%T The Neurological Basis of Mental Imagery: A Computational Analysis
Visual Cognition
%E Steven Pinker
%D 1985
%I MIT PRESS
%X 296 pages $17.50 paper ISBN 16103-6
%K AI06 AI08

%A Jon Barwise
%A John Perry
%T Situations and Attitudes
%I MIT PRESS
%D 1983
%K AI02 AI11 AI08
%X 352 pages $9.95 paper ISBN 52099-0  Cloth $27.50 $27.50 ISBN 02189-7

%A N. Fuhr
%A G. E. Knorz
%T Retrieval Test Evaluation of a Rule Based Automatic Indexing
(AIR/PHYS)
%B Proceedings of the Third Joint BCS and ACM Symposium
%E C. J. van Rijsbergen
%I Cambridge University Press
%D 1984
%K AI01 AA14

%A W. S. Cooper
%T Bridging the Gap between AI and IR
%B Proceedings of the Third Joint BCS and ACM Symposium
%E C. J. van Rijsbergen
%I Cambridge University Press
%D 1984
%K AI01 AA14

%A Richard L. Derr
%T Linguistic Meaning and Language Comprehension
%J Information Processing and Management
%V 19
%N 6
%D 1983
%P 369-380
%K AI02

%A John O'Connor
%T Biomedical Citing Statements Computer Recognition and Use to Aid Full-Text Re
trieval
%J Information Processing and Management
%V 19
%N 6
%D 1983
%P 361-368
%K AI02 AI14

%A Martin Dillon
%A Laura K. McDonald
%T Fully Automatic Book Indexing
%J Journal of Documentation
%V 39
%N 3
%D 1983
%P 135-154
%K AI02 AI14

%A M. R. Cutkowsky
%A P. K. Wright
%T Active Control  of a Compliant Wrist in Manufacturing Tasks
%R ASME Paper Number 850WA/Prod-15
%D 1985
%K AA05 AA07

%A Tony Owen
%T Assembly With Robots
%I Prentice Hall
%C Englewood Cliffs
%D 1985
%K AI07 AA05
%X $29.95

%A J. D. Gould
%A J. Conti
%A T. Hovanyecz
%T Composing Letters with a Simulated Listening Typewriter
%J Communications of the ACM
%V 26
%N 4
%D 1983
%P 295-308
%K AI05

%T Intelligent Robots and Computer Vision
%E David P. Casasent
%N 579
%I SPIE -- The International Society for Optical Engineering
%C Cambridge, MA
%D September 16-20, 1985
%K AT15 AI07 AI06

%A David Nitzan
%T Development of Intelligent Robots: Achievements and Issues
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07

%A Ray Basey
%T Training for the Introduction of Robots New Technology and Control Systems,
Operation and Maintenance
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07 AT18

%A H. H. Rosenbrook
%T Social and Engineering Design of a Flexible Manufacturing System
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07 AA05 O05

%A Igor Aleksander
%T Extension of Robot Capabilities Through Artificial Vision: A Look into
the Future
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07 AI06

%T The World Directory of Robotics and Development Activities
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07 AT19
%X info on robotics research in 26 countries, list of groups

%T A Guide to Grant Awarding Bodies
%B The World Yearbook of Robotics Research and Development, 1985
%I Gale Research Corporation
%D 1985
%K AI07 AT19

%A Phillippe Coiffet
%T Robot Technology: Modeling and Control
%V 1
%I Prentice-Hall
%D 1982
%K AI07 AT15

%A Philippe Coiffet
%T Robot Technology: Interaction with the Environment
%V 2
%I Prentice-Hall
%D 1983
%K AI07 AT15

%A Jean Vertut
%A Philippe Coiffet
%T Robot Technology: Teleoperation and Robotics: Evolution and Development
%V 3A
%I Prentice-Hall
%D 1986
%K AI07 AT15 AT20

%A Jean Vertut
%A Philippe Coiffet
%T Teleoperations and Robotics: Applications and Technology
%V 3B
%I Prentice-Hall
%D 1985
%K AI07 AT15

%A F. L. Hote
%T Robot Components
%V 4
%I Prentice-Hall
%D 1983
%K AI07 AT15

%A Michel Parent
%A Claude Laureau
%T Robot Technology: Logic and Programming
%V 5
%I Prentice-Hall
%D 1985
%K AI07 AT15

%T Robot Technology: Decision and Intelligence
%V 6
%I Prentice-Hall
%D (not yet published)
%K AI07 AT15

%A Alain Liegeois
%T Robot Technology: Performance and Computer-Aided Design
%V 7
%I Prentice-Hall
%D 1985
%K AI07 AT15 AA05

%A John Haugeland
%T Artificial Intelligence: The Very Idea, 1985
%I MIT  Press
%D 1985
%K AT15

%A H. J. De Man
%A I. Bolsens
%A E. vanden Meersch
%A J. van Cleynenbreugel
%T DIALOG: An Expert Debugging System for MOS VLSI Design
%J IEEE Transactions on Computer-Aided Design
%V CAD-4
%N 3
%D JULY 1985
%P 303-311
%K AI01 AA04

%A Michael A. Rosenman
%A John S. Gero
%T Design Codes as Expert Systems
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 399-409
%K AA05 AI01

%A Hitoshi Furuta
%A King-Sun Tu
%A James T. P. Yao
%T Structural Engineering Applications of Expert Systems
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 410-19
%K AA05 AI01

%A Mary Lou Maher
%T HI-RISE and Beyond: Directions for Expert Systems in Design
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 420-427
%K AA05 AI01

%A A. D. Radford
%A J. S. Gero
%T Towards Generative Expert Systems for Architectural Detailing
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 428-435
%K AA05 AI01

%A David C. Brown
%T Failure Handling in A Design Expert System
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 436-442
%K AA05 AI01

%A Daniel R. Rehak
%A H. Craig Howard
%T INterfacing Expert Systems with Design Databases in Integrated
CAD Systems
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 443-454
%K AA05 AI01

%A Anna Hart
%T Knowledge Elicitation: Issues and Methods
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 455-462

%A John S. Gero
%T Bibliography of Books on Artificial Intelligence with
Particular Reference to Expert Systems and Knowledge Engineering
%J Computer-Aided Design
%V 17
%N 9
%D November 1985
%P 463-464
%K AI01 AT09

%A D. Kapur
%A P. Narendran
%A M. S. Krishnamoorthy
%A R. McNaughton
%T The Church-Rosser Property and Special Thue Systems
%J Theoretical Computer Science
%V 39
%N 2-3
%D August 1985
%P 123-134
%K AI14

%A C. Bohm
%A A. Berarducci
%T Autoamtic Snythesis of Type Lambda-Programs on Term Algebras
%J Theoretical Computer Science
%V 39
%N 2-3
%D August 1985
%P 135-154
%K AI14 AA08

%A M. W. Bunder
%T An Exptension of Klop's Counterexample to the Church-Rosser Property
to Lambda-Calculus with Other Ordered Pair Combinators
%J Theoretical Computer Science
%V 39
%N 2-3
%D August 1985
%P 337
%K AI14

%A M. Rodriguez artalejo
%T Some Questions About Expessiveness and Relative Completeness in Hoare's
Logic
%J Theoretical Computer Science
%V 39
%N 2-3
%D August 1985
%P 189-206
%K AA08

%T The Functions of T and Nil in Lisp
%J Software Practice and Experience
%V 16
%N 1
%D January 1986
%P 1-4
%K T01

%A R. Milner
%T Using Algebra for Concurrency-Some Approaches
%B Analysis of Concurrent Systems
%E B. T. Denvir
%E W. T. Harwood
%E M. I. Jackson
%E M. J. Wray
%S Lecture Notes in Computer Science
%V 207
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1985
%P 7-25
%K AA08

%A H. Barringer
%A R. Kuiper
%T Towards the Hierarchical, Temproral Logic, Specification  of
Concurrent Systems
%B Analysis of Concurrent Systems
%E B. T. Denvir
%E W. T. Harwood
%E M. I. Jackson
%E M. J. Wray
%S Lecture Notes in Computer Science
%V 207
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1985
%P 157-183
%K AA08

%A R. Koymans
%A W. P. Deroever
%T Examples of a Real-Time Temporal Logic Specification
%B Analysis of Concurrent Systems
%E B. T. Denvir
%E W. T. Harwood
%E M. I. Jackson
%E M. J. Wray
%S Lecture Notes in Computer Science
%V 207
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1985
%P 231-251
%K AA08

%A V. S. Medovyy
%T Translation from a Natural Language into a Formalized Language as a
Heuristic Search Problem
%J Soviet Journal of Computer and Systems Sciences
%V 23
%N 4
%D July-August 1985
%P 1-9
%K AI02 AI03

%A M. K. Valiyev
%T On Temporal Dependencies in Databases
%J Soviet Journal of Computer and Systems Sciences
%V 23
%N 4
%D July-August 1985
%P 10-17
%K AA09

%A Z. M. Kanevskiy
%A V. P. Litvinenko
%T Minimization of the Average Duration of a Discrete Search Procedure
%J Soviet Journal of Computer and Systems Sciences
%V 23
%N 4
%D July-August 1985
%P 126-129
%K AI03

%A A. S. Yuschenko
%T The Problem of Dynamic Control of Manipulators
%J Soviet Journal of Computer and Systems Sciences
%V 23
%N 4
%D July-August 1985
%P 139
%K AI07

%A I. Vessey
%T Expertise in Debugging Computer Programs -  A Process Analysis
%J International Journal of Man-Machine Studies
%V 23
%N 5
%D November 1985
%P 459-494
%K AA08 AI08

%A J. H. Boose
%T A Knowledge Acquisition Program for Expert Systems Based on Personal
Construct Psychology
%J International Journal of Man-Machine Studies
%V 23
%N 5
%D November 1985
%P 495-526
%K AI01

%A E. J. Weiner
%T Solving the Containment Problem for Figurative Language
%J International Journal of Man-Machine Studies
%V 23
%N 5
%D November 1985
%P 527-538
%K AI02

%A R. R. Yager
%T Explantory Models in Expert Systems
%J International Journal of Man-Machine Studies
%V 23
%N 5
%D November 1985
%P 539-550
%K AI01

%A T. Munakata
%T Knowledge-Based Systems for Genetics
%J International Journal of Man-Machine Studies
%V 23
%N 5
%D November 1985
%P 551-562
%K AI01 AA10

%A Ronald R. Yager
%T On the Relationship of Methods of Aggregating Evidence in Expert Systems
%J Cybernetics and Systems
%V 16
%N 1
%D 1985
%P 1-22
%K AI01

%A Ronald R. Yager
%T Strong Truth and Rules of INference in Fuzzy Logic and
Approximate Reasoning
%J Cybernetics and Systems
%V 16
%N 1
%D 1985
%P 23-64
%K AI01 O04

%A Witold Pedrycz
%T Structured Fuzzy Models
%J Cybernetics and Systems
%V 16
%N 1
%D 1985
%P 103
%K O04