%A Yves Lesperance
%T Toward a Computational Interpretation
of Situation Semantics
%J Computational Intelligence
%V 2
%N 1
%D February 1986
%K AI16 AI02
%X Situation semantics proposes novel and attractive treatments for several
problem areas of natural language semantics, such as efficiency (context
sensitivity) and propositional attitude reports. Its focus on the information
carried by utterances makes the approach very promising for accounting for
pragmatic phenomena. However, situation semantics seems to oppose several
basic assumptions underlying current approaches to natural language processing
and the design of intelligent systems in general. It claims that efficiency
undermines the standard notions of logical form, entailment, and proof theory,
and objects to the view that mental processes necessarily involve internal
representations. The paper attempts to clarify these issues and discusses
the impact of situation semantics' criticisms for natural language processing,
knowledge representation, and reasoning. We claim that the representational
approach is the only practical one for the design of large intelligent systems,
but argue that the representations used should be efficient in order to account
for the systems embedding in its environment. We conclude by stating some
constraints that a computational interpretation of situation semantics should
obey and discussing remaining problems.

%A Ethel Schuster
%T The Role of Native Grammars in
Correcting Errors in Second Language Learning
%J Computational Intelligence
%V 2
%N 2
%D May 1986
%K AI02 AA07
%X
.ds VP \s-1VP\s0\*([.2\*(.]
This paper describes, \(*VP, a system that has been implemented to
tutor non-native speakers in English. This system differs from many tutoring
systems by employing an explicit grammar of its user's native language.
This grammar enables \*(VP to customize its responses by addressing
problems due to interference of the native language. The system focuses on the
acquisition of English verb-particle and verb-prepositional phrase
constructions.	Its correction strategy is based upon comparison of the native
language grammar with an English grammar. \*(VP is a modular system: its
grammar of a user's native language can be easily replaced by a grammar of
another language. The problems and solutions presented in this paper are
related to the more general question of how modeling previous knowledge
facilitates instruction in a new skill.

%A Donald R. Gentner
%T \s-1COACH\s0: A Tutor Based on Active Schemas
%J Computational Intelligence
%V 2
%N 2
%D May 1986
%K AA07
%X
The \s-1COACH\s0 system, a computer simulation of a human tutor, was
constructed with the goal of obtaining a better understanding of how a tutor
interprets the student's behavior, diagnoses difficulties, and gives advice.
\s-1COACH\s0 gives advice to a student who is learning a simple computer
programming language. Its intelligence is based on a hierarchy of active
schemas that represent the tutor's general concepts, and on more specific
information represented in a semantic network.	The coordination of
conceptually-guided and data-driven processing enables \s-1COACH\s0 to
interpret student behavior, recognize errors, and give advice to the student.

%A Alan M. Hofmeister
%T Formative Evaluation in the
Development and Validation of
Expert Systems in Education
%J Computational Intelligence
%V 2
%N 2
%D May 1986
%K AA07
%X
Researchers developing and validating educational products often expect
the same field-test activities to provide information on product improvement
and product effectiveness. For effective and economical use of resources,
these two goals, product improvement and product validation, must be stressed
at different times and with different tools and strategies. This article
identifies the difference in procedures and outcome between formative and
summative evaluation practices, and relates these practices to the development
and validation of expert systems in education.

%A Gordon McCalla
%A Richard Bunt
%A Janelle Harms
%T The Design of the \s-1SCENT\s0 Automated Advisor
%K AA07 T01 AT18
%X
The \s-1SCENT\s0 (Student Computing Environment) project is concerned with
building an intelligent tutoring system to help students debug their Lisp
programs. The major thrust of current \s-1SCENT\s0 investigations is into the
design of the \s-1SCENT\s0 advisor which is meant to provide debugging
assistance to novice students.	Six conceptual levels constitute the advisor.
At the lowest level is the raw data'', consisting of the students (possibly
buggy) program. This can be interpreted by a program behaviour'' level which
can produce traces, cross-reference charts, etc., from the student's program.
These traces, etc., can be analyzed by observers'' for interesting patterns.
At the next level are strategy judges'' and diagnosticians'' which
determine which strategy the student has used in his or her program and bugs
in this strategy. A task expert'' provides task-specific input into the
process of analyzing the student's solution, and a student knowledge
component'' provides student-specific input into this process. Information
from the six levels interacts in a variety of ways and control is similarly
heterarchical.	This necessitates a blackboard-style scheme to coordinate
information dissemination and control flow.

%A J.I. Glasgow
%A L.J. Hendren
%A M.A. Jenkins
%T A Programming Language
for Learning Environments
%J Computational Intelligence
%V 2
%N 2
%D May 1986
%X
Most of the recent research on programming languages for education has been
centered around the language Logo. In this paper we introduce another
candidate language for learning environments, Nial, the nested interactive
array language.
.LP
Nial is a general-purpose programming language based on a formal theory of
mathematics called array theory. This paper introduces Nial as a language for
learning programming and developing and using computer-aided instruction tools.
A comparison with Logo is provided to evaluate these two languages in terms
of their strengths and weaknesses as programming environments for novice
programmers. We also demonstrate that a programming environment can be both
simple to learn at the novice level and extendible to a powerful and
sophisticated language.

%A Odile Palies
%A Michel Caillot,
%A Evelyne Cauzinille-Marmeche,
%A Jean-Louis Lauriere
%A Jacques Mathieu
%T Student Modelling by an Expert System
in an Intelligent Tutoring System
%J Computational Intelligence
%V 2
%N 2
%D May 1986
%K Electre AA04 AA07
%X
\s-1ELECTRE\s0 is a project to build an intelligent tutoring system for
teaching basic electricity. This paper describes a student modeling based on
the student's cognitive processes. This model includes for each student,
his or her domain knowledge and the specific heuristics as well. Moreover, it
uses meta-knowledge of problem solving. This model is simulated by a
knowledge base	which controls the solving processes by meta-rules. A case
study is presented.

%A Vasant Dhar
%T Using knowledge generated in heuristic search
for non-chronological backtracking
%J Computational Intelligence
%V 2
%N 3
%D August 1986
%K AI03
%X Problem solvers that use heuristics to guide choices often run into untenable
situations that can be characterized as over-constrained. When this happens,
the problem must be able to identify the right culprit from along its heuristic
choices in order to avoid a potentially explosive search. In this paper, we
present a solution to this for a certain class of problems where the
justifications associated with choice points involve an explicit assessment of
the pros and cons of choosing each alternative relative to its competitors. We
have designed a problem solver that accumulates such knowledge about the pros
and cons of alternative selections at choice points during heuristic search,
which it updates in light of an evolving problem situation. Whenever untenable
situations arise, this preserved knowledge is used in order to determine the
most appropriate backtracking point. By endowing the backtracker with access
to this domain-specific knowledge, a highly contextual approach to reasoning in
backtracking situations can be achieved.

%A Anita M. Flynn
%A John G. Harris
%T Recognition algorithms
for the Connection Machine\*(TM
%J Computational Intelligence
%V 2
%N 3
%D August 1986
%K H03 AI03 AI06
%X This paper describes an object recognition algorithm both on a sequential
machine and on a SIMD parallel processor such as the MIT Connection Machine.
The problem, in the way it is presently formulated on a sequential machine, is
essentially a propagation of constraints through a tree of possibilities in an
attempt to prune the tree to a small number of leaves.	The tree can become
excessively large, however, and so implementations on massively parallel
machines are sought in order to speed up the problem. Two fast parallel
algorithms are described here.
.br
A static algorithm reformulates the problem by assigning every leaf in the
completely expanded unpruned tree to a separate processor in the Connection
Machine. Then pruning is done in nearly constant time by broadcasting
constraints to the entire SIMD array. This parallel version is shown to run
three to four orders of magnitude faster than the sequential version. For
large recognition problems which would exceed the capacity of the machine, a
dynamic algorithm is described which performs a series of loading and pruning
steps, dynamically allocating and deallocating processors through the use of
the Connection Machine's global router communications mechanism.

%A Alan M. Frisch
%T Parsing with restricted quantification:
An initial demonstration
%J Computational Intelligence
%V 2
%N 3
%D August 1986
%K AI03 AI02
%X The primary goal of this paper is to illustrate how smaller deductive search
spaces can be obtained by extending a logical language with restricted
quantification and tailoring an interface system to this extension. The
illustration examines the search spaces for a bottom-up parse of a sentence
with a series of four strongly equivalent grammars. The grammars are stated in
logical languages of increasing expressiveness, each restatement resulting in a
more concise grammar and a smaller search space.
.sp
A secondary goal is to point out an area where further research could
yield results useful to the design of efficient parsers, particularly for
grammatical formalisms that rely heavily on feature systems.

%A Leon Sterling
%A Marucha Lalee
%T An explanation shell for expert systems
%J Computational Intelligence
%V 2
%N 3
%D August 1986
%K T02 T03 AI01
%X We describe a shell for expert systems written in Prolog. The shell provides
 a
consultation environment and a range of explanation capabilities. The design
of the shell is modular, making it very easy to extend the shell with extra
features required by a particular expert system. The novelty of the shell is
twofold. Firstly it has a uniform design consisting of an integrated
collection of meta-interpreters. Secondly, there is a new approach for
explaining `why not', when a query to the system fails.

%A Lisa L. Spiegelman
%T Object-Oriented Programming Language to Employ Windows Operating Environment
%J Infoworld
%V 8
%N 40
%D October 6, 1986
%P 10
%K H01 AT02
%X Actor is available from White Water Group for $495.00.
It is an object oriented programming language using exchange of information
between windows in Microsoft's Window environment. It is allegedly for
AI developers.

%A Priscilla M. Chabal
%T Extension Enables Image-Pro to Work In Protected Mode on 286 Machines
%J Infoworld
%V 8
%N 40
%D October 6, 1986
%P 31
%K AI06 H01 AT02
%X Image-Pro, an image processing software package for the IBM-PC, can
now make use of more than 640 K on 286 based computers.

%A David Bright
%T John Blankenbaker: Inventor of Kenbak-I
%J ComputerWorld
%V 20
%N 44
%D November 3, 1986
%P 173
%K H02
%X Biography of the designer of the production version of the Symbolics LISP mac
hine.
He also developed a $750.00 personal computer in 1971 but only sold
48 of them. It used several chips for the CPU. He also worked at Quotron.

%A Alan Alper
%T Researchers Focus on Promise of Eye-Gaze Technology
%J ComputerWorld
%V 20
%N 44
%D November 3, 1986
%K O01
%X discussion of the use of technology to read where the eye is looking to contr
ol
computers. Sentinent is selling a $3000.00 eye project c
IBM has a patent for an eye-tracking mechanism that was accurate
enough to control a computer.
Analytics is developing eye-gaze technology
to use in concert with voice recognition. They are accurate to less than
1 degree of arc.
They are also looking into the possibility of reading
a magnetoencephlograph for the same control purpose.

%A A. Terry Bahill
%A Wiliam R. Ferrell
%T Teaching an Introductory Course in Expert Systems
%J IEEE Expert
%V 1
%N 4
%D Winter 1986
%P 59-63
%K AA01 AT18
%X Lists various projects that students completed. One of the
most interesting was an autology expert system that was rated by a
real speech expert. The speech expert stated that the system had
correct rules but she could see what books she got them from.
It did give her insight in teaching methods and to what she was
actually doing.
It turned out that the students interviewed a resident rather than
a true \fIexpert\fR. The system used MI the MIT videotapes, the
M.1 shell instructor's package and lecture notes. The course
was rated very good on student evaluations.

%T Medical Applications
%J IEEE Expert
%V 1
%N 4
%D Winter 1986
%P 10-14
%K mycin puff emycin oncocin Cadeucius AI01 AA01 H01 Referee AI01 AA02 AA10 AI04
Rulemaster
%X Caduceus (used to be Internist) now proves more accurate than the average
physician, comparable to teams of physician and almost as good as expert
physicians asked to review the case in retrospect. Oncocin now is
comparable relative to physicians treating patients at Stanford.
Referee is being developed to help physicians judge medical studies.
Also being developed is an expert system for nuclear magnetic resonance
in determining protein molecule structures. The system is unusual in
that experts are not very good at this either.
.sp 1
Cedars-Sinai medical researchers are developing a system for
assisting cardiologists. The system is being developed from examples
using Radian.

%A Joseph Urban
%T Building Intelligence into Software Tools
%J IEEE Expert
%V 1
%N 4
%D Winter 1986
%P 21
%K AA08 AI01
%X intro to special issue on software engineering applications of expert
systems

%A I. Zulkerman
%A W. Tsai
%A D. Volovik
%T Expert Systems and Software Engineering: Ready for Marriage?
%J IEEE Expert
%V 1
%N 4
%D Winter 1986
%P 24-31
%K AA08 AI01
%X this article consisted of a summary of expert system technologies,
software engineering technologies. There was little
material in this article relating how to apply AI tools to software
engineering.

%A Mitchell D. Lubars
%A Mehdi T. Harandi
%T Intelligent Support for Software Specification and Design
%J IEEE Expert
%V 1
%N 4
%D Winter 1986
%P 33-41
%K AA08
%X describes a system to help develop dataflow diagrams (these are used
by many designers for specifying software systems).
It finds subparts to put into the system to perform various tasks
similar to the way KBEmacs finds pieces of code to instantiate
for various needs the user has. The system is integrated into
the Polylith system for configuration complicated software systems
and dataflow diagram analysis tools. The system has been working
on smaller examples.

%A Martin Herbert
%A Curt Hartog
%T MIS Rates the Issues
%J Datamation
%V NOV 15
%V 192
%N 32
%K AA06
%X reports result of surveying the MIS managers for Fortune 1000 companies.
They were asked to rank various issues ranging from 1 (unimportant) to
4 (most important). "Expert systems and Artificial Intelligence" was
rated the lowerst 2.21. To put this in perspective, here are some other
ratings:
.br
CIM, 2.25, Strategic Systems 2.42, Aligning MIS with Business Goals, 3.54,
'Telecommunications 3.17.

%T Parallel Processing Startup will Take on the Big Players
%J Electronic News
%V 59
%N 35
%D November 13, 1986
%P 21
%K AT02 H03 Dado Columbia tree
%X The Dado, a tree structure architecture, implemented at Columbia University
is being developed by a startup company. It consists of 16 to 64 68020
processors and will cost $90,000. It will work as an accelerator
in conjunction with a SUN work station.

%T Low-cost Camera Converts Photos to PC Images
%J Electronic News
%V 59
%N 35
%D November 13, 1986
%P 25
%K AI06 AT02
%X a $1200 camera that converts color images to digital data in a PC
is available from Ulie Research Labs.

%A Charles Cohen
%T Sensor Lets Robots Do Top-Quality Arc Welding
%J Electronic News
%V 59
%N 35
%D November 13, 1986
%P 43-45
%K AA26 AI06 AI07
%X describes new vision sensor for robots doing arc welding.

%T Integrated Artificial Intelligence System Tackles Newspaper Pagination
Challenge
%J Insight
%V 6
%N 9
%D November 1986
%P 3-5
%K AI01 H03 Composition Systems AI02
%X Description of Composition Systems commercial AI driven newspaper
layout system. The system consists of three cooperating modules
which can be bought separately or combined with the use of META to
resolve conflicts. The system allows natural language questions to
find out policies for newspaper layout that were previously entered
or to find the status of particular pages. The sytem allows automatic
entry of adds by customers with personal computers. Some of the policies
implemented are attempting to insure that coupons are not backed by
important material.

%A Jesse Victor
%T ANSI Display Management Aids Real-Time Imaging
%J Mini-Micro Systems
%V 19
%N 13
%D November 1986
%P 43-47
%K AT02 AI06 H01 datacube University of Lowell
Georges Grinstein
%X Datacube sells an ANSI display system standard system.
It supports 512 by 512 pixel systems. The system costs
$9000.00 dollars. It is anticipated that the software
will include a natural language interface, expert system
tools.

%A H. A. Simon
%T Whether Software Engineering Needs to be Artificially Intelligent
%J IEEE Transactions on Software Engineering
%V SE-12
%N 7
%D July 1986
%P 726-732
%K AA08 AT14

%A Allen T. Goldberg
%T Knowledge-Based Programming: A Survey of Program Design and Construction
Techniques
%J IEEE Transactions on Software Engineering
%V SE-12
%N 7
%D July 1986
%P 752-768
%K AT08 AA08

%A Priscilla M. Chabal
%T Firm Announces Expert System Environment for IBM RT Workstation
%J InfoWorld
%V 8
%N 39
%D September 29, 1986
%P 24
%K T01 AT02 H01
%X The GURU expert system is available for the IBM RT for
$17000.

%A Hank Bannister
%T Borland Introduces Turbo Prolog, Version 1.1
%J InfoWorld
%V 8
%N 39
%D September 29, 1986
%P 3
%K AT02 H01 T03 T02 AI02
%X Borland introduced Version 1.1 which adds speed improvements
to the compiler, interface to other languages, a natural language
parser and a sample expert system shell

%A Steven Burke
%T Lotus to Release Its Long-Awaited Human Language Add-on October 6
%J InfoWorld
%V 8
%N 39
%D September 29, 1986
%P 12
%K AT02 H01 AI02 AA15
%X Hal will be released on October 6 from Lotus which
is a natural language interface to Lotus 1-2-3

%A Ninamary Buba Maginnis
%T Publishers Await System
%J ComputerWorld
%V 20
%N 45
%D November 10, 1986
%P 19+
%K AT02 AI01 Composition Systems newspaper AA20
%X Describes an expert publishing system from Composition
systems which sells for $600,000 to $2,000,000 depending
upon the size of the newspaper.
.sp 1
Also describes Michael Stock who is the leader of the
effort. He plans to work in process control and is
a self-described workaholic. He plans to work in
process control expert systems including systems that
work with several loops at a time.

%A D. W. Murray
%A A. Kashko
%A H. Buxton
%T A Parallel Approach to the Picture Restoration Algorithm of
Geman and Geman on an SIMD Machine
%J Image and Vision Computing
%V 4
%N 3
%D August 1986
%P 133-142
%K AI06 H03

%A M. A. Sutton
%A Mingqi Cheng
%A W. H. Peters
%A Y. J. Chao
%A S. R. McNeill
%T Application of an Optimized Digital Correlation Method to Planar Deformation
Analysis
%J Image and Vision Computing
%V 4
%N 3
%D August 1986
%P 143-150
%K AI06

%A H. S. Ranganath
%T Hardware Implementation of Image Registration Algorithms
%J Image and Vision Computing
%V 4
%N 3
%D August 1986
%P 151-158
%K AI06

%A J. R. T. Lewis
%A T. Sopwith
%T Three-dimensional Surface Measurement by Microcomputer
%J Image and Vision Computing
%V 4
%N 3
%D August 1986
%P 159-166
%K AI06 H01

%A S. Sitharama Iyengar
%A Stephan W. Miller
%T Efficient Algorithm for Polygon Overlay for Dense Map Image Data Sets
%J Image and Vision Computing
%V 4
%N 3
%D August 1986
%P 167
%K AI06 O06

%A Ron Bauman
%A Tom A. Turano
%T Production Based Language Simulation of Petri Nets
%J Simulation
%V 47
%N 5
%D November 1986
%P 191-198
%K AA08 AI01

%A P. Dubois
%T Artificial Intelligence and Living Logic (French)
%J Cybernetica
%V 29
%N 3
%D 1986
%P 175-192
%K AI16

%A Sabah U. Randhawa
%A William J. Barton Jr.
%A Salahuddin Faruqui
%T Wavesolder Assistant: An Expert System to Aid Troubleshooting of the
Wave Soldering Process
%J Computers and Industrial Engineering
%V 10
%N 4
%P 325-334
%K AA26 AA05

%A Martien J. Quaak
%A Frans Westerman
%A Jan A. Schouten
%A Arie Hasman
%A Jan H. van Bemmel
%T Appraisal of Computerized Medical Histories: Comparisons between
Computerized and Conventional Records
%J Computers and Biomedical Research
%V 19
%N 6
%D December 1986
%P 551-564
%K AA01

%A Lawrence O. Hall
%A Sue Szabo
%A Abraham Kandel
%T On the Derivation of Memberships for Fuzzy Sets in Expert Systems
%J Information Sciences
%V 40
%N 1
%D November 1986
%P 39-52
%K AI01 O04

%A R. A. Aliyev
%A A. E. Tserkovnyy
%T An Intelligent Robot for Quality Estimation and Sorting of Components
for Automated Quality Control
%J Soviet Journal of Computer and Systems Sciences
%V 24
%N 3
%D May-June 1986
%P 113-119
%K AI07

%A D. A. Pospelov
%A I. Ya. Sil'dmyae
%T Role Structures in the in the Representation of Knowledge and in
Interactive Systems
%J Soviet Journal of Computer and Systems Sciences
%V 24
%N 3
%D May-June 1986
%P 53-58
%K AI16

%A A. P. Guminskiy
%A V. V. Martynov
%T Construction and Implementation of a Scheduling Algorithm in a Calculus
Based on Universal Semantic Code
%J Soviet Journal of Computer and Systems Sciences
%V 24
%N 3
%D May-June 1986
%P 48-52
%K AI07

%A Ye. I. Yefimov
%T Calculation of Probability in Fuzzy Human Interface
%J Soviet Journal of Computer and Systems Sciences
%V 24
%N 3
%D May-June 1986
%P 34-47
%K AI07

%A Thomas Jupille
%T Expert Systems are New Textbooks
%J Research and Development
%V 28
%N 12
%D December 1986
%P 52-58
%K AI01 AT08

%A Jorge G. Moser
%T Integration of Artificial Intelligence and Simulation in a Comprehensive
Decision Support System
%J Simulation
%V 47
%N 6
%P 223-232
%K AI13

%A E. Hisdal
%T Infinite-Valued Logic Based on Two-Valued Logic and Probability.
Part 1.2 Different Sources of Fuzziness
%J International Journal of Man-Machine Studies
%V 25
%N 2
%D August 1986
%P 113-138
%K O04

%A K. L. Norman
%A L. J. Weldon
%A B. Schneiderman
%T Cognitive Layouts of Windows and Multiple Screens for User Interfaces
%J International Journal of Man-Maachine Studies
%V 25
%N 2
%D August 1986
%P 229
%K AA15 AI08

%A Su-Shing Chen
%A Michael Penna
%T Shape and Motion of Nonrigid Bodies
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 175-207
%K AI06

%A Chew L. Tan
%A W. N. Martin
%T A Distributed System for Analyzing Time-Varying Multiresolution Imagery
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 162-174
%K AI06 H03

%A Muralidhara Subbarao
%A Allen M. Waxman
%T Closed Form Solutions to Image Flow Equations for Planar Surfaces in
Motion
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 208-228
%K AI06

%A H. S. Yang
%A A. C. Kak
%T Determination of the Identity, Position and Orientation of the Topmost
Object in a Pile
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 229-255
%K AI06

%A C. H. Chien
%A J. K. Aggarwal
%T Identification of 3D Objects from Multiple Silhouettes Using Quadtrees/
Octrees
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 256-273
%K AI06

%A Prasanna G. Mulgaonkar
%A Linda G. Shapiro
%A Robert M. Haralick
%T Shape from Perspective: A Rule-Based Approach
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 298-320
%K AI06 AI01

%A Vincent Shang-Shouq Hwang
%A Larry S. Davis
%A Takashi Matsuyama
%T Hypothesis Integration in Image Understanding Systems
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 321-371
%K AI06

%A Robert M. Haralick
%T Computer Vision Theory: The Lack Thereof
%J Computer Vision, Graphics and Image Processing
%V 36
%N 2-3
%D November-December 1986
%P 372-386
%K AI06 AI16

%A J. Stojanovski
%T A Note on Implementing Prolog in Lisp
%J Information Processing Letters
%V 23
%N 5
%D November 24 1986
%P 261-264
%K T01 T02

%A R. A. King
%T Expert Systems for Material Selection and Corrosion
%J The Chemical Engineer (London)
%N 431
%D December 1986
%P 42-45
%K AA05 AI01

%A J. Mantas
%T An Overview of Character Recognition Methodologies
%J Pattern Recognition
%V 19
%N 6
%D 1986
%P 425-430
%K AI06

%A J. Cerella
%T Pigeons and Perceptrons
%J Pattern Recognition
%V 19
%N 6
%D 1986
%P 431-438
%K AI06 AI08 AA10

%A A. Goshtasby
%T Piecewise Linear Mapping Functions for Image Registration
%J Pattern Recognition
%V 19
%N 6
%D 1986
%P 459-466
%K AI06

%A J. N. Kapur
%T Application of Entropic Measures of Stochastic Dependence on Pattern
Recognition
%J Pattern Recognition
%V 19
%N 6
%D 1986
%P 473-476
%K AI06

%A M. A. Ismail
%A S. Z. Selim
%T Fuzzy c-means: Optimality of Solutions and Effective Termination of
the Algorithm
%J Pattern Recognition
%V 19
%N 6
%D 1986
%P 481
%K O04 O06

%A A. J. P. Theuwissen
%A C. H. L. Weitjins
%T The Accordian Imager, A New Solid State Image Sensor
%J Philips Technical Review
%V 43
%N 1-2
%P 1-9
%K AI06

%A A. D. Goldfinger
%A G. M. Oderda
%A R. F. Wachter
%T IPECAC: An Expert System for the Management of Poisoning Incidents
%J John Hopkins APL Technical Digest
%V 7
%N 4
%D October-December 1986
%P 372-378
%K AI01 AA01

%A Andrew Russell
%T Vision System Based on a Single-chip Microcomputer
%J Microprocessors and Microsystems
%V 10
%N 9
%D November 1986
%P 485-490
%K H01 AI06
%X describes an image processing system based on an 8751 microcontroller
with a Dynamic Ram as a vision sensor

%A Min De Cheng
%A Xie Chang Shen
%A Min Qiang Zhou
%A Quing Yun Shi
%A Min Ping Qian
%T Introduction to Pattern Recognition
%I Shanghai Kexu Jishu Chubanshe
%C Shanghai
%D 1983
%K AT15 AI06
%X in Chinese

%A A. I. Degtyarev
%A A. A. Voronkov
%T Methods of Control of Equality in Mechanical Proofs of Theorems
%J Kibernetika (Kiev)
%V 1986
%N 3
%P 34-41
%K AI11 AI03

%A Francois Fages
%A Gerard Huet
%T Complete Sets of Unifiers and Matchers in Equational Theories
%J Theoretical Computer Science
%V 43
%N 2-3
%P 189-200
%K AI11

%A N. V. Gogoberidze
%A Sh. G. Mgeladze
%T An Approach to the Problem of Automation of Logical Inference
%J Soobshch. Akad. Nauk Gruzin SSR
%V 119
%N 3
%D 1985
%P 581-584
%K AI11
%X Russian. English and Georgian Summaries

%A Jan Grabowski
%T Unificational Dynamic Logic
%J Elektron. Informationsverarb. Kybernet.
%V 22
%N 5-6
%D 1986
%P 325-338
%K AI11

%A Ryszard Jakubowski
%T A Structural Representation of Shape and Its Features
%J Inform. Sci
%V 39
%N 2
%D 1986
%P 129-151
%K AI06 AI16

%A V. I. Vasil'ev
%A F. P. Ovsyannikova
%T Learning Pattern Recognition with a Given Reliability
%J Kibernetika (Kiev)
%V 1986
%N 3
%P 50-56
%K AI06 AI04

%A P. Ecsedi-Toth
%T On the Expressive Power of Equality-Free First Order Languages
%J Z. Math. Logik Grundlag. Math
%V 32
%N 4
%D 1986
%P 371-375

%A V. K. Kabulov
%T Proof of Theorems in the Propositional Calculus
%J Dokl. Akad. Nauk UzSSR
%N 5
%D 1986
%P 5-6
%K AI11

%A Daniel N. Osherson
%A Michael Stob
%A Scott Weinstein
%T Aggregating Inductive Expertise
%J Inform. and Control
%V 70
%N 1
%D 1986
%P 69-95
%K AI04

%A A. A. Voronkov
%A A. I. Degtyarev
%T Automatic Theorem Proving I.
%J Kibernetika (Kiev)
%V 1986
%N 3
%P 27-33

%A A. A. Lorents
%T Cluster Invariant Transformations of Images
%B Methods and Means of Transforming Information
%E G. G. Gromov
%N 3
%I "Zinatne"
%C Riga
%D 1985
%P 39-75

%A P. T. Cox
%A T. Pietrzykowski
%T Incorporating Equality into Logic Programming via Surface Deduction
%J Ann. Pure Appl. Logic
%V 31
%N 2-3
%D 1986
%P 177-189
%K AI10 AI11

%A Judith V. Grabiner
%T Computers and the Nature of Man: A Historian's Perspective on Controversies
About Artificial Intelligence
%J Bull. Amer. Math. Soc. (n. S.)
%V 15
%N 2
%D 1986
%P 113-126
%K AA11 AA25 AT20 AI16

%A Rolf Wiehagen
%T On the Complexity of Program Synthesis from Examples
%J Elektron. Informationsverarb. Kybernet
%V 22
%N 5-6
%D 1986
%P 305-323
%K AA08 AI04

%A Kunihiko Kaneko
%T Complexity in Basin Structures and Information Processing by the
Transition Among Attractors
%B Dynamical Systems and Nonlinear Oscillations (Kyoto 1985)
%S World Sci. Adv. Ser. Dyn. Syst.
%I Word Sci. Publishing
%C Singapore
%D 1986
%P 194-209
%K AI08

%A G. S. Pospelov
%A D. A. Pospelov
%A V. F. Khoroshevskyi
%T International Basic Laboratory on Artificial Intelligence
%J Vestnik Akademii Nauk SSSR
%N 8
%D 1986
%P 76
%K AT19

%A R. G. Palmer
%T How Expert Systems Can Improve Crop Production
%J Agricultural Engineering
%V 67
%N 6
%D September-October 1986
%P 28-35
%K AA05 AA23 AI01

%A G. Papakonstantinou
%A C. Moraitis
%A T. Panayiotopoulos
%T An Attribute Grammar Interpreter as a Knowledge Engineering Tool
%J Angewandte Informatik
%N 9
%D September 1986
%K AI16

%A L. I. Lipkin
%T Correct Models in Problems of Recognition with Random Information
%J Dokl. Akad. Nauk SSSR
%V 289
%N 4
%D 1986
%P 793-795
%K AI06
%X (in Russian)

%A Maria Viorica Stefanescu
%T The Problem of Best Approximation in the Theory of Hierarchical Classificatio
n
%J Stud. Cerc. Mat
%V 38
%N 4
%D 1986
%P 392-408
%K O06
%X in Romanian with an English summary

%A Xu Ding Zhu
%A Xue Mou Wu
%T Transformation of Pansystems Relations, Pansystems Clustering and Pansystems
Recognition
%J J. Huazhong Univ. Sci. Tech.
%V 13
%N 6
%D 1985
%P 71-74
%X in Chinese with English summary

%A S. S. Goncharov
%A D. I. Sviridenko
%T Mathematical Foundations of Semantic Programming
%J Dokl. Akad. Nauk SSSR
%V 289
%N 6
%D 1986
%P 1324-1328
%K AI10 AI11 AI16
%X in Russian

%A Yoshihito Toyama
%T On Equivalence Transformations for Term Rewriting
%J RIMS Symposia on Software Science and Engineering II (Kyoto 183/184)
%S Lecture Notes in Computer Science
%V 220
%I Springer-Verlag
%C Berlin-New York
%D 1986
%P 44-61
%K AI10

%A Sergiu Hart
%A Micha Sharir
%T Probabilistic Propositional Temporal Logics
%J Inform. and Control
%V 70
%N 2-3
%D 1986
%P 97
%K AI10

%A Dell, Gary S.
%T A Spreading-Activation Theory of Retrieval in Sentence Production
%J Psychological Review
%V 93
%N 3
%D 1983
%P 283-321
%K AI12 AI02

%A Fahlman, Scott E.
%T Representing Implicit Knowledge
%B Parallel Models of Associative Memory
%E E Geoffrey E. Hinton
%E James A. Anderson
%I Lawrence Erlbaum Associates
%C Hillsdale, New Jersey
%D 1981
%K AI12 AI08

%A Fanty, Mark
%T Context-Free Parsing in Connectionist Networks
%R Tech Report TR174
%I Department of Computer Science, University of Rochester
%D Nov. 1985
%K AI12 AI02

%A Feldman, Jerome A.
%T A Connectionist Model of Visual Memory
%B Parallel Models of Associative Memory
%E Geoffrey E. Hinton
%E James A. Anderson
%I Lawrence Erlbaum Associates
%C Hillsdale, New Jersey
%D 1981
%K AT15 AI12

%A Feldman, Jerome A.
%A Dana H. Ballard
%T Connectionist Models and Their Properties
%J Cognitive Science
%V 6
%D 1982
%P 205-254
%K AI08 AI12

%A Feldman, Jerome A.
%T Dynamic Connections in Neural Networks
%J Biological Cybernetics
%V 46
%I Springer-Verlag
%D 1982
%P 27-39
%K AI08 AI12

%A Fodor, Jerry A.
%T Information and Association
%K AI08 AI12
%O This paper is a critique of connectionism. Author is with department
of Philosophy, MIT, Cambridge Massachussetts.

%A Hopfield, John J.
%T Neural Networks and physical systems with emergent collective
computational abilities
%J Proceedings National Academy of Science
%V 79
%D Apr. 1982
%P 2554-2558
%K AI08 AI12

%A Hopfield, John J.
%A David W. Tank
%T Simple "Neural" Optimization Networks: An A/D Converter, Signal Decision
Circuit, and a Linear Programming Circuit
%J IEEE Transactions on Circuits and Systems
%V CAS-33
%N 5
%D May 1986
%P 533-541
%K AI12 AA04

%A Hopfield, John J.
%A David W. Tank
%T Collective Computation with Continuous Variables
%B Disordered Systems and Biological Organization
%I Springer-Verlag
%K AI12
%O In press, 1986

%A Hopfield, John J.
%A David W. Tank
%T "Neural" Computation of Decisions in Optimization Problems
%J Biological Cybernetics
%V 52
%I Springer-Verlag
%D 1985
%P 141-152
%K AI12

%A Kosslyn, Stephen M.
%A Gary Hatfield
%T Representation without Symbol Systems
%J Social Research
%V 51
%N 4
%D 1984
%P 1019-1044
%K AI12
%O Winter 1984

%A Matthews, Robert J.
%T Problems with Representationalism
%J Social Research
%V 51
%N 4
%D Winter 1984
%P 1065-1097
%K AI12

%A McClelland, James L.
%A Jerome Feldman
%A Beth Adelson
%A Gordon Bower
%A Drew McDermott
%T Connectionist Models and Cognitive Science: Goals, Directions and
Implications
%D Jan. 1987
%K AI12
%O National Science Foundation Grant Proposal

%A Plaut, David C.
%T Visual Recognition of Simple Objects by a Connection Network
%R Tech Report TR143
%I Computer Science Department, University of Rochester
%D Aug. 1984
%K AI12 AI06

%A Pylyshyn, Zenon W.
%T Computation and Cognition: Toward a Foundation for Cognitive Science
%I MIT Press
%C Cambridge, Massachusetts
%D 1984
%K AI12 AI08

%A Reiss, Richard F.
%T An Abstract Machine Based on Classical Association Psychology
%B Proceedings 1962 Joint Computer Conference
%V 21
%I AFIPS
%D 1962
%K AI12 AI08

%A Shastri, Lokendra
%A Jerome A. Feldman
%T Semantic Networks and Neural Nets
%R Tech Report TR131
%I Computer Science Department, University of Rochester
%D June 1984
%K AI12

%A Schwartz, Robert
%T "The" Problems of Representation
%J Social Research
%V 51
%N 4
%D 1984
%P 1047-1064
%K AI12
%O Winter 1984

%A Touretzky, David S.
%A Geoffrey E. Hinton
%T Symbols Among the Neurons: Details of a Connectionist Inference
Architecture
%J IJCAI
%D Aug. 1985
%K AI12

%T Mathematical Methods in Software Science and Technology
%I Kyoto University, Research Institute for Mathematical Sciences, Kyoto
%C Kyoto
%K AT15
%X Proceedings of a symposium held at the Research Institute for Mathematical
Sciences, Kyoto University, Kyoto, October 4-6 1985

%A Cecylia M. Rauszer
%T Remarks on Logic for Dependencies
%J Bull. Polish Acad. Sci. Math
%V 34
%N 3-4
%D 1986
%P 249-252

%A A. Aiello
%A E. Burattini
%A A. Massarotti
%A F. Ventriglia
%T Heuristic Evaluation Techniques for Bin Packing Approximation Algorithms
%J Calcolo
%V 22
%D 1985
%P 319-334

%A Ernest G. Manes
%A Michael A. Arbib
%T Algebraic Approaches to Program Semantics
%S AKM Series in Theoretical Computer Science
%I Springer-Verlag
%C New York-Berlin
%D 1986
%K AA08 AT15
%X ISBN 0-387-96324-3 351 pages

%A Kazunori Ueda
%T On the Operational Semantics of Guarded Horn Clauses
%B Mathematical Methods in Software Science and Technology
%C Kyoto
%D 1985
%P 263-283
%K AI10
%X (in Japanese)

%A A. I. Kondratev
%T Game Theoretic Models in Problems of Recognition
%I "Nauka"
%C Moscow
%D 1986
%K AT15 AI06 AI16
%X In Russian

%A Etienne Paul
%T On Solving the Equality Problem in Theories Defined by Horn Clauses
%J Theoret. Comput. Science
%V 44
%N 2
%D 1986
%P 127-153

%A Zbigniew Ras
%A Maria Zemankova
%T Learning in Knowledge Based Systems, A Possibilistic Approach
%J Bull. Polish Acad. Sci. Math
%V 34
%N 3-4
%D 1986
%P 235-247
%K AI04 O04

%A Takashi Yokomori
%T Representation Theorems and Primitive Predicates for Logic Programs
%B Mathematical Methods in Software Science and Technology
%C Kyoto
%D 1986
%P 1-17
%K AI10

%A Eric Degreef
%A Jean-Paul Doignon
%A Andre Ducamp
%A Jean-Claude Falmagne
%T Languages for the Assesment of Knowledge
%J J. Math. Psychology
%V 30
%N 3
%D 1986
%P 243-256
%K AA10 AI16

%A E. Diday
%T A Visual Representation of Overlapping Clusters: Pyramids
%J RAIRO Automat. Prod. Inform. Ind
%V 20
%N 5
%D 1986
%P 475-526
%K O06

%A Michael Leyton
%T A Theory of Information Structure. II. A Theory of Perceptual
Organization
%J J. Math Psychol.
%V 30
%N 3
%D 1986
%P 257-305
%K AA10 AI08 AI16

%A Eliezer L. Lozinski
%T A Problem Oriented Inferential Database System
%J ACM Trans. Database Systems
%V 11
%N 3
%D 1986
%P 323-356
%K AA09

%A R. P. Bergstrom
%T AI - Shifting into High Gear
%J Manufacturing Engineering
%V 98
%N 1
%D January 1987
%K AI16 AT08

%A Gail A. Carpenter
%A Stephen Grossberg
%T A Massively Parallel Architecture for a Self-Organizing Neural Pattern
Recognition Machine
%J Computer Vision, Graphics, and Image Processing
%V 37
%N 1
%D January 1987
%P 54-115
%K AT12 AI06 H03

%A Stephen Grossberg
%A Ennio Mingollao
%T Neural Dynamics of Surface Perception: Boundary Webs, Illuminants and
Shape from Shading
%J Computer Vision, Graphics and Image Processing
%V 37
%N 1
%D January 1987
%P 116
%K AT12 AI06 AA10

%A Salvatore J. Stolfo
%A Daniel P. Miranker
%T DADO: A Tree-Structured Architecture for Artificial Intelligence
Computation
%B Annual Review of Computer Science
%I Annual Reviews Inc
%C Palo Alto, CA
%D 1986
%P 1-18
%K H03

%A C. Raymond Perrault
%A Barbara J. Grosz
%T Natural-Language Interfaces
%B Annual Review of Computer Science
%I Annual Reviews Inc
%C Palo Alto, CA
%D 1986
%P 47-82
%K AI02 AA15 AT08

%A Hector J. Levesque
%T Knowledge Representation and Reasoning
%B Annual Review of Computer Science
%I Annual Reviews Inc
%C Palo Alto, CA
%D 1986
%P 255-288
%K AI16 AT08

%A V. B. Robinson
%A A. U. Frank
%A M. A. Blaze
%T Expert Systems Applied to Problems in Geographic Information Systems -
Introduction, Review and Prospects
%J Computers, Environment and Urban Systems
%V 11
%N 4
%D 1986
%P 161-174

%A Michael W. Parks
%T Artificial Intelligence, Part 2: Expert Systems Fill in the Missing Link
%J Industrial Engineering
%V 19
%N 1
%D January 1987
%P 36-47
%K AT08 AI16

%A M. B. Gorzalczany
%T A Method For Inference in Approximate Reasoning Based on Interval Valued
Fuzzy Sets
%J Fuzzy Sets and Systems
%V 21
%N 1
%D January 1987
%P 1-18
%K O04

%A N. Y. Salmina
%A I. A. Khodashinskii
%T Methods and Means of Automatic Correction of Spelling Errors
%J Nauchno-tekhnicheskaya Informatsiya Seriya II - Informatsionnye Protessy
I Sistemy
%N 10
%D 1986
%P 25-28
%K AA15

%A J. Bartholdi,\ III
%A M. A. Trick
%T Stable Matching with Preferences Derived from a Psychological Model
%J Operations Research Letters
%V 5
%N 4
%D October 1986
%P 165-170
%K O04 AA11

%A K. K. Paliwal
%A V. Ramsubramanian
%T Vector Quantization in Speec Coding: A Review
%J Indian Journal of Technology
%V 24
%N 10
%D October 1986
%P 613-621
%K AI05

%A P. Leith
%T Fundamental Errors in Legal Logic Programming
%J The Computer Journal
%V 29
%N 6
%D December 1986
%P 545-552
%K AA24 AI10

%A R. A. Frost
%T Improving Output from Research (in the Domain of Knowledge Base Systems)
%J The Computer Journal
%V 29
%N 6
%P 572
%K AI01 AT19

%A P. Hajek
%T A Simple Dynamic Logic
%J Theoretical Computer Science
%V 46
%N 2-3
%D 1986
%P 239-260
%K AI10

%A C. H. Huang
%A C. Lengauer
%T The Automated Proof of a Trace Transformation for a Bitonic Sort
%J Theoretical Computer Science
%V 46
%N 2-3
%D 1986
%P 261-284
%K AI11 AA08

%A A. Dicky
%T An Algebraic and Algorithmic Method for Analysing Transition Systems
%J Theoretical Computer Science
%V 46
%N 2-3
%D 1986
%P 285-304

%A T. Hardinne
%A A. Levinne
%T Proof of Termination of the Rewriting System SUBST on CCL (Note)
%J Theoretical Computer Science
%V 46
%N 2-3
%D 1986
%P 305-312

%A Anton Bigelmaier
%T Profile of a Geometrical Knowledge Base for CAD Systems
%J Computers and Graphics
%V 10
%N 4
%D 1986
%P 297-306
%K AA05

%A Taha I. Elareef
%T Flavor System and Message Passing as Representation of Knowledge
for Solid Modeling in CAD Expert System
%J Computers and Graphics
%V 10
%N 4
%D 1986
%P 351-358
%K AA05 T01 AI01

%A J. Bajon
%A M. Cattoen
%A L. Llang
%T Identification of Multicoloured Objects Using a Vision Module
%B Proceedings of the Sixth International Conference on Robot Vision and
Sensory Controls
%I IFS Publications Limited
%C Kempston
%D 1986
%P 21-30
%K AI06

%A H. A. Laird
%A K. R. Gilmour
%A D. McKeag
%T A Vision for Strain Analysis
%B Proceedings of the Sixth International Conference on Robot Vision and
Sensory Controls
%I IFS Publications Limited
%C Kempston
%D 1986
%P 31-40
%K AI06

%A H. Vanbrussel
%A H. Belien
%T A High Resolution Tactile Sensor for Part Recognition
%B Proceedings of the Sixth International Conference on Robot Vision and
Sensory Controls
%I IFS Publications Limited
%C Kempston
%D 1986
%P 49-60
%K AA26 AI07 AI06

%T The LRC Machine Translation System
%R AI-013-85
%I Microelectronics and Computer Technology Corporation
%D March 1985
%K AI02

%T A Machine-Aided Translation Bibliography
%R AI-012-85
%I Microelectronics and Computer Technology Corporation
%D March 1985
%K AT09 AI02

%T A Survey of Machine Translation: Its History, Current Status and
Future Prospects
%R AI-011-85
%I Microelectronics and Computer Technology Corporation
%D May 1985
%K AI02 AT08

%T Machine Translation: Viewpoint From Both Sides
%R AI-010-85
%I Microelectronics and Computer Technology Corporation
%D February 1985
%K AI02

%T Machine Translation
%R AI-009-85
%I Microelectronics and Computer Technology Corporation
%D February 1985
%K AI02

%T A Practical Comparison of Parsing Strategies
%R AI-008-85
%I Microelectronics and Computer Technology Corporation
%D May 1985
%K AI02

%T Parser Construction Techniques: A Tutorial
%R AI-007-85
%I Microelectronics and Computer Technology Corporation
%D May 1985
%K AI02 AT08

%T Transportability to Other Languages: The Natural Language Processing
Project in the AI Program at MCC
%R AI-006-85
%I Microelectronics and Computer Technology Corporation
%D March 1985
%K AI02

%T Using Explicit Contradictions to Provide Explanations in a TMS
%R AI-0100-05
%I Microelectronics and Computer Technology Corporation
%D April 1985
%K AI15

%T Analogical Reasoning for Digital System Synthesis
%R AI/CAD-162-85
%I Microelectronics and Computer Technology Corporation
%D May 1986
%K AA04

%T A Computational Logic for Database Programs
%R DB-081-86
%I Microelectronics and Computer Technology Corporation
%D March 12, 1986
%K AA09

%T Analyzing the Run-Time Behavior of Logic Programs
%R DB-064-86
%I Microelectronics and Computer Technology Corporation
%D March 6, 1986
%K AI10

%T Some extensions to the Closed World Assumption in Databases
%R DB-058-86
%I Microelectronics and Computer Technology Corporation
%D March 3, 1986
%K AA09 AI16

%T LDL: A Logic Based Data-Language
%R DB-026-86
%I Microelectronics and Computer Technology Corporation
%D February 11, 1986
%K AI10 AA09

%T Optimizing the Rule/Data Interface in a Knowledge Management System
%R DB-021-86
%I Microelectronics and Computer Technology Corporation
%D February 3, 1986
%K AA09 AI01

%T Tools for the Analysis of Large Prolog Programs
%R DB-171-85
%I Microelectronics and Computer Technology Corporation
%D December 3, 1985
%K T02 O02

%T Parallel Evaluation of Recursive Rule Queries
%R DB-132-85
%I Microelectronics and Computer Technology Corporation
%D October 1985
%K AI01

%T Magic Sets and Other Strange Ways to Implement Logic Programs
%R DB-121-85
%I Microelectronics and Computer Technology Corporation
%D October 28, 1985
%K AI10

%T On the Implementation of a Simple Class of Logic Queries for Databases
%R DB-101-85
%I Microelectronics and Computer Technology Corporation
%D October 14, 1985
%K AI10 AA09

%T Safety and Compilation of Non-Recursive Horn Clauses
%R DB-088-85
%I Microelectronics and Computer Technology Corporation
%D September 20, 1985
%K AI10

%T Object Oriented Database Systems and Knowledge Systems
%R DB-038-85
%I Microelectronics and Computer Technology Corporation
%D July 9, 1985
%K AI16

%T A Logic-Programming/Object-Oriented Cocktail
%R DB-021-85
%I Microelectronics and Computer Technology Corporation
%D September 10, 1985
%K AI10

%T Database and Knowledge Based System Opportunities
%R Mcc/db/dbsa-7/rev.0
%I Microelectronics and Computer Technology Corporation
%D October 5, 1986
%K AA09

%T The Representation and Deductive Retrieval of Complex Objects
%R mcc/db/kbs-77/rev.1
%I Microelectronics and Computer Technology Corporation
%D May 6, 1985
%K AI16

%T The Transition from Data Management to Knowledge Management
%R mcc/db/kbs-75/rev.1
%I Microelectronics and Computer Technology Corporation
%D April 30, 1985
%K AI16

%T Opportunities for Parallelism in Knowledge Management Systems:
A Bibliography
%R mcc/db/kbs-52/rev.1
%I Microelectronics and Computer Technology Corporation
%D December 11, 1984
%K AT09 H03

%T Logic Programming/Database Interfaces
%R mcc/db/kbs-49/rev.1
%I Microelectronics and Computer Technology Corporation
%D December 5, 1984
%K AA09 AI10

%T Rule Support in Prolog
%R mcc/db/kbs-44/rev.1
%I Microelectronics and Computer Technology Corporation
%D November 30, 1984
%K AI01 T02

%T Logics for Semantic Data Models
%R mcc/db/kbs-43/rev.1
%I Microelectronics and Computer Technology Corporation
%D November 30, 1984
%K AI10 AI16

%T KBS Requirements, Rev.0
%R mcc/db/kbs-33/rev.0
%I Microelectronics and Computer Technology Corporation
%D October 31, 1984
%K AI16

%T Knowledge Base Development and Use in Deductive Data Management
%R mcc/db/kbs-29/rev.1
%I Microelectronics and Computer Technology Corporation
%D October 31, 1984
%K AI16

%T Human Computer Interactions and Intelligent Tutoring Systems
%R HI-294-86
%I Microelectronics and Computer Technology Corporation
%D September 8, 1986
%K AA07 O01

%T Speech Processing for the User Interface
%R HI-200-86
%I Microelectronics and Computer Technology Corporation
%D July 1986
%K AI05

%T A Parser for Portable NL Interfaces Using Graph-Unification-Based Grammars
%R HI-179-86
%I Microelectronics and Computer Technology Corporation
%D June 1986
%K AI02

%T Parsing as Heuristic Graph Search
%R HI-075-86
%I Microelectronics and Computer Technology Corporation
%D Mar 6, 1986
%K AI02

%T Ambiguity and Procrastination in NL Interfaces
%R HI-073-86
%I Microelectronics and Computer Technology Corporation
%D March 1986
%K AI02

%T Some Properties of Combinatory Categorical Grammars of Relevance to Parsing
%R HI-012-86
%I Microelectronics and Computer Technology Corporation
%D January 22, 1986
%K AI02

%T A General User Model, Part 1: Connectionist Framework
%R HI-017-86
%I Microelectronics and Computer Technology Corporation
%D January 31, 1986
%K AI08

%T Extraposition from NP as Anaphora
%R HI-118-85
%I Microelectronics and Computer Technology Corporation
%D October 23, 1985; revision one: March 1986
%K AI02

%T Memory for Spatial Locations and Related Topics: A Review and Annotated
Bibliography
%R HI-111-85
%I Microelectronics and Computer Technology Corporation
%D October 18, 1985
%K AI08 AT09

%T Graphic Interfaces for Knowledge-Based System Development
%R HI-089-85
%I Microelectronics and Computer Technology Corporation
%D September 1985; revision one: December 1985
%K O01 O02

%T Analysis of User-Expert Dialogues: Task Networks, Subdialogue Boundary
Markers and Antecedent Distribution
%R HI-084-85
%I Microelectronics and Computer Technology Corporation
%D December 1, 1985
%K AI08 AI01 AI02

%T Natural Language Understanding: How Natural Can it Be?
%R HI-074-85
%I Microelectronics and Computer Technology Corporation
%D September 13, 1985
%K AI02

%T Applications of Speech Technology in the CAD Workstation
%R HI-066-85
%I Microelectronics and Computer Technology Corporation
%D April 26, 1985
%K AI05 AA04 AA15

%T On the Applied Use of Computer Models of Human Memory: A Proposal
for a Large-Scale Personal Filing System
%R HI-85-103-04
%I Microelectronics and Computer Technology Corporation
%D 1985
%K AA14 AI08

%T Memory Structure, Focusing, and Anaphora Resolutions: A Study and
Comparison of Computer and Human Memory
%R HI-85-102-04
%I Microelectronics and Computer Technology Corporation
%D 1985
%K AI08

%T Speech Processing State of the Art Report
%R HI-85-100-04
%I Microelectronics and Computer Technology Corporation
%D 1985
%K AI05 AT08

%T Artificial Intelligence and Advanced User Interfaces
%R HI/STP-054-86
%I Microelectronics and Computer Technology Corporation
%D February 25, 1986
%K AI02

%T Goal Scheduling and Memory Management in Parallel Logic Systems
%R PP-083-86
%I Microelectronics and Computer Technology Corporation
%D March 15, 1986
%K H03 AI10

%T Potentials for Parallel Execution of Common Lisp Programs
%R PP-020-86
%I Microelectronics and Computer Technology Corporation
%D January 30, 1986
%K T01 H03

%T An Abstract Machine for Restricted And-Parallel Execution of Logic
Programs
%R PP-154-85
%I Microelectronics and Computer Technology Corporation
%D November 26, 1985
%K AI10 H03

%T A Study of the Parallelism Inherent in Combinator Reduction
%R PP-140-85
%I Microelectronics and Computer Technology Corporation
%D Nov 11, 1985
%K H03

%T A Restricted and-Parallel Execution Model and Abstract Machine for
Prolog Programs
%R PP-104-85
%I Microelectronics and Computer Technology Corporation
%D October 2, 1985
%K T02 H03

%T Parallel Execution of a Rule-Based Expert System
%R PP-079-85
%I Microelectronics and Computer Technology Corporation
%D 1985
%K AI01 H03

%T Expert System Application Study
%R PP-024-85
%I Microelectronics and Computer Technology Corporation
%D 1985
%K AI01

%T Proceedings of the MCC Workshop on LFP (Logical/Functional)
programming Languages
%R PP-019-85
%I Microelectronics and Computer Technology Corporation
%D July 1, 1985
%K AI10

%T Biggertalk* = Biggertalk + Gordion
%R STP-053-86
%I Microelectronics and Computer Technology Corporation
%D November 1, 1985
%K AI10

%A Kanad Gose
%A R. M. Steward
%T Data and Resource Abstraction Mechanisms on an Object-Based Architecture
%R TR 86-1
%I Iowa State University
%D January 1986

%A David A. Schmidt
%A Jacek Leszczylowski
%T On Developing a Logic for Program Derivation and Verification
%R TR 86-16
%I Iowa State University
%D November 1986
%K AA08 AI10 predicate calculation

%A Jacek Lesczylowski
%A Jan Maluszynski
%T Logic Programming with External Procedures: Introducing S-Unification
%R TR 86-21
%I Iowa Sate University
%D December 1986
%K AI10

%A Helen M. Gigley
%A Jean-Francois Boulicaut
%A Eric Ramahefarivony
%T Grasper-Insa -- A Graph Processing Tool for Knowledge Engineering
%R 83-5
%I University of New Hamshire
%D September 1983
%K T01

%A Helen M. Gigley
%T Processing Word Ambiguities: Availability of Multiple Meanings of Ambiguous
Words in Aphasic Patients and Normal Controls
%R 83-6
%I University of New Hampshire, Department of Computer Science
%D September 1983
%K AA08 AA11 AI02

%A Sylvia Weber Russell
%T Conceptual Analysis of Partial Metaphor
%R 83-8
%I University of New Hampshire, Department of Computer Science
%D October 1983
%K AI02

%A Michael J. Quinn
%T On the Speedup of Parallel Depth-First Branch-and-Bound Algorithms
%R 83-9
%I University of New Hampshire, Department of Computer Science
%D November 1983
%K H03 AI03

%A Eugene C. Freuder
%T Utilizing Subgraph Isomorphism in Constraint Graphs
%R 84-13
%I University of New Hampshire, Department of Computer Science
%D January 1984
%K constraint satisfaction AI03

%A Eugene C. Freuder
%T A Sufficient Condition for Backtrack-Bounded Search
%R 84-14
%I University of New Hampshire, Department of Computer Science
%D January 1984
%K AI03 constraint satisfaction

%A Eugene C. Freuder
%T Direct Independence of Variables in Constraint Satisfaction Problems
%R 84-15
%I University of New Hampshire, Department of Computer Science
%D March 1984
%K AI03 H03

%A Lee Tibbert
%A R. Daniel Bergeron
%T Graphics Programming For Knowledge-Guided Interaction
%R 84-18
%I University of New Hampshire, Department of Computer Science
%D January 1984
%K O01

%A Eugene C. Freuder
%A Michael J. Quinn
%T Taking Advantage of Stable Sets of Variables in Constraint Satisfaction
Problems
%R 84-20
%I University of New Hampshire, Department of Computer Science
%D December 1984
%K AI03

%A Eugene C. Freuder
%A Michael J. Quinn
%T Parallelism in an Algorithm that Takes Advantage of Stable Sets of Variables
to Solve Constraint Satisfaction Problems
%R 85-21
%I University of New Hampshire, Department of Computer Science
%D Jan 1985
%K AI03 H03

%A Michael J. Quinn
%A Narsingh Deo
%T An Upper Bound for the Speedup of Parallel Branch-and-Bound Algorithms
%R 85-23
%I University of New Hampshire, Department of Computer Science
%D February 1985
%K AI03 H03

%A Helen M. Gigley
%T Computational Neurolinguistics -- What is it all About
%R 85-24
%I University of New Hampshire, Department of Computer Science
%D January 1985
%K AI08 AI02

%A Helen M. Gigley
%T Grammar Viewed as a Functioning Part of a Cognitive System
%R 85-25
%I University of New Hampshire, Department of Computer Science
%D January 1985
%K AI02 AI08

%A Helen M. Gigley
%T Computational Neurolinguistic Modelling Integrating 'Natural Computation'
Control with Performance Defined Representatives
%R 85-26
%I University of New Hampshire, Department of Computer Science
%D September 1985
%K AI02 AI08 HOPE

%A Michael J. Quinn
%A Narsingh Deo
%T An Upper Bound for the Speedup of Parallel Best-Bound Branch-and-Bound
Algorithms
%R 85-27
%I University of New Hampshire, Department of Computer Science
%D September 1985
%K AI03 H03

%A Helen M. Gigley
%T Studies in Artificial Aphasia - Experiments in Processing Change
%R 85-28
%I University of New Hampshire, Department of Computer Science
%D October 1985
%K AI08 AA11 AI02

%A Bruce Barker
%T An Abstract Prolog Machine
%R 85-29
%I University of New Hampshire, Department of Computer Science
%D December 1985
%K H02 T02 Warren

%A Henk J. Haarmann
%A Helen M. Gigley
%T Neural-like Modelling of Synchronization Deficits in Aphasic Comprehension
%R 86-32
%I University of New Hampshire, Department of Computer Science
%D March 1986
%K AI02 AA11 AI08

%A Eugene C. Freuder
%T Applying Constraint Satisfaction Search Techniques to Concept Learning
%R 86-33
%I University of New Hampshire, Department of Computer Science
%D March 1986
%K AI03 AI04

%A Brian Otis
%A Eugene C. Freuder
%T Subdivision of Knowledge for Igneous Rock Identifications
%R 86-35
%I University of New Hampshire, Department of Computer Science
%D April 1986
%K AI01 AA03

%A Sylvia Weber Russell
%T A Perspective from Computer Analysis
%R 86-36
%I University of New Hampshire, Department of Computer Science
%D April 1986
%K metaphor AI02

%A Helen M. Gigley
%T Lexical Ambiguity Resolution in Aphasia
%R 86-36
%I University of New Hampshire, Department of Computer Science
%D May 1986
%K AA11 AI02

%A Helen M. Gigley
%T Sentence Comprehension Processing - A Serial ORder, Time-Synchronous Process
%R 86-39
%I University of New Hampshire, Department of Computer Science
%D April 1986
%K AI02 HOPE

%A Michael J. Quinn
%T Implementing Best-First Branch-And-Bound Algorithms on Hypercube
Multiprocessors
%R PCL 86-02
%I University of New Hampshire, Parallel Computing Laboratory, Department
of Computer Science
%D September 1986
%K AI02 H03

%A Saul Gorn
%T Who Can Be Replaced by A Computer
%R MS-CIS-85-04
%I University of Pennsylvania
%K O05

%A Saul Gorn
%T Self-Annihilating Sentences: Saul Gorn's Compendium of Rarely Used
Cliches
%R MS-CIS-85-03
%I University of Pennsylvania
%K AI02

%A Robert Ruminoff
%T Explaining Concepts in Expert Systems: The Clear System
%R MS-CIS-85-06
%I University of Pennsylvania
%K O01 AI01

%A Vijay-Shankar
%A Aravind Joshi
%T Some Computational Properties of Tree Adjoining Grammars
%R MS-CIS-85-07
%I University of Pennsylvania
%K AI02

%A D. Smitley
%A S. M. Goldwasser
%A I. Lee
%T IPON - Advanced Architectural Framework for Image
%R MS-CIS-85-13
%I University of Pennsylvania
%K AI06 H03 MIMD

%A Eric P. Krotkov
%T Results in Finding Edges and Corners in Images Using the First Directional
Derivative
%R MS-CIS-85-14
%I University of Pennsylvania
%K AI06

%A Anthony S. Kroch
%A Aravand K. Joshi
%T The Linguistic Relevance of Tree Adjoining Grammars
%R MS-CIS-85-16
%I University of Pennsylvania
%K AI02

%A Dale A. Miller
%A Gopalan Nadathur
%T A Computational Logic Approach to Syntax and Semantics
%R MS-CIS-85-17
%I University of Pennsylvania
%K AI10 AI11

%A Paul A. Fishwick
%T Hierarchical Reasoning: Simulating Complex Processes over Multiple
Levels of Abstraction
[Dissertation Exam Version]
%R MS-CIS-85-21
%I University of Pennsylvania
%K simulation

%A Aravind K. Joshi
%T Tree Adjoining Grammars: How Much Context-Sensitivity is Required to
Provide Reasonable Structural Descriptions
%R MS-CIS-85-23
%I University of Pennsylvania
%K AI02

%A David Smiley
%T The Design and Analysis of a Stereo Vision Algorithm
%R MS-CIS-85-27
%I University of Pennsylvania
%K AI06

%A Peter Allen
%A Ruzena Bajcsy
%T Two Sensors Are Better Than One: Examples of Integration of Vision and
Touch
%R MS-CIS-85-29
%I University of Pennsylvania
%K AI06 AI07

%A Samuel Goldwasser
%A Ruzena Bacsy
%T A Distributed Active Sensor Processor System
%R MS-CIS-85-30
%I University of Pennsylvania
%K AI06 AI07 AI01

%A Franc Solina
%T Errors in Stereo Due to Quantization
%R MS-CIS-85-34
%I University of Pennsylvania
%K AI06

%A David A. Klein
%T An Expert Systems Approach to Realtime, Active Management of a Target
Resource
%R MS-CIS-85-40
%I University of Pennsylvania
%K AI01 AA08
YES/MVS IBM O03
%X (describes part of a system for monitoring IBM systems)

%A Robin F. Karlin
%T Romper Mumble
%R MS-CIS-85-41
%I University of Pennsylvania
%K text generation

%A Brant A. Cheikes
%T Monitor Offers an a Dynamic Database [sic]: The Search for Relevance
%R MS-CIS-85-43
%I University of Pennsylvania
%K AA09

%A Aravind K. Joshi
%T Grammar, Phrase Structure
%R MS-CIS-85-45
%I University of Pennsylvania
%K AI02

%A Ethel Shuster
%T Code Switching in Yiddish and Spanish: Evidence for the Translation Model
%R MS-CIS-85-49
%I University of Pennsylvania
%K AI02 AI08
%X discusses second-language acquisition

%A Bonnie Lynn Webber
%T Question, Answer and Responses: Interacting with Knowledge Base Systems
%R MS-CIS-85-50
%I University of Pennsylvania
%K O01

%A Paul A. Fishwick
%T Hires: Hierarchical Reasoning System
%R MS-CIS-85-52
%I University of Pennsylvania
%K simulation
%X manual for system

%A A. Zwarico
%A I. Lee
%T Proving a Network of Real-Time Processes Correct
%R MS-CIS-85-53
%I University of Pennsylvania
%K AA08

%A Ruzena Bajcsy
%T Active Perception vs. Passive Perception
%R MS-CIS-85-54
%I University of Pennsylvania
%K AI06 AI16
%X getting a system to "look" as opposed to just "see."

%A Greogry Donald Hager
%T Computational Aspects of Proofs in Modal Logic
%R MS-CIS-85-55
%I University of Pennsylvania
%K AI10

%A Kathleen Filliben McCoy
%T Correcting Object-Related Misconceptions
%R MS-CIS-85-57
%I University of Pennsylvania
%K AI08 AI01
%X discusses how human experts correct misconceptions as they use the ROMPER
system

%A Peter Kirby Allen
%T Object Recognition Using Vision
%R MS-CIS-85-60
%I University of Pennsylvania
%K AI06 AI07
%X includes discussion of the use of vision and exploratory tactile sensing
in object recognition

%A Aravind K. Joshi
%A K. Vijay-Shanker
%A David J. Weir
%T The Relationship Between Tree Adjoining Grammars and Head Grammars
%R MS-CIS-86-01
%I University of Pennsylvania
%K AI02

%A Hossam A. Elgindy
%T Efficient Algorithms for Computing the Weak Visibility Polygon from
an Edge
%R MS-CIS-86-04
%I University of Pennsylvania
%K O06

%A Jean H. Gallier
%T A Fast Algorithm for Testing Unsatisfiability of Ground Horn Clauses
with Equations
%R MS-CIS-86-06
%I University of Pennsylvania
%K AI10

%A Richard Paul
%A Hugh F. Durrant-Whyte
%A Max Mintz
%T A Robust, Distributed Sensor and Actuation Robot Control System
%R MS-CIS-86-07
%I University of Pennsylvania
%K AI06 AI07
%X proposal for a blackboard based robot system

%A Hugh F. Durrant-Whyte
%T Consistent Integration and Propagation of Disparate Sensor Observations
%R MS-CIS-86-08
%I University of Pennsylvania
%K AI07 AI06

%A Eric P. Krotkov
%A Jean-Paul Maritan
%T Range From Focus
%R MS-CIS-86-09
%I University of Pennsylvania
%K AI07 AI06

%A Jean H. Gallier
%A Stan Raatz
%T Hornlog: A Graph Based Interpreter for General Horn Clauses
%R MS-CIS-86-10
%I University of Pennsylvania
%K AI10

%A Stan Raatz
%A George Drastal
%T Relating Expert System Rule Interactions to Norms of Rule-based Programming
%R MS-CIS-86-12
%I University of Pennsylvania
%K AI01

%A Ruzena Bajcsy
%A Max Mintz
%A Erica Liebman
%T A Common Framework for Edge Detection and Region Growing
%R MS-CIS-86-13
%I University of Pennsylvania
%K AI06

%A Fil Fuma
%A Erick Krotkov
%A John Summers
%T The Pennsylvania Active Camera System
%R MS-CIS-86-15
%I University of Pennsylvania
%K AI06

%A Tim Finin
%A Aravind K. Joshi
%A Bonnie Lynn Webber
%T Natural Language Interactions with Artificial Experts
%R MS-CIS-86-16
%I University of Pennsylvania
%K AI01 AI02 O01

%A Dale A. Miller
%A Gopalan Nadathur
%T Higher-Order Logic Programming
%R MS-CIS-86-17
%I University of Pennsylvania
%K AI10 T02

%A Eric Krotkov
%T Focusing
%R MS-CIS-86-22
%I University of Pennsylvania
%K AI06
%X automatic focusing of a computer controlled camera

%A Rusena Bajcsy
%A Eric Krotkov
%A Max Mintz
%T Models of Errors and Mistakes in Machine Perception
%R MS-CIS-86-26
%I University of Pennsylvania
%K AI06 stereo

%A Aravind K. Joshi
%A Bonnie L. Webber
%A Ralph M. Weischedel
%T Some Aspects of Default Reasoning in Interactive Discourse
%R MS-CIS-86-27
%I University of Pennsylvania
%K AI02

%A Yuen-Wah Eva Ma
%A Ramesh Krishnamurti
%A Bhagirath Narahari
%A Dennis G. Shea
%A Kwang-shi Shu
%T High Performance Special-Purpose Computer Architectures for Robotics
Applications
%R MS-CIS-86-28
%I University of Pennsylvania
%K H03 AI06 AI07

%A Dale A. Miller
%A Gopalan Nadathur
%T Some Uses of Higher Order Logic in Computational Linguistics
%R MS-CIS-86-31
%I University of Pennsylvania
%K AI10 AI02

%A Robert Rubinoff
%T Adapting Mumble: Experience with Natural Language Generation
%R MS-CIS-86-32
%I University of Pennsylvania
%K text generation
%K AI10 T02

%A Ethel Schuster
%T Towards a Computational Model of Anaphora in Discourse: References to
Events and Actions
%R MS-CIS-86-34
%I University of Pennsylvania
%K AI02

%A Tim Finin
%A David Drager
%T $GUMS sub 1$: A General User Modeling System
%R MS-CIS-86-35
%I University of Pennsylvania
%K AI08 O01 AA15

%A Robert Kass
%A Ron Katriel
%A Tim Finin
%T Breaking the Primitive Concept Barrier
%R MS-CIS-86-36
%I University of Pennsylvania
%K AI16 KL-ONE
%X describes extensions to KL-ONE

%A Anthony S. Kroch
%A Aravind K. Joshi
%T Analyzing Extraposition in A Tree Adjoining Grammar
%R MS-CIS-86-37
%I University of Pennsylvania
%K AI02

%A Martha Elizabeth Pollack
%T Inferring Domain Plans in Question-Answering
%R MS-CIS-86-40
%I University of Pennsylvania
%K AI08 O01

%A Brant A. Cheikes
%T Research in Artificial Intelligence at the University of Pennsylvania
%R MS-CIS-86-41
%I University of Pennsylvania
%K AT09 AI16

%A Susan B. Davidson
%A Mark M. Winkler
%T Conflict Resolution in Class Conflict Graph Analysis
%R MS-CIS-86-43
%I University of Pennsylvania
%K conflict resolution AI16

%A Jean H. Gallier
%A Stan Raatz
%T Extending SLD-Resolution to Equational Horn Clauses Using E-Unification
%R MS-CIS-86-44
%I University of Pennsylvania
%K AI10

%A Dale Miller
%A Amy Felty
%T An Integration of Resolution and Natural Deduction Theorem Proving
%R MS-CIS-86-47
%I University of Pennsylvania
%K AI11

%A Sharon A. Stansfield
%T A Rudimentary Active Multimodal, Intelligent System for Object
Categorization
%R MS-CIS-86-48
%I University of Pennsylvania
%K AI06

%A Mark Turner
%T Texture Discrimination by Gabor Functions
%R MS-CIS-86-51
%I University of Pennsylvania
%K AI06

%A Megumi Kameyama
%T A Property-Sharing Constraint in Centering
%R MS-CIS-86-52
%I University of Pennsylvania
%K AI02 pronoun resolution

%A Dale Miller
%T A Theory of Modules for Logic Programming
%R MS-CIS-86-53
%I University of Pennsylvania
%K AI10

%A Claire Socolovsky Caine
%T An Expert System for Marine Umbrella Liability Insurance Underwriting
%R MS-CIS-86-54
%I University of Pennsylvania
%K AA06

%A Gerald P. Stoloff
%T Lanpick -- An Expert System for Recommendation of Local Area Network
Hardware and Software Products
%R MS-CIS-86-55
%I University of Pennsylvania
%K AA08

%A Franc Solina
%T Object Recognition Using Function Based Category Models
%R MS-CIS-86-56
%I University of Pennsylvania
%K AI06

%A Robert Kaas
%T The Role of User Modelling in Intelligent Tutoring System
%R MS-CIS-86-58
%I University of Pennsylvania
%K AA07 AI08

%A Jean H. Gallier
%A Stan Raatz
%T Refutation Methods for Horn Clauses with Equality Based on Unification
%R MS-CIS-86-59
%I University of Pennsylvania
%K AI10

%A Megumi Kameyama
%T Japanese Zero Pronominal Bindings: Where Syntax and Discourse Meet
%R MS-CIS-86-60
%I University of Pennsylvania
%K AI02

%A Robert Kaas
%A Tim Finin
%T The Role of User Models in Question Answering Systems
%R MS-CIS-86-63
%I University of Pennsylvania
%K AI01 AI08 personal investment AA06

%A Aravind K. Joshi
%T An Introduction to Tree Adjoining Grammars
%R MS-CIS-86-64
%I University of Pennsylvania
%K AI06 AT08

%A Alex Pelin
%A Jean Gallier
%T Solving Word Problems in Free Algebras Using Complexity Functions
%R MS-CIS-86-65
%I University of Pennsylvania
%K AI11

%A Jugal Kalita
%A Sunish Shende
%T Generation of Natural Language Text Describing a System of
Asynchronous, Concurrent Processes
%R MS-CIS-86-66
%I University of Pennsylvania

%A Hugh F. Durrant-Whyte
%T Integration, Coordination and Control of Multi-Sensor Robot Systems
%R MS-CIS-86-67
%I University of Pennsylvania
%K AI06 AI07 blackboard AI01

%A Greg Hager
%A Hugh F. Durrant-Whyte
%T Information and Multi-Sensor Coordination
%R MS-CIS-86-68
%I University of Pennsylvania
%K AI07 AI06 H03

%A Tim Finin
%T NFL- A Novices Frame Language
%R MS-CIS-86-71
%I University of Pennsylvania
%K AT18 T01 T03

%A Bonnie Lynn Webber
%T Two Steps Closer to Event Reference
%R MS-CIS-86-74
%I University of Pennsylvania
%K AI02 AI16

%A Greg Hagar
%T Active Reduction of Uncertainty in Multi-Sensor Systems
%R MS-CIS-86-76
%I University of Pennsylvania
%K H03 O04

%A Lokendra Shastri
%T Massive Parallelism in Artificial Intelligence
%R MS-CIS-86-77
%I University of Pennsylvania
%K H03

%A Lokendra Shastri
%A Raymond L. Wairous
%T Learned Phonetic Discrimination Using Connectionistic Networks
%R MS-CIS-86-78
%I University of Pennsylvania
%K H03 AI05

%A Linda Ness
%T Reducing Linear Recursion to Transitive Closure
%R TR-86-25
%I University of Texas at Austin, Department of Computer Sciences
%D November 1986
%K AA09 AI10
%X shows how to deal with a recursively expressed logic program that
is designed to query a database

%A David A. Schmidt
%A Jacek Leszczylowski
%T On Developing a Logic for Program Derivation and Verification
%R TR#86-16
%I Iowa State University Computer Science Department
%D November 1986
%K AA08 AI10 intuitionistic type theory predicate calculus

%A James M. Bieman
%A Albert L. Baker
%A Paul M. Clites
%A David A. Gustafson
%A Austin C. Melton
%T A Standard Representation of Imperative Language Programs
%R TR #86-17
%I Iowa Sate University Computer Science Department
%D November 1986
%K AA08

%A Ken-Chih Liu
%A Rajshekhar Sunderraman
%T Applying an Extended Relational Model to Indefinite Deductive Databases
%R TR #86-18
%I Iowa State University Computer Science Department
%D November 1986
%K AI10 AA09

%A Jacek Leszczylowski
%A Jan Maluszynski
%T Logic Programming with External Procedures: Introducing S-Unification
%R TR #86-21
%I Iowa State University Computer Science Department
%D December 1986
%K AI10

%A Chen
%A Chi
%A Ost
%A Sabbaugh
%A Spring
%T Scheme Graphics Reference Manual
%R TR 144
%I Indiana University Computer Science Department
%D 1984
%K T01

%A Daniel P. Friedman
%A Pee-Hong Chen
%T Prototyping Data Flow by Translation Into Scheme
%R TR 147
%I Indiana University Computer Science Department
%D 1983
%K T01

%A Mitchell Wand
%T A Semantic Algebra for Logic Programming
%R TR 148
%I Indiana University Computer Science Department
%D August 1983
%K AI10

%A Kent Dybvig
%T C-Scheme Reference Manual
%R TR 149
%I Indiana University Computer Science Department
%D September 1983
%K T01

%A J. Barnden
%T On Short-Term Information-Processing in Connectionist Theories
%R TR 152
%I Indiana University Computer Science Department
%D January 1984
%K H03

%A D. Friedman
%A C. Hayes
%A E. Kohlbecker
%A M. Wand
%T Scheme 84 Interim Reference Manual
%R TR 153
%I Indiana University Computer Science Department
%D June 1985
%K T01

%A E. Kohlbecker
%T eu-Prolog: Reference Manual and Report
%R TR 155
%I Indiana University Computer Science Department
%D April 1984
%K T02

%A C. D. Halpern
%T An Implementation of 2-Lisp
%R TR 160
%I Indiana University Computer Science Department
%D June 1984
%K T01

%A L. D. Sabbagh
%T Scheme as an Interactive Graphics Programming Environment
%R TR 166
%I Indiana University Computer Science Department
%D February 1985
%K T01

%A J. A. Barnden
%T Representations of Intensions, Representations as Intensions,
and Propositional Attitudes
%R TR 172
%I Indiana University Computer Science Department
%D June 1985
%K AI02 AI16

%A Johnathan Rees
%A W. D. Clinger
%T Revised Report on Scheme
%R TR 174
%I Indiana University Computer Science Department
%D August 1986
%K AI06
%Y 6.00

%A M. W. Lugowski
%T Why Artificial Intelligence is Necessarily Ad Hoc:
One's Thinking/Approach/ Model/Solution Rides on One's Metaphors
%R TR 176
%I Indiana University Computer Science Department
%D August 1985
%K AI16
%Y 2.00

%A S. C. Kwasny
%A J. Dalby
%A R. Port
%T Rules for Automatic Mapping Between Fast and Slow Speech
%R TR 175
%I Indiana University Computer Science Department
%D July 1985
%K AI05

%A Matthias Felleisen
%T Transliterating Prolog into Scheme
%R TR 182
%I Indiana University Computer Science Department
%D October 1985
%K T01 T02

%A Christopher T. Haynes
%T Logic Continuations
%R TR 183
%I Indiana University Computer Science Department
%D November 1985
%K AI10

%A John A. Barnden
%T Imputations and Explications: Representational Problems in Treatments
of Propositional Attitudes
%R TR 187
%I Indiana University Computer Science Department
%D January 1986
%K AI16

%A Erich J. Smythe
%T The Pleasures of SINN: A System for Programming Connectionist Models
%R TR189
%I Indiana University Computer Science Department
%D February 1986
%K FEB 1986

%A Matthias Felleisen
%A Daniel P. Friedman
%T Control Operators, the SECD-Machine and the $lambda$-calculus
%R TR 197
%I Indiana University Computer Science Department
%D June 1986
%K T01

%A Eugene E. Kohlbecker
%T Syntactic Extensions in the Programming Language Lisp
%R TR 199
%I Indiana University Computer Science Department
%D August 1986
%K T01
%Y 12.00 (Ph. D. Dissertation)

%A Matthias Felleisen
%T A Final Scheme-Word on Landin's J-Operator
%R TR 205
%I Indiana University Computer Science Department
%D November 1986
%K T01

%A Bipin Indurykha
%T Analogies and Metaphors: An Interdisciplinary Perspective
%R BUCS Tech Report #86-012
%I Boston University Department of Computer Science
%D December 1986
%K AI08 AI16 AI02

%A Michael Siegel
%T Automatic Rule Derivation for Semantic Query Optimization
%R BUCS Tech Report #86-013
%I Boston University Computer Science Department
%D December 1986
%K AA09 AI01

%A Leonard Uhr
%T Toward a Computational Information-Processing Model of Object
Perception
%R TR651
%I University of Wisconsin-Madison, Computer Sciences Department
%D July 1986
%K AI08 AI06
%X describes what is known and is necessary for development of a model
of visual perception in humans as well as those points of information
that are lacking.

%A Matthew J. Thazhuthaveetil
%T A Structured Memory Access Architecture for LISP
%R TR658
%I University of Wisconsin-Madison, Computer Sciences Department
%D August 1986
%K H02 T01

%A Udi Manber
%T Using Mathematical Induction to Design Computer Algorithms
%R TR660
%I University of Wisconsin-Madison, Computer Sciences Department
%D August 1986
%K AA08 AI11

%A M. A. Sridhar
%T Efficient Algorithms for Multiple Pattern Matching
%R TR661
%I University of Wisconsin-Madison, Computer Sciences Department
%D August 1986
%K O06

%A Charles V. Steward
%A Charles R. Dyer
%T A Scheduling Algorithm for the Pipelined Image-Processing Engine
%R TR664
%I University of Wisconsin-Madison, Computer Sciences Department
%D September 1986
%K AI06 H03

%A Nian Li
%A Leonard Uhr
%T Comparative Timings for a Neuron Recognition Program on Serial and
Pyramid Computers
%R TR665
%I University of Wisconsin-Madison, Computer Sciences Department
%D September 1986
%K AA10 AI06 H03
%X a system to recognize neurons in photomicrographs

%A Gilbert Verghese
%A Shekhar Mehta
%A Charles R. Dyer
%T Image Processing Algorithms for the Pipelined Image-Processing Engine
%R TR668
%I University of Wisconsin-Madison, Computer Sciences Department
%D September 1986
%K local peak detection median filtering thinning Hough transform photometric
stereo AI06 O06 H03

%A Mitali Bhattacharyya
%A David Cohrs
%A Barton Miller
%T Implementation of a Visual UNIX Process Connector
%R TR677
%I University of Wisconsin-Madison, Computer Sciences Department
%D December 1986
%X An environment for connecting several UNIX processes. Not specifically
AI related

%A Ze-Nian Li
%A Leonard Uhr
%T Pyramid Vision Using Key Features to Integrate Image-Driven Bottom-Up
and Model-Driven Top Down Processes
%R TR678
%I University of Wisconsin-Madison, Computer Sciences Department
%D December 1986
%K H03 AI06

%A Charles R. Dyer
%T Multiscale Image Understanding
%R TR679
%I University of Wisconsin-Madison, Computer Sciences Department
%D December 1986
%K texture AI06

%A G. T. Toussaint
%T Computational Geometry and Morphology
%R TR-SOCS-86.3
%I McGill University, School of Computer Science
%D February 1986
%K AA10 AI06 O06
%X applications of such algorithms as hulls, medial axis, geodesic
and visibility for polygons to understanding biological shape and shape
change.

%A R. De Mori
%A L. Lam
%A M. Gilloux
%T Learning and Plan Refinement in a Knowledge-Based System for Automatic
Speech Recognition
%R TR-SOCS-86.14
%I McGill University, School of Computer Science
%D May 1986
%K AI09 AI04 AI05
%X experimental work on recognition of connected letters by 100 speakers

%A Heedong Ko
%A Kunwoo Lee
%T Toward a Practical Planning System for Assembly Tasks
%R Department of Computer Science File 957
%I University of Illinois at Urbana-Champaign
%D September 1986
%K AA26

%A Carl Thomas Uhrik
%T A Rule Exerciser for Knowledge Base Enhancement in Expert Systems
%R Department of Computer Science File 969
%I University of Illinois at Urbana-Champaign
%D September 1986
%K AI01 O04 AA23 AA10
%X The system has been applied to soybean diagnosis and monkey behavior
discrimination

%A Kenneth D. Forbus
%A Dedre Gentner
%T Learning Physical Domains: Toward a Theoretical Framework
%R Department of Computer Science File 1247
%I University of Illinois at Urbana-Champaign
%D December 1986
%K AI08 AI04

%A Steven Greenbaum
%T Input Transformations and Resolution Implementation Techniques for
Theorem Proving in First-Order Logic
%R Department of Computer Science File 1298
%I University of Illinois at Urbana-Champaign
%D September 1986
%K AI11
%X the aim is opposed to solve small sized problem with little or no
human guidance as opposed to other systems which are designed to
solve large problems with human guidance. Uses priority-based search
strategy, discrimination networks and Knuth-Bendix method

%A Brian Falkenhainer
%T An Examination of the Third State in the Analogy Process: Verification-
Based Analogical Learning
%R Department of Computer Science File 1302
%I University of Illinois at Urbana-Champaign
%D October 1986
%K AI04 qualitative models liquid flow and heat flow

%A Y-L. Steve
%A Daniel D. Gajski
%T LES: A Layout Expert System
%R Department of Computer Science File 1308
%I University of Illinois at Urbana-Champaign
%D November 1986
%K AA04
%X A layout system that is competitive with human designers

%A Krish Purswani
%A Larry Rendell
%T A Probabilistic Reasoning-Based Approach to Machine Learning
%R Department of Computer Science File 1311
%I University of Illinois at Urbana-Champaign
%D December 1986
%K AI03 O04

%A Yoram Ofer Moses
%T Knowledge in a Distributed Environment
%R STAN-CS-86-1120
%I Stanford University Computer Science
%D March 1986
%K H03
%X Discusses the effects of unreliable communications on coordination
of an expert system, the Byzantine agreement problem and the "cheating
wives" puzzle
.br
br
15.00 104 pages

%A Glenn Douglas Rennels
%T A Computational Model of Reasoning from the Clinical Literature
%R STAN-CS-86-1122
%I Stanford University Computer Science
%D June 1986
%K AA01 AI01
%X discusses getting information from the clinical literature into
an AI system for patient care. Example problem is "breast cancer
management options."
.br
br
244 pages 15.00

%A H. Penny Nii
%T Blackboard Systems
%R STAN-CS-86-1123
%I Stanford University Computer Science
%D June 1986
%X general review of black board systems
.br
br
86 pages, 10.00

%A Daniel J. Scales
%T Efficient Matching Algorithms for the SOAR/OPS5 Production System
%R STAN-CS-86-1124
%I Stanford University Computer Science
%D June 1986
%K T03 AI01
%X 50 pages 10.00

%A Eric Schoen
%T The CAOS System
%R STAN-CS-86-1125
%I Stanford University Computer Science
%D March 1986
%K H03 O03
%X a real time Lisp distributed system for signal interpretations
.br
br
69 pages 10.00

%A Byron Davies
%T CAREL: A Visible Distributed Lisp
%R STAN-CS-86-1126
%I Stanford University Computer Science
%D March 1986
%K H02 H03 T01
%X A system programming language that runs on the TI Explorer that
includes real time display of the processor activity and data
communications; useful as an educational tool
.br
br
15 pages 5.00

%A Yonathan Malachi
%T A Timely Resolution
%R STAN-CS-86-1127
%I Stanford University Computer Science
%D March 1986
%K AI11 AI10 T01 T02 H03 TABLOG unification
%X 15.00 145 pages

%A Evan R. Cohn
%A Ramsey W. Haddad
%T Beta Operations: Efficient Implementation of a Primitive Parallel Operation
%R STAN-CS-86-1129
%I Stanford University Computer Science
%D August 1986
%K H03
%X The Beta Operation can be performed in O(log N + log **2 M) time
on a hypercube where N is the size of the input and M is the size
of the output.
.br
br
5.00, 18 pages

%A Vishvjit S. Nalwa
%A Thomas O. Binford
%T On Detecting Edges
%R STAN-CS-86-1130
%I Stanford University Computer Science
%D March 1986
%K AI06
%X Proposed method will localize edges to within a thilrd of a pixel
if step-size over noise ratio > 2.5
.br
br
50 pages 10.00

%A Yehoshua Sagiv
%T Optimizing Datalog Programs
%R STAN-CS-86-1132
%I Stanford University Computer Science
%D March 1986
%K AI10
%X Prolog programs without function symbols are optimized. Also defines
a new form of equivalence under which such programs can be compared.
.br
br
30 pages, 50.00

%A Richard James Treitel
%T Sequentialization of Logic Programs
%R STAN-CS-86-1135
%I Stanford University Computer Science
%D November 1986
%K AI10
%X 16 pages 15.00

%A Harold Brown
%A Erich Schoen
%A Bruce Delogi
%T An Experiment in Knowledge-based Signal Understanding Using Parallel
Architectures
%R STAN-CS-86-1136
%I Stanford University Computer Science
%D October 1986
%K H03 AA18 T01
%X System was tested on radar emissions from air craft
.br
br
36 pages 5.00

%A Ganesh C. Gopalakrishnan
%A Mandayam K. Srivas
%A David R. Smith
%T Hierarchical Design of VLSI Systems Using Algebraic Specifications and
Temporal Logic: On Automatic Synthesis of Controllers for VLSI Modules
From Their Functional Specifications
%R TR 86/01
%I Department of Computer Science, SUNY at Stony Brook
%D Jan 1986
%K AA04 AI11

%A Sanjay Manchanda
%A Suzanne Dietrich
%T Storing and Accessing Relations on Disk in a Prolog Database System
%R TR 86/08
%I Department of Computer Science, SUNY at Stony Brook
%D January 1986
%K AA09 T02

%A Michael Kifer
%A R. Lozinskii
%T Framework for an Efficient Implementation of Deductive Databases
%R TR 86/04
%I Department of Computer Science, SUNY at Stony Brook
%D February 1986
%K AA09

%A Saumya K. Debray
%T Mode Inference and Abstract Interpretation in Logic Programs
%R TR 86/05
%I Department of Computer Science, SUNY at Stony Brook
%D February 1986
%K AI11

%A Michael Kifer
%A E. Lozinskii
%T Can We Implement Logic as a Database System
%R TR 86/06
%I Department of Computer Science, SUNY at Stony Brook
%D February 1986
%K AI11 AA09

%A Ganesh C. Goplakrishnan
%A David Smith
%A Mandayam K. Srivas
%T From Algebraic Specifications to Correct VLSI Circuits
%R 86/13
%I Department of Computer Science, SUNY at Stony Brook
%D June 1986
%K AA04

%A Saumya K. Debray
%A Prateek Mishra
%T Denotational and Operational Semantics for Prolog
%R 86/15
%I Department of Computer Science, SUNY at Stony Brook
%D July 1986
%K T02 AA08

%A Sanjay Manchanda
%A David Scott Warren
%T Toward a Logical Theory of Database Updates
%R 86/19
%I Department of Computer Science, SUNY at Stony Brook
%D July 1986
%K AI11 AA09

%A R. Ramesh
%A R. M. Verma
%A T. Krishnaprasad
%A I. V. Ramakrishnan
%T Term Matching on Parallel Computer
%R 86/20
%I Department of Computer Science, SUNY at Stony Brook
%D August 1986
%K AI11 H03

%A Sanjay Manchanda
%A Soumitra Sengupta
%A David Scott Warren
%T Concurrent Updates in a Prolog Database Systems
%R 86/28
%I Department of Computer Science, SUNY at Stony Brook
%D Dec 1986
%K AA09 T02

%A Jieh Hsiang
%A Michael Rusinowitch
%T ON Word Problems in Equational Theories
%R 86/29
%I Department of Computer Science, SUNY at Stony Brook
%D December 1986
%K AI14

%A Anita Wasilewska
%T Definable Sets in Knowledge Representation Systems
%R 86/31
%I Department of Computer Science, SUNY at Stony Brook
%D December 1986
%K AI16

%A Anita Wasilewski
%T On Automatic Learning
%R 86/34
%I Department of Computer Science, SUNY at Stony Brook
%D December 1986
%K AI04

%A Chilukuri K. Mohan
%A Mandayam K. Srivas
%A Deepak Kapurm
%T On Proofs in System of Equations and Inequations
%R 87/02
%I Department of Computer Science, SUNY at Stony Brook
%D January 1987
%K AI14

%A Alexander Waibel
%T Prosody and Speech Recognition (Thesis)
%R CMU-CS-86-162
%I Carnegie Mellon Computer Sciences
%D 1986
%K AI05

%A Maurice P. Herlihy
%A Jeannette M. Wing
%T Axioms for Concurrent Objects
%R CMU-CS-86-154
%I Carnegie Mellon Computer Sciences
%D 1986
%K AA08

%A Michael C. Browne
%T An Improved Algorithm for the Automatic Verification of Finite
State Systems Using Temporal Logic
%R CMU-CS-86-156
%I Carnegie Mellon Computer Sciences
%D 1986
%K AA08

%A Andrew W. Appel
%A Guy J. Jacobson
%T The World's Fastest Scrabble Program
%R CMU-CS-86-153
%I Carnegie Mellon Computer Sciences
%D 1986
%K AA17 AI03

%A H. T. Kung
%A Jon A. Webb
%T Mapping Image Processing Operations onto a Linear Systolic Machine
%R CMU-CS-86-137
%I Carnegie Mellon Computer Sciences
%D 1986
%K H03 AI06 Warp FFT Hough Transform connected component labeling relaxation

%A Katsushi Ikeuchi
%T Generating an Interpretation Tree From a CAD Model to Represent
Object Configurations for Bin-Picking Trees
%R CMU-CS-86-144
%I Carnegie Mellon Computer Sciences
%D 1986
%K AI07 AA26

%A P. Helman
%A R. Veroff
%T Designing Deductive Databases
%R CS86-5
%I University of New Mexico Computer Sciences
%D 1986
%K AA09

%A James R. Slagle
%A Michael R. Wick
%A Marius O. Poliac
%T Agness: A Generalized Network-Based Expert System Shell
%R CSci TR86-48
%I University of Minnesota, Computer Science Department
%D 1986
%K T03

%A Valdis Berzins
%A Jeff Petty
%T The DB Lisp Code Analyzer
%R CSci TR 86-56
%I University of Minnesota, Computer Science Department
%D 1986
%K T01

%A Jik H. Chang
%A Oscar H. Ibarra
%A Ting-Chuen Pong
%A Stephen M. Sohn
%T Two-Dimensional Convolution on a Pyramid Computer
%R CSci TR87-1
%I University of Minnesota, Computer Science Department
%D 1987
%K AI06 H03

%A Ting-Chuen Pong
%T Matching Topographic Structures in Stereo Vision
%R CSci TR87-2
%I University of Minnesota, Computer Science Department
%D 1987
%K AI06

%A Thomas Kaczmarek
%A Raymond Bates
%A Gabriel Robins
%T Recent Developments in NIKL
%R ISI/RS-86-167
%I USC/Information Sciences Institute
%D November 1986
%K AI16
%X
NIKL (a New Implementation of KL-ONE) is one of the members of the KL-ONE
family of knowledge representation languages. NIKL has been in use for
several years and our experiences have led us to define and implement various
extensions to the language, its support environment and the implementation.
Our experiences are particular to the use of NIKL. However, the requirements
that we have discovered are relevant to any intelligent system that must
reason about terminology. This article reports on the extensions that we have
found necessary based on experiences in several different testbeds. The
motivations for the extensions and future plans are also presented.

%A Norman Sondheimer
%A Bernhard Nebel
%T A Logical-Form and Knowledge-Base Design for Natural Language Generation
%R ISI/RS-86-169
%I USC/Information Sciences Institute
%D November 1986
%K AI02
%X This paper presents a technique for interpreting output demands by a natural
language sentence generator in a formally transparent and efficient way.
These demands are stated in a logical language. A network knowledge base
organizes the concepts of the application domain into categories known to the
generator. The logical expressions are interpreted by the generator using the
knowledge base and a restricted, but efficient, hybrid knowledge
representation system. The success of this experiment has led to plans for
the inclusion of this design in both the evolving Penman natural language
generator and the Janus natural language interface.

%A William C. Mann
%A Sandra Thompson
%T Rhetorical Structure Theory:
Descripton and Construction of Text
%R ISI/RS-86-174
%I USC/Information Sciences Institute
%D October 1986
%X Rhetorical Structure Theory (RST) is a theory of text structure that is
being extended to serve as a theoretical basis for computational text
planning. Text structure in RST are hierarchic, built on small patterns
called schemas. The schemas which compose the structural hierarchy of a
text describe the functions of the parts rather than their form
characteristics. Relations between text parts, comparable to conjunctive
relations, are a prominent part of RST's definitional machinery.
.sp
sp
Recent work on RST has put it onto a new definitional basis. This paper
describes the current status of descriptive RST, along with efforts to
create a constructive version for use as a basis for programming a text
planner.

%A Donald Cohen
%T Automatic Compilation of Logical Specifications into Efficient Programs
%R ISI/RS-86-175
%I USC/Information Sciences Institute
%D November 1986
%K AA08
%X We describe an automatic programmer, or "compiler" which accepts as input a
predicate calculus specification of a set to generate or a condition to test,
along with a description of the underlying representation of the data. This
compiler searches a space of possible algorithms for the one that is expected
to be most efficient. We describe the knowledge that is and is not available
to this compiler, and its corresponding capabilities and limitations. This
compiler is now regularly used to produce large programs.

%A Jack Mostow
%A Bill Swartout
%T Towards Explicit Integration of Knowledge in Expert Systems
%R ISI/RS-86-176
%I USC/Information Sciences Institute
%D November 1986
%K AI16 O04 AA01 AI01
%X The knowledge integration problem arises in rule-based expert systems when
two or more recommendations made by right-hand sides of rules must be
combined. Current expert systems address this problem either by engineering
the rule set to avoid it, or by using a single integration technique built
into the interpreter, e.g., certainty factor combination. We argue that
multiple techniques are needed and that their use -- and underlying
assumptions -- should be made explicit. We identify some of the techniques
used in MYCIN's therapy selection algorithm to integrate the diverse goals it
attempts to satisfy, and suggest how knowledge of such techniques could be
used to support construction, explanation, and maintenance of expert systems.

%A M. Fanty
%T Context-free Parsing in Connectionist Networks
%R TR 174
%I University of Rochester Computer Science Department
%D November 1985
%K H03 O06
%X algorithm to convert any context-free grammar into a connectionist
network
.br
br
30 pages $1.25

%A D. H. Ballard
%T Interpolation Coding: A Representation for Numbers in Neural Nets
%R TR 175
%I University of Rochester Computer Science Department
%D May 1986
%K O04 H03 O06
%X also discusses a method of combining evidence in neural nets
.br
br
30 pages $1.25

%A J. Aloimonos
%A A. Basu
%T Determining the Translation of a Rigidly Moving Surface Without
Correspondence
%R TR176
%I University of Rochester Computer Science Department
%D January 1986
%K AI06
%X deal withs three dimensional translation of a textured object and uses
four cameras
.br
br
20 pages, $1.00

%A J. Aloimonos
%A I. Rigoutsos
%T Determining the Three-Dimensional Motion of a Surface Patch Without
Correspondence, Under Perspective Projection: (i) Planar Surfaces
(ii) Curved Surfaces
%R TR 178
%I University of Rochester Computer Science Department
%D December 1985
%K AI06 stereo 3-D
%X 35 pages, $1.50

%A J. F. Allen
%A P. J. Hayest
%T A Common-Sense Theory of Time
%R TR 180
%I University of Rochester Computer Science Department
%D February 1987
%K AI16
%X 32 pages, $1.50
.br
br
.br
br
Includes discussion of an axiomatization of time subsuming Allen's
interval-based theory.

%A D. B. Sher
%T Optimal
Likelihood Generators for Edge Detection Under Gaussian Additive Noise
%R TR 185
%I University of Rochester Computer Science Department
%D August 1986
%K O04 AI06
%X 9 pages, $0.75

%A D. Baldwin
%T A Model for Automatic Design of Digital Circuits
%R TR 188
%I University of Rochester Computer Science Department
%D July 1986
%K AA04
%X 25 pages $1.25
.br
br
discusses partitioning of design tasks into algorithmic and knowledge-based
parts

%A J. A. Feldman
%T Neural Representation of Conceptual Knowledge
%R TR 189
%I University of Rochester Computer Science Department
%D June 1986
%K AI12 AI16
%X 35 pages, $1.50
.br
br
discusses holographic models

%A R. P. Loui
%T A Presumptive System of Defeasible Inference
%R TR 190
%I University of Rochester Computer Science Department
%D May 1986
%K AI15
%X 20 pages, $1.25

%A R. P. Loui
%T Real Rules of Inference: Acceptance and Non-Monotonicity in AI
%R TR 191
%I University of Rochester Computer Science Department
%D SUMMER 1986
%K AI15
%X 59 pages $2.25

%A D. Sher
%T Evidence Combination Using Likelihood Generators
%R TR 192
%I University of Rochester Computer Science Department
%D January 1987
%K O04 AI16
%X 27 pages, $1.25

%A A. Mukherjee
%T Self-calibration Strategies for Robot Manipulators
%R TR 193
%I University of Rochester Computer Science Department
%D September 1986
%K AI07
%X 105 pages, $3.75, PH. D. Thesis

%A L. Hartman
%T Generating Motor Behavior
%R TR 195
%I University of Rochester Computer Science Department
%D October 1986
%K AI09 naive physics
%X 31 pages $1.50
.br
br
planning in a block world under naive physics axiomitization

%A S. Hollbach
%T Tinker Toy Recognition From 2D Connectivity
%R TR 196
%I University of Rochester Computer Science Department
%D October 1986
%K AI06
%X 22 pages, $1.25

%A D. Sher
%T Advanced Likelihood Generators for Boundary Detection
%R TR 197
%I University of Rochester Computer Science Department
%D January 1987
%K AI06 O04
%X 50 pages, $2.00

%A I. Rigoutsis
%T Homotopies: A Panacea or Just Another Method?
%R TR 201
%I University of Rochester Computer Science Department
%D December 1986
%K AI06 O06
%X discusses applications of a method for solving non-linear equations
and its applicability to computer vision.

%A Marek W. Lugowski
%T Computational Metabolism
%R 200
%I Indiana University Computer Science Department
%K AI16 AI08 AI06 AI04 dynamical locally-coupled bottom-up architecture
%X A new architecture for programming of dynamical systems. It consists of
a tessellation into processors which undergo pairwise swaps. Processors
come in several types; each type recognizes certain other ones. Recognition
events result either in processor state change or a 2-processor swap. Model
combines cellular automaton and connectionist featrures with probabilistic
computation. Intended application: representation and computation of metaphors.

%A Jacek Leszczylowski
%A David Schmidt
%T A Logic for Program Derivation and Verification
%R TR-CS-86-2
%I Kansas State University, Computing and Information Sciences Department
%K AI10 AI11 AA08

%A J. R. B. Cockett
%A J. Herrera
%T Prime Rule Based Methodologies Give Inadequate Control
%R CS-85-60
%I University of Tennessee - Knoxville, Computer Science Department
%K AI01 AA09

%A Janusz Kacprzyk
%A Andrzej Ziolkowski
%T Database Querying Schemes with Fuzzy Linguistic Quantifiers
%R CS-86-62
%I University of Tennessee - Knoxville, Computer Science Department
%K O04 AI02 AA09

%A Janusz Kacprzyk
%T Enhancing Algorithmic/Procedural "Human Consistency" of Control
Models by Using Some Representation of Common Sense Knowledge
%R CS-86-63
%I University of Tennessee - Knoxville, Computer Science Department
%K O04 AI13

%A Janusz Kacprzyk
%A Jerzy Holubiec
%T Towards a More Realistic Modeling of International Economic
Cooperation via Fuzzy Mathematical Programming and Cooperative Games
%R CS-86-64
%I University of Tennessee - Knoxville, Computer Science Department
%K AA11 O04

%A Janusz Kacprzyk
%A Cezary Iwanski
%T A Generalization of Discounted Multistage Decision Making and
Control Through Fuzzy Linguistic Quantifies: An Attempt to
Introduce Commonsense Knowledge
%R CS-86-66
%I University of Tennessee - Knoxville, Computer Science Department
%K O04 AI13

%A Stanley H. Smith
%A Mehmet Celenk
%T A New, Systematic Method for Color Image Analysis II. Computer
Implementation and Results
%R Tech. Rep. EE 8610
%I Stevens Institute of Technology, Electrical Engineering and
Computer Science Departments
%D March 1986
%K natural sceens AI06

%A Divyendu Sinha
%T Operations on Unimodal Possibility Distributions that Characterize
the Gray-Values of Images in the Fuzzy Settings Part I
%R Tech Rep. EECS 8614
%I Stevens Institute of Technology, Electrical Engineering and
Computer Science Departments
%D May 1986
%K AI06 O04

%A Divyendu Sinha
%T Operations on Unimodal Possibility Distributions that Characterize
the Gray-Values of Images in the Fuzzy Settings Part II
%R Tech Rep. EECS 8615
%I Stevens Institute of Technology, Electrical Engineering and
Computer Science Departments
%D May 1986
%K AI06 O04

%A Harrison E. Rowe
%A Jung G. Shin
%A Ta-Shing Chu
%T Radio Imaging of Launch Vehicles and Payloads
%R TECH. Rep. EECS 8617
%I Stevens Institute of Technology, Electrical Engineering and
Computer Science Departments
%D June 1986
%K AI06 AA27
%X discussed problems in receiving radio images such
as rain attenuation, clouds, etc.

%A John S. Conery
%T Closed Environments: Partitioned Memory Representation for Parallel Logic
Programming
%R CIS-TR-86-02
%I Computer and InformationScience Department, University of Oregon
%C Eugene, Oregon
%K AI11 H03

%A Kent A. Stevens
%A Daniel P. Lulich
%T Artifacts at the Limit of Resolution
%R CIS-TR-86-04
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06 AA10 AA01
%X A visual illusion which appears at the limit of resolution is used to
investigate perceived artifacts of the convolution by Gaussian filters.
Evidence is provided that implicate the smallest size operator at the
retina and that suggest that the perceived shape of intensity changes
is influenced by artifacts induced by the operator.

%A Kent A. Stevens
%A Allen Brookes
%T Integrating Stereopsis with Monocular Interpretations of Planar Surfaces
%R CIS-TR-86-05
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06 AA10 AA01

%A Kent A. Stevens
%A Allen Brookes
%T Probing Depth in Monocular Images
%R CIS-TR-86-06
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06 AA10 AA01

%A Stephen Fickas
%T Automating the Analysis Process
%R CIS-TR-08
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AA08
%X discusses the automation of requirements analysis

%A John Conery
%T Backward Execution in Nondeterministic AND-Parallel Systems
%R CIS-TR-86-09
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K H03 AI10

%A Kent A. Stephens
%A Allen Brooks
%T Detecting Structure by Symbolic Constructions on Tokens
%R CIS-TR-86-10
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06
%X discusses the interpretation of dot patterns, comparison of feature
detection structure-detection and energy-summation systems.

%A Allen Brookes
%A Kent A. Stevens
%T The Analogy Between Stereo Depth and Brightness Contrast
%R CIS-TR-86-11
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06 AI08 AA01 AA10

%A Virginia M. Lo
%A David Chen
%T Intelligent Scheduling in Distributed Computing Systems
%R CIS-TR-86-14
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K H03 AI01
%X applies expert system technology to task migration on distribution
systems including dealing with out of date system load tables

%A Kent A. Stevens
%A Allen Brookes
%T Theory of Depth Reconstruction in Stereopsis
%R CIS-TR-86-15
%I Computer and Information Science Department, Univerisity of Oregon
%C Eugene, Oregon
%K AI06 AI08 AA01 AA10