%A D. Partridge
%T Artificial Intelligence Applications in the Future of Software Engineering
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AA08 AI01
%X ISBN 0-20315-3 $34.95 241 pages

%A Richard Forsyth
%A Roy Rada
%T Machine Learning Applications in Expert Systems and Information Retrieval
%I John Wiley and Sons
%C New York
%D  1986
%K AT15 AA15 AI01 AI04
%X ISBN 0-20309-9 Cloth $49.95 , ISBN 0-20318-18 $24.95 paper 277 pages

%A W. John Hutchins
%T Machine Translation Past, Present and Future
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AI02
%X 380 pages 0-2031307 1986 $49.95

%A Karamjit S. Gill
%T Artificial Intelligence for Society
%I John Wiley and Sons
%C New York
%D 1986
%K O05 AT15
%X 280 pages 1-90930-0 1986 $34.95

%A Donald Michie
%T On Machine Intelligence
%I John Wiley and Sons
%C New York
%D 1986
%K AA17  AI07 AI08 AI01 AT15
%X 260 pages 0-20335-8 1986 $29.95

%A Chris Naylor
%T Building Your Own Expert System
%I John Wiley and Sons
%C New York
%D 1985
%K AI01 AT15
%X 249 pages 0-20172-X 1985 $15.95 paper

%A Peter Bishop
%T Fifth Generation Computers
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 GA01 GA02 GA03
%X 166 pages 0-20269-6 1986 $29.95

%A Jerry M. Rosenberg
%T Dictionary of Artificial Intelligence and Robotics
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AI16 AI07
%X 225 pages 1-08982-0 $24.95 cloth; 1-84981-2 $14.95 paper

%A Peter S. Sell
%T Expert Systems
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI01
%X 99 pages 0-20200-9 $14.95 paper

%A G. L. Simons
%T Expert Systems and Micros
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 H01 AI01
%X 247 pages 0-20277-7 $19.95 paper

%A G. L. Simons
%T Is Man a Robot?
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AI16 AI08
%X 200 pages 1-91106-2 $18.95 paper

%A G. L. Simons
%T Introducing Artificial Intelligence
%I John Wiley and Sons
%C New York
%D 1985
%K AT08 AT15 AI16
%X 281 pages 0-20166-5 $19.95 paper "completely non-technical"

%A Yoshiaki Shirai
%A Jun-Ichi Tsujii
%T Artificial Intelligence Concepts, Techniques and Applications
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 GA01 AI16
%X 177 pages 1-90581-X $19.95 "Drawn from the Fifth Generation Computer
Program"

%A Luc Steels
%A John A. Campbell
%T Progress in Artificial Intelligence
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI16 GA03
%X "Drawn Euopean Conference on AI"

%A Tohru Moto-Oka
%A Masaru Kitsuregawa
%T The Fith Generation Computer The Japanese Challenge
%I John Wiley and Sons
%C New York
%D 1985
%K GA01 AT15
%X 122 pages 1-90739-1 1985 $17.95 paper

%A Leonard Uhr
%T Parallel Multicomputers and Artificial Intelligence
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 H03
%X 150 pages 1-84979-0 $32.95

%A J. E. Hayes
%A Donald Michie
%T Intelligent Systems The Unprecedented Opportunity
%I John Wiley and Sons
%C New York
%D 1984
%K AT15 AI07 AA10 AA07
%X 206 pages 0-20139-8 1984 $19.95 paper

%A M. Yazdani
%A N. Narayanan
%T Artificial Intelligence: Human Effects
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 O05 AA07 AA01
%X 318 pages 0-20239-4 1985 $27.95

%A Richard Ennals
%T Artificial Intelligence: Approaches to Logical Reasoning and Historical
Research
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AA11 AA25 AA07 T02
%X 172 pages 0-20181-9 1985 $29.95

%A S. Torrance
%T The Mind and The Machine
%I John Wiley and Sons
%C New York
%D 1984
%K AT15 AI16 AA08
%X 213 pages 0-20104-5 1984 $31.95

%A Stuart C. Shapiro
%T Encyclopedia of Artificial Intelligence
%I John Wiley and Sons
%C New York
%D 1987
%K AT15 AI16
%X 1500 pages 8.5" by 11" in two volumes 1-80748-7 due out May 1, 1987
$149.95 until Sep 1, 1987 and $175.00 thereafter

%A Stephen H. Kaisler
%T Interlisp The Language and its Usage
%I John Wiley and Sons
%C New York
%D 1986
%K T01 AT15
%X 1,144 pages 1-81644-2 1986 $49.95

%A Christian Queinnec
%T Lisp
%I John Wiley and Sons
%C New York
%D 1985
%K T01 AT15
%X 156 pages 0-20226-2 1985 $15.95 paper (translated by Tracy Ann Lewis)

%A J. A. Campbell
%T Implementations of Prolog
%I John Wiley and Sons
%C New York
%D 1984
%K T02 T01 AT15
%X 391 pages 0-20045-6 1984 $32.95 paper

%A W. D. Burnham
%A A. R. Hall
%T Prolog Programming and Applications
%I John Wiley and Sons
%C New York
%D 1985
%K T02 AT15
%X 114 pages 0-20263-7 1985 $16.95 paper

%A Deyi Li
%T A Prolog Database System
%I John Wiley and Sons
%C New York
%D 1984
%K T02 AA09 AT15
%X 207 pages 1-90429-5 1984

%A Rosalind Barrett
%A Allan Ramsay
%A Aaron Sloman
%T Pop-11 A Practical Language for Artificial Intelligence
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI01 AI05 AI06
%X 232 pages 0-20237-8 1985 $19.95

%A Hugh de Saram
%T Programming in Micro-Prolog
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 T02
%X 166 pages 0-20218-1 1985 $21.95 paper

%A Brian Sawyer
%A Dennis Foster
%T Programming Expert Systems in Pascal
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AI01 H01
%X 200 pages 1-84267-2 1986 $19.95 paper

%A Brian Sawyer
%A Dennis Foster
%T Programming Expert Systems in Modula-2
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 AI01
%X 224 pages 1-85036-5 1986 $24.95 paper

%A K. Sparck-Jones
%A Y. Wilks
%T Automatic Natural Language Parsing
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI02
%X 208 pages 0-20165-7 1985 $24.95 paper

%A C. S. Millish
%T Compiler Interpretation of Natural Language Descriptions
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI02
%X 182 pages 0-20219-x 1985 $24.95

%A M. Wallace
%T Communicating with Databases in Natural Language
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AA09 AI02
%X 170 pages 0-20105-3 1984 $31.95

%A Mike James
%T Classification Algorithms
%I John Wiley and Sons
%C New York
%D 1986
%K AT15 O06
%X 209 pages 1-84799-2 1986 $34.95

%A Satosi Watanabi
%T Pattern Recognition: Human and Mechanical
%I John Wiley and Sons
%C New York
%D 1985
%K AT15 AI06 AI08
%X 352 pages 1-80815-6 1985 $44.95
.br
"Shows that all the known pattern recognition algorithms can be derived
from the principle of minimum entropy."

%A Donald A. Norman
%A Stephen W. Draper
%T User Centered System Design
%I Lawrence Erlbaum Associates Inc.
%C Hillsdale, NJ
%D 1986
%K AI02
%X 1986 544 pages 0-89859-872-9 paper prepaid $19.95

%A Robert J. Baron
%T The Cerebral Computer
%I Lawrence Erlbaum Associates Inc.
%C Hillsdale, NJ
%K AT15 AI08

%T Portrait: DFG Special Research Topic "Artificial Intelligence"
%J Die Umschau
%V 86
%N 9
%D September 1986
%K AI16 AT08
%X German, Abstract in English and German

%A P. Freyberger
%A P. Kampmann
%A G. Schmidt
%T A Knowledged [sic] Based Navigation Method for Autonomous
Mobile Robots (german)
%J Robotersysteme
%V 2
%N 3
%D 1986
%P 149-162
%K AI07 AA19
%X German

%A P. M. Frank
%A N. Becker
%T Robot Activation with A Directed, fixing and Object-Extracting Camera
for Data Reduction
%J Robotersysteme
%V 2
%N 3
%D 1986
%P 188
%K AI07 AI06
%X German

%A William J. Palm
%A Ramiro Liscano
%T Integrated Design of an End Effector for a Visual Servoing Algorithm
%J Journal of Robotic Systems
%V 3
%N 3
%D Autumn 1986
%P 221-236
%K AI07 AI06

%A K. Cheng
%A M. Idesawa
%T A Simplified Interpolation and Conversion Method of Contour Surface Model to
Mesh Model
%J Journal of Robotic Systems
%V 3
%N 3
%D Autumn 1986
%P 249-258
%K AI07 AI06

%A Genichiro Kinoshita
%A Masanori Idesawa
%A Shigeo Naomi
%T Robotic Range Sensor with Project of Bright Ring Pattern
%J Journal of Robotic Systems
%V 3
%N 3
%D Autumn 1986
%P 249-258
%K AI07 AI06

%A M. G. Thomason
%A E. Granum
%A R. E. Blake
%T Experiments in Dynamic Programming Inference of Markov Networks with Strings
Representing Speech Data
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 343-352
%K AI05

%A M. Juhola
%T A Syntactic Method for Analysis of Saccadic Eyeme Movements
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 353-360
%K AA10

%A H. D. Cheng
%A K. S. Fu
%T Algorithm Partition and Parallel Recognition of General Context-Free
Languages using Fixed-size VLSI Architecture
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 361-372
%K AI06 H03 O06

%A E. S. Baugher
%A A. Rosenfeld
%T Boundary Localication in an Image Pyramid
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 373-396
%K AI06 H03

%A E. A. Parrish
%A W. E. McDonald, Jr
%T An Adaptive Pattern Analysis System for Isolating EMI
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 397-406
%K AA04 AI06

%A E. Tanaka
%A T. Toyama
%A S. Kawai
%T High Speed Error Correction of Phoneme Sequences
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 407-412
%K AI05

%A K. Jajuga
%T Bayes Classification Rule for the General Discrete Case
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 413-416
%K O04

%A N. N. Abdelmalek
%T Noise Filtering in Digital Images and Approximation Theory
%J Pattern Recognition
%V 19
%N 5
%D 1986
%P 417
%K AI06

%A S. R. T. Kumara
%A S. Hoshi
%A R. L. Kashyap
%A C. L. Moodie
%A T. C. Chang
%T Expert Systems in [sic]
%J International Journal of Production Research
%V 24
%N 5
%D September-October 1986
%P 1107-1126
%K AI01

%A H. Lipkin
%A L. E. Torfason
%A J. Duffy
%T Efficient Motion Planning for a Planar Manipulator Based on Dexterity
and Workspace Geometry
%J International Journal of Production Research
%V 24
%N 5
%D September-October 1986
%P 1235
%K AI06 AI09

%A R. R. Yager
%T A Characterization of the Extension Principle
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 205-218
%K O04

%A J. F. Baldwin
%T Automated Fuzzy and Probabilistic Inference
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 219-236
%K O04 AI01

%A A. F. Blishun
%T Fuzzy Adaptive Learning Model of Decision-Making Process
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 273-282
%K O04 AI13 AI04

%A A. O. Esobgue
%T Optimal Clustering of Fuzzy Data via Fuzzy Dynamic
Programming
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 283-298
%K O04 O06

%A J. Kacprzyk
%T Towards 'Human-Consistent' Mulstistage Decision Making
and Control Models Using Fuzzy Sets and Fuzzy Logic
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 299-314
%K O04 AI08 AI13

%A B. R. Gaines
%A M. L. G. Shaw
%T Induction of Inference Rules for Expert Systems
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 315-328
%K AI04 AI01 O04

%A M. Sugeno
%A G. T. Kang
%T Fuzzy Modeling and Control of Multilayer Incinerator
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 329-346
%K O04 AA20

%A Peizhuang Wang
%A Xihu Liu
%A E. Sanchez
%T Set-valued Statistics and its Application to Earthquake Engineering
%J Fuzzy Sets and Systems
%V 18
%N 3
%D April 1986
%P 347
%K O04 AA05

%A J. L. Mundy
%T Robotic Vision
%B Advances in Automation and Robotics
%V 1
%I JAI Press
%D 1985
%C Greenwich, Connecticut
%P 141-208
%K AI06 AI07

%A R. Bajcsy
%T Shape from Touch
%B Advances in Automation and Robotics
%V 1
%I JAI Press
%D 1985
%C Greenwich, Connecticut
%P 209-258
%K AI06 AI07

%A T. M. Husband
%T Education and Training in Robotics
%I IFS Publications Ltd
%C Bedford
%D 1986
%K AI06 AT15 AT18
%X multiple articles, 315 pages $54.00 ISBN 0-948507-04-7

%A N. Y. Foo
%T Dewey Indexing of Prolog Traces
%J The Computer Journal
%V 29
%N 1
%D February 1986
%P 17-19
%K T02

%A M. E. Dauhe-Witherspoon
%A G. Muehllehner
%T An Iterative Image Space Reconstruction Algorithm Suitable for Volume ECT
%J IEEE Trans on Med. Imaging
%V 5
%N 2
%D June 1986
%P 61-66
%K AA01 AI06

%A B. Zavidovique
%A V. Serfaty-Dutron
%T Programming Facilities in Image Processing
%J COMPINT 85
%D 1985
%P 804-806
%K AI06

%A J. R. Ward
%A B. Blesser
%T Methods for Using Interactive Hand-print Character Recognition for Computer I
nput
%J COMPINT 85
%D 1985
%P 798-803
%K AI06

%A Y. Tian-Shun
%A T. Yong-Lin
%T The Conceptual Model for Chinese Language Understanding and its Man-Machine
Paraphrase
%J COMPINT 85
%D 1985
%P 795-797
%K AI02

%A G. Sabah
%A A. Vilnat
%T A Question Answering System which Tries to Respect Conversational Rules
%J COMPINT 85
%D 1985
%P 781-785
%K AI02

%A J. Rouat
%A J. P. Adoul
%T Impact of Vector Quantization for Connected Speech Recognition Systems
%J COMPINT 85
%D 1985
%P 778-780
%K AI05

%A G. G. Pieroni
%A O. G. Johnson
%T A Methodology Visual Recognition of Waves in a Wave Field
%J COMPINT 85
%D 1985
%P 774-77
%K AI06

%A G. J. McMillan
%T Vimad: A Voice Interactive Maintenance Aiding Device
%J COMPINT 85
%D 1985
%P 768-771
%K AI05 AA21

%A D. Laurendeau
%A D. Poussart
%T A Segmentation Algorithm for Extracting 3D Edges from Range Data
%J COMPINT 85
%D 1985
%P 765-767
%K AI06

%A F. Kimura
%A T. Sata
%A K. Kikai
%T A Fast Visual Recognition System of Mechanical Parts by Use of Three
Dimensional Model
%J COMPINT 85
%D 1985
%P 755-759
%K AI06  AA05 AA26

%A M. L. G. Shaw
%A B. R. Gaines
%T The Infrastructure of Fifth Generation Computing
%J COMPINT 85
%D 1985
%P 747-751
%K GA01 AT19

%A W. Doster
%A R. Oed
%T On-line Script Recognition - A Userfriendly Man Machine Interface
%J COMPINT 85
%D 1985
%P 741-743
%K AI06 AA15

%A R. Descout
%T Applications of Speech Technology A Review of the French Experience
%J COMPINT 85
%D 1985
%P 735-740
%K AI05 GA03

%A Y. Ariki
%A K. Wakimoto
%A H. Shieh
%A T. Sakai
%T Automatic Transformation of Drawing Images Based on Geometrical Structures
%J COMPINT 85
%D 1985
%P 719-723
%K AI06 AA05

%A Z. X. Yang
%T On Intelligent Tutoring System for Natural Language
%J COMPINT 85
%D 1985
%P 715-718
%K AI02 AA07

%A L. Xu
%A J. Chen
%T Autobase: A System which Automatically Establishes the Geometry Knowledge
Base
%J COMPINT 85
%D 1985
%P 708-714
%K AI01 AA13

%A G. Pask
%T Applications of Machine Intelligence to Education, Part I Conversation
System
%J COMPINT 85
%D 1985
%P 682
%K AI02 AA07

%A Y. H. Jea
%A W. H. Wang
%T A Unified Knowledge Representation Approach in Designing an Intelligent
tutor
%J COMPINT 85
%D 1985
%P 655-657
%K AA07 AI16

%A I. M. Begg
%T An Intelligent Authoring System
%J COMPINT 85
%D 1985
%P 611-613
%K AA07

%A J. C. Perex
%A R. Castanet
%T Intelligent Robot Simulation System: The Vision Guided Robot Concept
%J COMPINT 85
%D 1985
%P 489-492
%K AI06 AI07

%A B. Mack
%A M. M. Bayoumi
%T An Ultrasonic Obstacle Avoidance System for a Unimate Puma 550 Robot
%J COMPINT 85
%D 1985
%P 481-483
%K AI06 AI07

%A R. A. Browse
%A S. J. Lederman
%T Feature-Based Robotic Tactile Perception
%J COMPINT 85
%D 1985
%P 455-458
%K AI06 AI07

%A R. S. Wall
%T Constrained Example Generation for VLSI Design
%J COMPINT 85
%D 1985
%P 451-454
%K AA04

%A L. P. Demers
%A C. Roy
%A E. Cerney
%A J. Gecsei
%T Integration of VLSI Symbolic Design Tools
%J COMPINT 85
%D 1985
%P 308-312
%K AA04

%A R. Wilson
%T From Signals to Symbols - The Inference Structure of Perception
%J COMPINT 85
%D 1985
%P 221-225
%K AI08 AI06

%A C. Hernandex
%A A. Alonso
%A J. E. Arias
%T Computerized Monitoring as an Aid to Obstetrical Decision Making
%J COMPINT 85
%D 1985
%P 203-206
%K AA01

%A M. M. Gupta
%T Approximate Reasoning  in the Evolution of Next Generation of Expert
Systems
%J COMPINT 85
%D 1985
%P 201-202
%K O04 AI01

%A W. Wei-Tsong
%A P. Wei-Min
%T An Effective Searching Approach to Processing Broken Lines in an
Image
%J COMPINT 85
%D 1985
%P 198-200
%K AI06

%A J. F. Sowa
%T Doing Logic on Graphs
%J COMPINT 85
%D 1985
%P 188
%K AI16

%A P. T. Cox
%A T. Pietrxykowski
%T Lograph: A Graphical Logic Programming Language
%J COMPINT 85
%D 1985
%P 145-151
%K AI10

%A D. A. Thomas
%A W. R. Lalonde
%T ACTRA The Design of an Industrial Fifth Generation Smalltalk
%J COMPINT 85
%D 1985
%P 138-140

%A Y. Wada
%A Y. Kobayashi
%A T. Mitsuta
%A T. Kiguchi
%T A Knowledge Based Approach to Automated Pipe-Route Planning in Three-
Dimensional Plant Layout Design
%J COMPINT 85
%D 1985
%P 96-102

%A N. P. Suh
%A S. H. Kim
%T On an Expert System for Design and Manufacturing
%J COMPINT 85
%D 1985
%P 89-95
%K AA26 AA05

%A C. Y. Suen
%A A. Panoutsopoulos
%T Towards a Multi-lingual Character Generator
%J COMPINT 85
%D 1985
%P 86-88
%K AI02

%A K. Shirai
%A Y. Nagai
%A T. Takezawa
%T An Expert System to Design Digital Signal Processors
%J COMPINT 85
%D 1985
%P 83-85
%K AI01 AA04

%A D. Sriram
%A R. Banares-Alcantara
%A V. Venkatasubramnian
%A A. Westerberg
%A M. Rychener
%T Knowledge-Based Expert Systems for Chemical Engineering
%J COMPINT 85
%D 1985
%P 79-82
%K AI01 AA05

%A P. Savard
%A G. Bonneau
%A G. Tremblay
%A R. Cardinal
%A A. R. Leblanc
%A P. Page
%A R. A. Nadeau
%T Interactive Electrophysiologic Mapping System for On-Line Analysis of
Cardiac Activation Sequences
%J COMPINT 85
%D 1985
%P 76-78
%K AA01

%A R. Bisiani
%T VLSI Custom Architectures for Artificial Intelligence
%J COMPINT 85
%D 1985
%P 27-31

%A L. H. Bouchard
%A L. Emirkanian
%T A Formal System for the Relative Clauses in French and its  Uses in
CAL
%J COMPINT 85
%D 1985
%P 32-34
%K AI02 AA07

%A G. Bruno
%A A. Elia
%A P.  Laface
%T A Rule-Based System for Production Scheduling
%J COMPINT 85
%D 1985
%P 35-39
%K AA05 AI01

%A J. F. Cloarec
%A J. P. Cudelou
%A J. Collet
%T Modeling Switching System Specifications as a Knowledge Base
%J COMPINT 85
%D 1985
%P 40-44
%K AA04

%A B. R. Gaines
%A M. L. G. Shaw
%T Knowledge Engineering for Expert Systems
%J COMPINT 85
%D 1985
%P 45-49
%K AI01

%A B. Hardy
%A P. Bosc
%A A. Chauffaut
%T A Design Environment for Dialogue Oriented Applications
%J COMPINT 85
%D 1985
%P 53-55

%A P. Haren
%A M. Montalban
%T Prototypical Objects for CAD Expert Systems
%J COMPINT 85
%D 1985
%P 53-55
%K AA05  AI01 AI16

%A S. J. Mrchev
%T A Unit Imitating the Functions on the Human Operative Memory
%J COMPINT 85
%D 1985
%P 56-67
%K AI08

%A B. Phillips
%A S. L. Messick
%A M. J. Freiling
%A J. H. Alexander
%T INKA: The INGLISH Knowledge Acquisition Interface for Electronic
Instrument Troubleshooting Systems
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 676-682
%K AA04 AI02 AA21

%A D. V. Zelinski
%A R. N. Cronk
%T The ES/AG Environment-Its Development and Use in Expert System Applications
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 671-675
%K AI01 T03

%A K. H. Wong
%A F. Fallside
%T Dynamic Programming inthe Recognition of Connected Handwritten Script
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 666-670
%K AI06

%A V. R. Waldron
%T Process Tracing as a Method for Initial Knowledge Acquisition
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 661-665
%K AI01 AI16

%A H. Van Dyke Parunak
%A B. W. Irish
%A J. Kindrick
%A P. W. Lozo
%T Fractal Actors for Distributed Manufacturing Control
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 653-660
%K H03 AA26

%A W. K. Utt
%T Directed Search with Feedback
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 647-652
%K AI03

%A J. T. Tou
%A C. L. Huang
%T Recognition of 3-D Objects Via Spatial Understanding of 2-D Images
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 641-646
%K AI06

%A P. Snow
%T Tatting Inference Nets with Bayes Theorem
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 635-640
%K AI16 O04

%A Y. Shoham
%T Reasoning About Causation in Knowledge-Based Systems
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 629-634
%K AI16

%A H. C. Shen
%A G. F. P. Signarowski
%T A Knowledge Representation for Roving Robots
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 629-634
%K AI07 AI16 AA19

%A D. Schwartz
%T One Cornerstone in the Mathematical Foundations for a System of Fuzzy-
Logic Programming
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 618-620
%K AI10 O04

%A P. R. Schaefer
%A I. H. Bozma
%A R. D. Beer
%T Extended Production Rules for Validity Maintenance
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 613-617
%K AI01 AI15

%A M. C. Rowe
%A R. Keener
%A A. Veitch
%A R. B. Lantz
%T E. T. Expert Technician/Experience Trapper
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 607-612
%K AA04 AA21

%A C. E. Riese
%A S. M. Zubrick
%T Using Rule Induction to Combine Declarative and Procedural Knowledge
Representations
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 603-606
%K AI16

%A D. S. Prerau
%A A. S. Gunderson
%A R. E. Reinke
%A S. K. Goyal
%T The COMPASS Expert System: Verification, Technology Transfer, and
Expansion
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 597-602
%K AI01

%A B. Pinkowski
%T A Lisp-Based System for Generating Diagnostic Keys
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 592-596
%K T01 AA21

%A S. R. Mukherjee
%A M. Sloan
%T Positional Representation of English Words
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 587-591
%K AI02

%A J. H. Martin
%T Knowledge Acquisition Through Natural Language Dialogue
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 582-586
%K AI01 AI02

%A D. M. Mark
%T Finding Simple Routes; "Ease of Description" as an Objective Function
in Automated Route Selection
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 577-581

%A S. Mahalingam
%A D. D. Sharma
%T WELDEX-An Expert System for Nondestructive Testing of Welds
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 572-576
%K AI01 AA05  AA21

%A J. Liebowitz
%T Evaluation of Expert Systems: An Approach and Case Study
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 564-571
%K AI01

%A S. J. Laskowski
%A H. J. Antonisse
%A R. P. Bonasso
%T Analyst II: A Knowledge-Based Intelligence Support System
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 558-563
%K AA18

%A Ronald Baecker
%A william Buxton
%T Readings in Human-Computer Interaction: A Multidisciplinary Approach
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%X 650 pages ISBN 0-934613-24-9 paperbound $26.95

%T Proceedings: Graphics Interface '86/Vision Interface '86
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AI06
%X 402 pages paper bound ISSN 0713-5424 $35.00

%A Peter Politakis
%T Empirical Analysis for Expert Systems
%I Morgan Kaufmann
%C Los Altos, California
%D 1985
%K AI01 AA01 rheumatology
%X 187 pages paperbound ISBN 0-273-08663-4 $22.95
.br
Describes SEEK which was used to develop an expert system for
rheumatology

%A David Brown
%A B. Chandrasekaran
%T Design Problem Solving: Knowledge Structures and Control Strategies
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AA05
%X 200 pages paperbound ISBN 0-934613-07-9 $22.95

%A W. Lewis Johnson
%T Intention-Based Diagnosis of Errors in Novice Programs
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AA07 AA08 Proust
%X 1986, 333 pages, ISBN 0-934613-19-2

%A Etienne Wenger
%T Artificial Intelligence and Tutoring Systems: Computational Approaches
to the Communication of Knowledge
%I Morgan Kaufmann
%C Los Altos, California
%D Winter 1986-1987
%K AA07 AI02
%X 350 pages, hardbound, ISBN 0-934613-26-5

%A John Kender
%T Shape  From Texture
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AI06
%X paperbound, ISBN 0-934613-05-2 $22.95

%A David Touretzky
%T The Mathematics of Inheritance Systems
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AI16
%X paperbound, 220 pages, ISBN 0-934613-06-0 $22.95

%A Ernest Davis
%T Representing and Acquiring Geographic Knowledge
%I Morgan Kaufmann
%C Los Altos, California
%D 1986
%K AI16
%X paperbound, 240 pages, ISBN 0-934613-22-2 $22.95

%A Paul A. Eisenstein
%T Detroit Finds Robots Aren't Living Up to Expectations
%J Investor's Daily
%D April 21, 1986
%P 12
%K AI07 Chrysler General Motors AA25
%X Chrysler said that automation was one of the major reasons productivity
doubled since 1980.  GM's Lake Orion, a "factory of the future" with 157
automated robots instead of providing the best quality and productivity of
any GM plant is providing the lowest.
Two other plants have been giving GM the same problems.

%A Mary Petrosky
%T Expert Software Aids Large System Design
%J InfoWorld
%V 8
%N 7
%D February 17, 1986
%P 1+
%K AA08 AI01 H01 AT02 AT03 Arthur Young Knowledge Ware
%X Knowledge-Ware is selling the Information Engineering Workbench
which provides tools to support developing business programs.  It has
features for supporting entity diagrams, data flow diagrams, etc.  I
cannot find any indication from this article where AI is actually
used.

%A John Gantz
%T No Market Developing for Artificial Intelligence
%J InfoWorld
%V 8
%N 7
%D February 17, 1986
%P  27
%K AT04 AT14
%X D. M. Data predicts that the market for AI software will be $605
million this year and $2.65 billion in 1990.  Arthur D. Little says it
might be twice this.  He argues that when you look at the companies, most
of them are selling primarily to research market and not to the commercial
data processing market.  Intellicorp had 3.3 million in revenues for the 1984-
1985 fiscal year and it made a profit.  However, a full third of its systems
go to academics and 20 percent goes to Sperry for use in its own AI labs.

%A Jay Eisenlohr
%T Bug Debate
%J InfoWorld
%V 8
%N 7
%D February 17, 1986
%P 58
%K AT13 AT12 Airus AI Typist AT03
%X Response to harsh review of AI Typist by Infoworld from an employee
of the company selling it.

%A Eddy Goldberg
%T AI offerings Aim to Accelerate Adoption of Expert Systems
%J Computerworld
%V 20
%N 21
%D May 26, 1986
%P 24
%K Teknowledge Carnegie Group Intel Hypercube Gold Hill Common Lisp AT02
H03 T03 T01
%X Teknowledge has rewritten S.1 in the C language.  Intel has introduced
Concurrent Common Lisp for its hypercube based machine

%T New Products/Microcomputers
%J Computerworld
%V 20
%N 21
%D May 26, 1986
%P  94
%K AT04 AI06 H01 Digital Vision Computereyes
%X Digital Vision introduced Computereyes video acquisition system for IBM PC.
Cost is $249.95 without camera and $529.95 with one.

%T New Products/Software and Services
%J Computerworld
%V 20
%N 21
%D May 26, 1986
%P 90
%K T03 AT02
%X LS/Werner has introduced a package containg four expert system tools for
$1995.  A guide to AI is also included.

%A Douglas Barney
%T AT&T Conversant Systems Unveils Voice Recognition Model
%J ComputerWorld
%V 20
%N 16
%D April 21, 1986
%P 13
%K AI05 AT02
%X AT&T Conversant systems has two products to do speech recognition, the
Model 80 which handles 80 simultaneous callers for $50,000 to $100,000 while
the Model 32 costs between $25,000 and $50,000 and handles 32 simultaneous
callers.  It handles "yes," "no" and the numbers zero through nine.

%A Charles Babcock
%A James Martin
%T MSA Users Give High Marks, Few Dollars to Information Expert
%J ComputerWorld
%V 20
%N 16
%D April 21, 1986
%P 15
%K AA06 AT03
%X MSA has a product called Information Expert which integrates a variety
of business applications through a shared dictionary and also provides
reporting.  However the 'expert system components' failed to live up
to the "standard definition of expert systems."

%A Alan Alper
%T IBM Trumpets Experimental Speech Recognition System
%J ComputerWorld
%V 20
%N 16
%D April 21, 1986
%P 25+
%K AI05 H01 Dragon Systems Kurzweil Products
%X IBM's speech recognition system can recognize utterances in real time
from a 5000 word pre-programmed vocabulary and can transcribe sentences
with 95 per cent accuracy.  The system may become a product.  It can handle
office correspondence in its present form.  The system requires that the
user speaks slowly and with pauses. The system runs on a PC/AT with specialized
speech recognizing circuits.  Kurzweil Applied Intelligence has a system
with a 1000 word recognition system selling for $65,000 that has been delivered
to several hundred customers.  They have working prototypes of systems with
5000 word vocabularies which requires only a 1/10 of a second pause.  Dragon
Systems has a system that can recognize up to 1000 words.

%A Stephen F. Fickas
%T Automating the Transformational Development of Software
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1268-1277
%K AA08 Glitter  package routing
%X Describes a system to automate the selection of transformations to
be applied in creating a program from a specification.  Goes through an
example to route packages through a network consisting of binary trees.

%A Douglas R. Smith
%A Goirdon B. Kotik
%A Stephen J. Westwold
%T Research on Knowledge-Based Software Environments at Kestrel Institute
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1278-1295
%K AA08 CHI
%X Describes the CHI project.  REFINE, developed by Reasoning Systems Inc.,
is based onthe principles and ideas demonstrated in the CHI prototype.
CHI has bootstrapped itself.  This system is a transformation based
system.  The specification language, V,
takes 1/5 to 1/10 the number
of lines as the program being specified if it was written in LISP.

%A Richard C. Waters
%T The Programmer's Apprentice: A Session with KBEmacs
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1296-1320
%K AA08 Ada Lisp
%X This system, which uses plans to work hand-in-hand with a programmer
in constructing a piece of software is now being used to work with
ADA programs.   The example used is that of a simple report.  Currently,
KBEmacs knows only a few dozen types of plans out of a few hundred to a
few thousand for real work.  Some operations take five minutes, but it is
expected that a speedup by a factor of 30 could be done by straightforward
operations. It is currently 40,000 lines of LISP code.

%A David R. Barstow
%T Domain-Specifific Automatic Programming
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1321-1336
%K AA08 AA03 well-log Schlumberger-Doll
%X This system describes a system to write programs to do
well-log interpretation.  This system contains knowledge about well-logs
as well as programming.

%A Robert Neches
%A William R. Swartout
%A Johanna D. Moore
%T Enhanced Maintenance and Explanation of Expert Systems Through Explicit
Models of Their Development
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1337-1350
%K AA08 AI01
%X Describes a system for applying various transformations to improve
readability of a LISP program.  Also discusses techniques for providing
explanation of the operation of the LISP machine by looking at data
structures created as the expert system is built

%A Elaine Kant
%T Understanding Automating Algorithm Design
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1361-1374
%K AA08 AI08
%X protocol analysis on algorithm designers faced with the convex hull
problem.  Discussion of AI programs to design algorithms.

%A David M. Steier
%A Elaine Kant
%T The Roles of Execution and Analysis in Design
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1375-1386
%K AA08

%A J. Doyle
%T Expert Systems and the Myth of Symbolic Reasoning
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1386-1390
%K AI01 O02
%X compares traditional application development software engineering approaches
with those taken by the AI community

%A P. A. Subrahmanyam
%T The "Software Engineering" of Expert Systems: Is Prolog Appropriate?
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1391-1400
%K T02 O02 AI01
%X discusses developing expert systems in PROLOG

%A Daniel G. Bobrow
%T If Prolog is the Answer, What is the Question? or What it Takes to
Support AI Programming Paradigms
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 1401-1408
%K T02 AI01

%T Japanese Urge Colleges to Teach Programmers
%J InfoWorld
%V 8
%N 15
%D April 14, 1986
%P 18
%K GA01
%X "A panel of experts at the Japanese Ministry of Education has urged that
enrollment in computer software-related departments at Japanese universities
and colleges be doubled by 1992.  The panel hopes to ensure that more systems
engineers and software specialists are trained to offset the shortage of
Japanese programmers.  An estimated 600,000 additional programmers will be
needed by 1990, the panel projected."

%T Germans Begin AI Work with $53 Million Grant
%J InfoWorld
%V 8
%N 15
%D April 14, 1986
%P 18
%K GA03
%K Siemens West Germany GA03 AT19
%X The Wester German government will be giving $53.8 million in grants for AI
research.

%T Resources
%J InfoWorld
%V 8
%N 15
%D April 14, 1986
%P 19
%X New newsletter: "AI capsule", costing $195 a year for 12 issues
Winters Group, Suite 920 Building, 14 Franklin Street, Rochester New York 14604

%T Image-Processing Module Works like a VMEBUS CPU
%J Electronics
%V 59
%N 24
%D June 16, 1986
%P 74
%K AI06 AT02 Datacube VMEbus Analog Devices
%X Product Announcement: VMEbus CPU card containing a digital signal-processing
chip supporting 8 MIPS

%T Robot Info Automatically
%J IEEE Spectrum
%V 23
%N 1
%D January 1986
%P 96
%K AT09 AT02 AI07
%X  Robotics database available on diskette of articles on robots.
Cost $90.00 per year, "Robotics Database, PO BOX 3004-17 Corvallis, Ore 97339

%A John A. Adams
%T Aerospace and Military
%J IEEE Spectrum
%V 23
%N 1
%D January 1986
%P 76-81
%K AA19 AI06 AI07 AA18 AI01
%X Darpa's Autonomous Land Vehicle succeeded in guiding itself at 5
kilometers per hour using a vision system along a paved road.

%A Richard L. Henneman
%A William B. Rouse
%T On Measuring the Complexity of Monitoring and Controlling Large-Scale
Systems
%J IEEE Transactions on Systems, Man and Cybernetics
%V SMC-16
%N 2
%D March/April 1986
%P 193-207
%K AI08 AA20
%X discusses the effect of number of levels of hierarchy, redundancy and
number of nodes on a display page on the ability of human operators to find
errors in a simulated system

%A G. R. Dattatreya
%A L. N. Kanal
%T Adaptive Pattern Recognition with Random Costs and Its Applications to
Decision Trees
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 208-218
%K AI06  AA01 AI04 AI01 clustering spina bifida bladder radiology
%X applies  clustering algorithm to results of reading radiographs of
the bladder.  The system was able to determine clusters that corresponded
to those of patients with spina bifida.

%A Klaus-Peter Adlassnig
%T Fuzzy Set Theory in Medical Diagnosis
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 260-265
%K AA01 AI01 O04
%X They developed systems for diagnosing rheumatologic diseases and pancreatic
disorders.  They achieved 94.5 and 100 percent accuracy, respectively.

%A William E. Pracht
%T GISMO: A Visual PRoblem Structuring and Knowledge-Organization Tool
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 265-270
%K AI13 AI08 Witkin Geft AA06
%X discusses the use of a system for displaying effect diagrams on
decision making in a simulated business environment.  The tool improved
net income production.   The tool provided more assistance to those
who were more analytical than to those who used heuristic reasoning as
measured by the Witkin GEFT.

%A Henri Farreny
%A Henri Prade
%T Default and Inexact Reasoning with Possiblity Degrees
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 270-276
%K O04 AI01 AA06
%X discusses storing for each proposition, a pair consisting of the
probability that it is true
and probability that it is false where these two probabilities do not
necessarily add up to 1.  Inference rules have been developed for such
a system including analogs to modus ponens, modus tollens and how to
combine two such ordered pairs applying to the same fact.  These have
been applied to an expert system in financial analysis.

%A Chelsea C. White,\ III
%A Edward A. Sykes
%T A User Preference Guided Approach to Conflict Resolution in
Rule-Based Expert Systems
%J IEEE Transactions on Software Engineering
%V SE-11
%N 11
%D November 1985
%P 276-278
%K AI01 multiattribute utility theory
%X discusses an application of multiattribute utility theory to
resolve conflicts between rules in an expert system.

%A David Bright
%T Chip Triggers Software Race
%J ComputerWorld
%V 20
%N 30
%D July 28, 1986
%P 1+
%K intel 3086 T01 T03 H01 Gold Hill Computers Arity Lucid T02 Hummingbird Franz
%X Gold HIll Computers, Franz, Arity, Lucid, Quintus and Teknowledge have agreed
to port their AI software to the 80386

%A David Bright
%T Voice-activated Writer's Block
%J ComputerWorld
%V 20
%N 30
%D July 28, 1986
%P 23+
%K AI05 Kurzweill Victor Zue
%X MIT's Victor Zue says that current voice recognition technology is not
ready to be extended to "complex tasks."  They have been able to train
researchers to transcribe unknown sentences from spectrograms with 85%
success.  A Votan Survey showed that 87% of  office workers require only
45 words to run their typical applications.  Votan's add-in boards
can recognized 150 words at a time.

%A David Bright
%T Nestor Software Translates Handwriting to ASCII code
%J ComputerWorld
%V 20
%N 30
%D July 28, 1986
%P 23+
%K AI06 Brown University
%X Nestor has commercial software that converts handwriting entereded via
a digitizing tablet into ascii text.  First user: a French insurance firm.
The system has been trained to recognize Japanese kanji characters and they will
develop a video system to read handwritten checks.

%A Namir Clement Shammas
%T Turbo Prolog
%J Byte
%V 11
%N 9
%D September 1986
%P 293-295
%K T02 H01 AT17
%X  another review of Turbo-Prolog

%A Bruce Webster
%T Two Fine Products
%J Byte
%V 11
%N 9
%D September 1986
%P 335-347
%K T02 H01 AT17 Turbo-Prolog
%X yet another review of Turbo-Prolog

%A Karen Sorensen
%T Expert Systems Emerging as Real Tools
%J Infoworld
%V 8
%N 16
%D April 21, 1986
%P 33
%K AI01 AT08

%A Rosemary Hamilton
%T MVS Gets Own Expert System
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 1
%K T03 IBM
%X IBM introduced expert system tools for the MVS operating system similar
to those already introduced for VM. The run-time system is $25,000 per month
while development environment is $35,000 per month.

%A Amy D. Wohl
%T On Writing Keynotes: Try Artificial Intelligence
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 17
%X tongue in cheek article about the "keynote" speech which appears at
many conferences.  (Not really about AI)

%A Elisabeth Horwitt
%T Hybrid Net Management Pending
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 19
%K AA08 AI01 AT02 Symbolics Avant-Garde nettworks AA15 H02
%X Avant-Garde Computer is developing an interface to networks to assist in
the management thereof.  Soon there will be an expert sytem on a Symbolics
to interface to that to assist the user of the system.

%T Software Notes
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 29+
%K ultrix DEC VAX AT02 T01
%X DEC has announce a supported version of VAX Lisp for Ultrix

%A Jeffrey Tarter
%T Master Programmers: Insights on Style from Four of the Best
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 41+
%K Jeff Gibbons O02 Palladian AA06
%X contains information on Jeff Gibbons, a programmer at Palladian which
does financial expert systems

%T Software and Services
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 76
%K T02 Quintus PC/RT AT02
%X Quintus has ported its Prolog to the IBM PC/RT.  It costs $8000.00

%T New Products/Microcomputers
%J ComputerWorld
%V 20
%N 14
%D April 7, 1986
%P 81-82
%K AT02 AI06
%X ADS has announced a real-time digitizer for use with micros costing between
$15,000 and $25,000

%A David Bright
%T Datacopy Presents Text, Image Scanner for IBM PC Family
%J ComputerWorld
%V 20
%N 17
%D April 28, 1986
%P 36
%K H02 AT02 AI06
%X For $2950 you can get an integrated text and iamge scanner which can
convert typewritten text to ASCII code.  It can be trained to recognize
unlimited numbers of fonts.  It can also be used to input 200 x 200 or 300 x 300
dot per inch resolution images.

%T Lisp to Separate Sales, Marketing
%J Electronic News
%V 32
%N 1597
%D April 14, 1986
%P 27
%K H02 LMI AT11
%X Lisp Machines is separating sales and marketing.  Ken Johnson, the former
vice-president of sales and marketing, has left LMI for VG Systems

%A Steven Bruke
%T Englishlike 1-2-3 Interface Shown
%J InfoWorld
%V 8
%N 17
%D April 28, 1986
%P 5
%K Lotus AI02 H01 AA15
%X Lotus is selling HAL, which allows users to access 1-2-3 using English
commands

%T TI Sells Japan Lisp Computer
%J Electronics
%V 59
%N 22
%D June 2, 1986
%P 60
%K GA02 GA01  H02 AT16
%X C. Itoh has agreed to market TI's Lisp Machine

%A Larry Waller
%T Tseng Sees Peril in Hyping of AI
%J Electronics
%V 59
%N 16
%D April 21, 1986
%P 73
%K Hughes AT06 AI06 AI07
%X Interview with David Y. Tseng, head of the Exploratory
Studies Department at Malibu Research Laboratories.

%T Image Processor Beats 'Real Time'
%J Electronics
%V 59
%N 15
%D April 14, 1986
%P 54+
%K AI06 AT02 H01 Imaging Technology
%X Imaging Technology's Series 151 will process an image
in 27 milliseconds and offers the user the ability to
select an area to be processed.  It interfaces to a PC/AT.
It costs $11,495 with an optional convolution board for
$3,995.

%A A. P. Sage
%A C. C. White,\ III
%T Ariadne: A Knowledge Based Interactive System for Planning and Decision
Support
%J IEEE Transactions on Systems, Man, Cybernetics
%V SMC-14
%N 1
%D January/February 1984
%P 48-54
%K AI13

%A R. M. Hunt
%A W. B. Rouse
%T A Fuzzy Rule-Based Model of Human Problem Solving
%J IEEE Transactions on Systems, Man, Cybernetics
%V SMC-14
%N 1
%D January/February 1984
%P 112-119
%K AI08 AI01 AA21
%X attempt to develop a model of how people diagnose engine performance

%A I. B. Turksen
%A D. D. W. Yao
%T Representations of Connectives in Fuzzy Reasoning: The View Through
Normal Forms
%J IEEE Transactions on Systems, Man, Cybernetics
%V SMC-14
%N 1
%D January/February 1984
%P 146-151
%K O04

%A W. X. Xie
%A S. D. Bedrosian
%T An Information Measure for Fuzzy Sets
%J IEEE Transactions on Systems, Man, Cybernetics
%V SMC-14
%N 1
%D January/February 1984
%P 151-157
%K O04

%A S. Miyamoto
%A K. Nakayama
%T Fuzzy Information Retrieval Based on a Fuzzy Pseudothesaurus
%J IEEE Transactions on Systems, Man and Cybernetics
%V SMC-16
%N 2
%D March/April 1986
%P 278-282
%K AA14 O04
%X A fuzzy bibliographic information retrieval based on a fuzzy
thesaurus or on a fuzzy pseudothesaurus is described.  A fuzzy thesaurus
consists of two fuzzy relations defined on a set of keywords for the
bibliography.  The fuzzy relations are generated based on a fuzzy set model,
which describes association of keyword to its concepts.  If the set of
concepts in the fuzzy set model is replaced by the set of documents,
the fuzzy relations are called a pseudothesaurus, which is automatically
generated by using occurrence frequencies of the keywords in the set of
documents.  The fuzzy retrieval uses two fuzzy relations in addition,
that is, a fuzzy indexing and a fuzzy inverted file: the latter is the
inverse relation of the former.  They are, however, related to different
algorithms for indexing and retrieval, respectively.  An algorithm of
ordering retrieved documents  according to the values of the fuzzy
thesaurus is proposed.  This method of the ordering is optimal in the
sense that one can obtain documents of maximum relevance in a fixed time
interval.

%A Ralph Grishman
%A Richard Kittredge
%T Analyzing Language in Restricted Domains
%I Lawrence Erlbaum Associates Inc.
%C Hillsdale, NJ
%D 1986
%K AI02 AA01
%X 0-89859-620-3 1986 264 pages $29.95
.TS
tab(~);
l l.
N.Sager~T{
Sublanguage: Linguistic Phenomenon, Computational Tool
T}
J. Lehrberger~Sublanguage Analysis
E. Fitzpatrick~T{
The Status of Telegraphic Sublanguages
T}
J. Bachenko
D. Hindle
J. R. Hobbs~Sublanguage and Knowledge
D. E. Walker~T{
The Use of Machine Readable Dictionaries in Sublanguage Analysis
T}
R. A. Amsler
C. Friedman~T{
Automatic Structuring of Sublanguage Information: Application to
Medical Narrative
T}
E. Marsh~T{
General Semantic Patterns in Different Sublanguages
T}
C. A. Montgomery~T{
A Sublanguage for Reporting and Analysis of Space Events
T}
B. C. Glover
T. W. Finin~T{
Constraining the Interpretation of Nominal Compounds in a Limited Context
T}
G. Dunham~T{
The Role of Syntax in the Sublanguage of Medical Diagnostic Statements
T}
J. Slocum~T{
How One Might Automatically Identify and Adapt to a Sublanguage
T}
L. Hirschman~T{
Discovering Sublanguage Structures
T}
.TE

%A Janet L. Kolodner
%A Christopher K. Riesbeck
%T Experience, Memory and Reasoning
%I Lawrence Erlbaum Associates Inc.
%C Hillsdale, NJ
%D 1986
%K AT15
%X 0-89859-664-0 1986 272 pages $29.95
.TS
tab(~);
l l.
R.Wilensky~T{
Knowledge Representation - A critique and a Proposal
T}
T{
R. H. Granger
.br
D. M. McNulty
T}~T{
Learning and Memory in Machines and Animals that
Accounts for Some Neurobiological Data
T}
T{
V. Sembugamoorthy
.br
B. Chandrasekaran
T}~T{
Functional Representation of Devices and Compilation of
Diagnostic Problem Solving Systems
T}
.TE

%A  David E. Wilkins
%T Recovering from Execution Errors in \s-1SIPE\s0
%J Computational Intelligence
%V 1
%D 1985
%K AI07 AI09
%X
In real-world domains (a mobile robot is used as a motivating example), things
do not always proceed as planned.  Therefore it is important to develop better
execution-monitoring techniques and replanning capabilities. This paper
describes the execution-monitoring and replanning capabilities of the
\s-1SIPE\s0 planning system.  (\s-1SIPE\s0 assumes that new information to the
execution monitor is in the form of predicates, thus avoiding the difficult
problem of how to generate these predicates from information provided by
sensors.)  The execution-monitoring module takes advantage of the rich
structure of \s-1SIPE\s0 plans (including a description of the plan rationale),
and is intimately connected with the planner, which can be called as a
subroutine.  The major advantages of embedding the replanner within the
planning system itself are:
.IP 1.
The replanning module can take advantage of the efficient frame reasoning
mechanisms in \s-1SIPE\s0 to quickly discover problems and potential fixes.
.IP 2.
The deductive capabilities of \s-1SIPE\s0 are used to provide a reasonable
solution to the truth maintenance problem.
.IP 3.
The planner can be called as a subroutine to solve problems after the
replanning module has inserted new goals in the plan.
.LP
Another important contribution is the development of a general set of
replanning actions that will form the basis for a language capable of
specifying error-recovery operators, and a general replanning capability that
has been implemented using these actions.

%A  Candace L. Sidner
%T  Plan Parsing for Intended Response Recognition
in Discourse
%J Computational Intelligence
%V 1
%D 1985
%K Discourse task-oriented dialogues intended meaning AI02
speaker's plans discourse understanding plan parsing discourse markers
%X
In a discourse, the hearer must recognize the response intended by the speaker.
To perform this recognition, the hearer must ascertain what plans the speaker
is undertaking and how the utterances in the discourse further that plan. To do
so, the hearer can parse the initial intentions (recoverable from the
utterance) and recognize the plans the speaker has in mind and intends the
hearer to know about. This paper reports on a theory of parsing the intentions
in discourse. It also discusses the role of another aspect of discourse,
discourse markers, that are valuable to intended response recognition.

%A  John K. Tsotsos
%T  Knowledge Organization and its Role
in Representation and Interpretation for
Time-Varying Data: The \s-1ALVEN\s0 System
%J Computational Intelligence
%V 1
%D 1985
%K Knowledge Representation, Expert Systems, Medical Consultation
Systems, Time-Varying Interpretation, Knowledge-Based Vision. AI01 AI06 AA01
%X
The so-called first generation'' expert systems were rule-based and offered a
successful framework for building applications systems for certain kinds of
tasks. Spatial, temporal and causal reasoning, knowledge abstractions, and
structuring are among topics of research for second generation'' expert
systems.
.sp
It is proposed that one of the keys for such research is \fIknowledge
organization\fP.  Knowledge organization determines control structure design,
explanation and evaluation capabilities for the resultant knowledge base, and
has strong influence on system performance.  We are exploring a framework for
expert system design that focuses on knowledge organization for a specific
class of input data, namely, continuous, time-varying data (image sequences or
other signal forms).  Such data is rich in temporal relationships as well as
temporal changes of spatial relations and is thus a very appropriate testbed
for studies involving spatio-temporal reasoning.  In particular, the
representation facilitates and enforces the semantics of the organization of
knowledge classes along the relationships of generalization / specification,
decomposition / aggregation, temporal precedence, instantiation, and
expectation-activated similarity.
.sp
A hypothesize-and-test control structure is
driven by the class organizational principles, and includes several interacting
dimensions of research (data-driven, model-driven, goal-driven temporal, and
failure-driven search).  The hypothesis ranking scheme is based on temporal
cooperative computation with hypothesis fields of influence'' being defined
by the hypotheses' organizational relationships. This control structure has
proven to be robust enough to handle a variety of interpretation tasks for
continuous temporal data.
.sp
A particular incarnation, the \s-1ALVEN\s0 system, for left ventricular
performance assessment from X-ray image sequences, will be highlighted in this
paper.

%A  David W. Etherington
%A Robert E. Mercer
%A Raymond Reiter
%T  On the Adequacy of Predicate Circumscription
for Closed-World Reasoning
%J Computational Intelligence
%V 1
%D 1985
%K AI15 AI16
%X We focus on McCarthy's method of predicate circumscription in order to
establish various results about its consistency, and about its ability to
conjecture new information. A basic result is that predicate circumscription
cannot account for the standard kinds of default reasoning.  Another is that
predicate circumscription yields no new information about the equality
predicate. This has important consequences for the unique names and domain
closure assumptions.

%A  Je\(ffry Francis Pelletier and Marc H.J. Romanycia
%T   What is a Heuristic?
%J Computational Intelligence
%V 1
%N 2
%D May 1985
%K AI16
%X From the mid-1950's to the present, the notion of a heuristic has
played a crucial role in AI researchers' descriptions of their
work.  What has not been generally noticed is that different
researchers have often applied the term to rather different aspects
of their programs.  Things that would be called a heuristic by
one researcher would not be so called by others.  This is because
many heuristics embody a variety of different features, and the
various researchers have emphasized different ones of these
features as being essential to being a heuristic.  This paper
steps back from any particular research programme and investigates
the question of what things, historically, have been thought to be
central to the notion of a heuristic, and which ones conflict with
others.  After analyzing the previous definitions and examining
current usage of the term, a synthesizing definition is provided.
The hope is that with this broader account of `heuristic' in hand,
researchers can benefit more fully from the insights of others,
even if those insights are couched in a somewhat alien vocabulary.

%A  Robert Woodham
%A E. Catanzariti
%A  Alan Mackworth
%T  Analysis by Synthesis in Computational Vision
with Application to Remote Sensing
%J Computational Intelligence
%V 1
%N 2
%D May 1985
%K AI06
%X
The problem in vision is to determine surface properties from
image properties.  This is difficult because the problem, formally
posed, is underconstrained.  Methods that infer scene properties
from image properties make assumptions about how the world
determines what we see.  In this paper, some of these assumptions
are dealt with explicitly, using examples from remote sensing.
Ancillary knowledge of the scene domain, in the form of a digital
terrain model and a ground cover map, is used to synthesize an
image for a given date and time.  The synthesis process assumes
that surface material is lambertian and is based on simple models of
direct sun illumination, diffuse sky illumination and atmospheric path
radiance.  Parameters of the model are estimated from the real image.
A statistical comparison of the real image and the synthetic image
is used to judge how well the model represents the mapping from
scene domain to image domain.
.sp 1
The methods presented for image synthesis are similar to those
used in computer graphics.  The motivation, however is different.
In graphics, the goal is to produce an effective rendering of the
scene domain.  Here, the goal is to predict properties of real
images.  In vision, one must deal with a confounding of effects
due to surface shape, surface material, illumination, shadows
and atmosphere.  These effects often detract from, rather than
enhance, the determination of invariant scene characteristics.

%A Erik Sandewall
%T  A Functional Approach to Non-Monotonic Logic
%J Computational Intelligence
%V 1
%N 2
%D May 1985
%K AI15 AI16
%X
Axiom sets and their extensions are viewed as functions from the
set of formulas in the language, to a set of four truth-values \fIt\fP,
\fIf\fP, \fIu\fP for undefined, and \fIk\fP for contradiction.	Such functions
form a lattice with `contains less information' and the partial
order \(ib, and `combination of several sources of knowledge' as the
least-upper-bound operation \(IP.
We demonstrate the relevance of this
approach by giving concise proofs for some previously known results
about normal default rules.  For non-monotonic rules in general
(not only normal default rules), we define a stronger version of the
minimality requirement on consistent fixpoints, and prove that
it is sufficient for the existence of a derivation of the fixpoint.

%A Michel Boyer
%A Guy Lapalme
%T Generating paraphrases from
meaning-text semantic networks
%J Computational Intelligence
%V 1
%N 3-4
%D August 1985
%K T02
%X
This paper describes a first attempt to base a paraphrase generation system
upon Mel'cuk and Zolkovskij's linguistic Meaning-Text (\s-1MT\s0) model whose
purpose is to establish correspondences between meanings, represented by
networks, and (ideally) all synonymous texts having this meaning.  The system
described in the paper contains a Prolog implementation of a small explanatory
and combinatorial dictionary (the \s-1MT\s0 lexicon) and, using unification
and backtracking, generates from a given network the sentences allowed by the
dictionary and the lexical transformations of the model.  The passage from the
net to the final texts is done through a series of transformations of
intermediary structures that closely correspond to \s-1MT\s0 utterance
representations (semantic, deep-syntax, surface-syntax and morphological
representations).  These are graphs and trees with labeled arcs.  The Prolog
unification (equality predicate) was extended to extract information from these
representations and build new ones.  The notion of utterance path, used by many
authors, is replaced by that of covering by defining subnetworks''.

%A David J. Fleet
%A Allan D. Jepson
%T Spatiotemporal inseparability in early vision:
Centre-surround models and velocity selectivity
%J Computational Intelligence
%V 1
%N 3-4
%D August 1985
%K AI08 AI06
%X
Several computational theories of early visual processing, such as Marr's
zero-crossing theory, are biologically motivated and based largely on the
well-known difference of Gaussians (\s-1DOG\s0) receptive field model of early
retinal processing.  We examine the physiological relevance of the \s-1DOG\s0,
particularly in the light of evidence indicating significant spatiotemporal
inseparability in the behaviour of retinal cell type.
.LP
From the form of the inseparability we find that commonly accepted functional
interpretations of retinal processing based on the \s-1DOG\s0, such as the
Laplacian of a Gaussian and zero-crossings, are not valid for time-varying
images.  In contrast to current machine-vision approaches, which attempt to
separate form and motion information at an early stage, it appears that this is
not the case in biological systems.  It is further shown that the qualitative
form of this inseparability provides a convenient precursor to the extraction
of both form and motion information.  We show the construction of efficient
mechanisms for the extraction of orientation and 2-D normal velocity through
the use of a hierarchical computational framework.  The resultant mechanisms
are well localized in space-time, and can be easily tuned to various degrees of
orientation and speed specificity.

%A William Havens
%T A theory of schema labelling
%J Computational Intelligence
%V 1
%N 3-4
%D August 1985
%K AI16 AI06 AA04
%X
Schema labelling is a representation theory that focuses on composition and
specialization as two major aspects of machine perception.  Previous research
in computer vision and knowledge representation have identified computational
mechanisms for these tasks.  We show that the representational adequacy of
schema knowledge structures can be combined advantageously with the constraint
propagation capabilities of network consistency techniques.  In particular,
composition and specialization can be realized as mutually interdependent
cooperative processes which operate on the same underlying knowledge
representation.  In this theory, a schema is a generative representation for
a class of semantically related objects.  Composition builds a structural
description of the scene from rules defined in each schema.  The scene
description is represented as a network consistency graph which makes
explicit the objects found in the scene and their semantic relationships.
The graph is hierarchical and describes the input scene at varying levels
of detail.  Specialization applies network consistency techniques to refine
the graph towards a global scene description.  Schema labelling is being used
for interpretating hand-printed Chinese characters, and for recognizing
\s-1VLSI\s0 circuit designs from their mask layouts.

%A Alan K. Mackworth
%A Jan A. Mulder
%A  William S. Havens
%T Hierarchical arc consistency:
Exploring structured domains
in constraint satisfaction problems
%J Computational Intelligence
%V 1
%N 3-4
%D August 1985
%K AI03 AI16 AI06
%X
Constraint satisfaction problems can be solved by network consistency
algorithms that eliminate local inconsistencies before constructing global
solutions.  We describe a new algorithm that is useful when the variable
domains can be structured hierarchically into recursive subsets with common
properties and common relationships to subsets of the domain values for related
variables.  The algorithm, \s-1HAC\s0, uses a technique known as hierarchical
arc consistency.  Its performance is analyzed theoretically and the conditions
under which it is an improvement are outlined.	The use of \s-1HAC\s0 in a
program for understanding sketch maps, Mapsee3, is briefly discussed and
experimental results consistent with the theory are reported.

%A  Patrick Saint-Dizier
%T  Expression of Syntactic and Semantic Features
in Logic-Based Grammars
%J Computational Intelligence
%V 2
%N 1
%D February 1986
%K AI02
%X In this paper we introduce and motivate a formalism to represent syntactic
and semantic features in logic-based grammars.	We also introduce technical
devices to express relations between features and inheritance mechanisms.
This leads us to propose some extensions to the basic unification mechanism
of Prolog.  Finally, we consider the problem of long-distance dependency
relations between constituents in Gapping Grammar rules from the point of
view of morphosyntatic features that may change depending on the position
occupied by the moved'' constituents.  What we propose is not a new
linguistic theory about features, but rather a formalism and a set of tools
that we think to be useful to grammar writers to describe features and their
relations in grammar rules.

%A  Per-Kristian Halvorsen
%T  Natural Language Understanding and
Theories of Natural Language Semantics
%J Computational Intelligence
%V 2
%N 1
%D February 1986
%K AI02
%X
In these short remarks, I examine the connection between Montague grammar, one
of the most influential theories of natural language semantics during the past
decade, and natural language understanding, one of the most recalcitrant
problems in \(*AI and computational linguistics for more than the last decade.
When we view Montague grammar in light of the requirements of a theory
natural language understanding, new traits become prominent, and highly touted
advantages of the approach become less significant.  What emerges is a new
set of criteria to apply to theories of natural language understanding.  Once
one has this measuring stick in hand, it is impossible to withstand the
temptation of also applying it to the emerging contender to Montague grammar
as a semantic theory, namely situation semantics.

%A  Fred Popowich
%T  Unrestricted Gapping Grammars
%J Computational Intelligence
%V 2
%N 1
%D February 1986
%K AI02
%X
Since Colmerauer's introduction of metamorphosis grammars (MGs), with
their associated type \fIO\fP\(milike grammar rules, there has been a desire
to allow more general rule formats in logic grammars.  Gap symbols were added
to the MG rule by Pereria, resulting in extraposition grammars (XGs).
Gaps, which are referenced by gap symbols, are sequences of zero or more
unspecified symbols which may be present anywhere in a sentence or in a
sentential form.  However, XGs imposed restrictions on the position of gap
symbols and on the contents of gaps.  With the introduction of gapping
grammars (GGs) by Dahl, these restrictions were removed, but the rule was
still required to possess a nonterminal symbol as the first symbol on the
left-hand side.  This restriction is removed with the introduction of
unrestricted gapping grammars.	FIGG, a Flexible Implementation of Gapping
Grammars, possesses a bottom-up parser which can process a large subset of
unrestricted GGs for describing phenomena of natural languages such as free
word order, and partially free word or constituent order.  It can also be used
as a programming language to implement natural language systems which are
based on grammars (or metagrammars) that use the gap concept, such
as Gazdar's generalized phrase structure grammars.

%A Ashar A. Butt
%T Cell Design in Prolog
%R CSD 86/286
%I University of California, Berkeley
%K AA04 T02
%X $3.50

%A David Michael Ungar
%T The Design and Evaluation of a High Performance Smalltalk System
%R CSD 86/287
%I University of California, Berkeley
%X $9.00

%A Yigal Arens
%T CLUSTER: An Approach to Contextual Language Understanding
%R CSD 86/293
%I University of California, Berkeley
%K Unix Consultant AI02 AA15
%X $8.25

%A Robert Wilensky
%T Some Problems and Proposals for Knowledge Representation
%R CSD 86/294
%I University of California, Berkeley
%K AI02 AI16 kodiak AT14
%X $3.25

%A Joseph Pasquale
%T Knowledge Based Distributed System Management
%R CSD 86/295
%I University of California, Berkeley
%K AA08
%X $2.50

%A Paul Schafran Jacobs
%T A Knowledge Based Approach to Language Production
%R CSD 86/254
%I University of California, Berkeley
%K AI02 O01
%X $7.50

%A Jung-Herng Chang
%T High Performance Execution of Prolog Programs Based on a Static Data
Dependence Analysis
%R CSD 86/263
%I University of California, Berkeley
%K T02
%X $5.00

%A M. Kathryn Di Benigno
%A George R. Cross
%A Gary G. deBessonet
%T COREL - A CONCEPTUAL RETRIEVAL SYSTEM
%R CS-86-147 Computer Science Department
%I Washington State University
%C Pullman, WA 99164-1210
%K AI16
%X Corel is an experimental retrieval system that employs techniques of
artificial intelligence.  Articles of the Civil Code of Louisiana have been
conceptually indexed using frame-based knowledge structures in hope of
improving accessibility over traditional key-word retrieval systems.  A set
of macro packages has been developed to allow a domain expert to
implement a retrieval system based on this methodology.

%A Mohammed Nasiruddin
%A George R. Cross
%A Cary G. deBessonet
%T THE STRUCTURE OF CCLIPS
%R CS-86-149 Computer Science Department
%I Washington State University
%C Pullman, WA 99164-1210
%K AA24
%X The Civil Code Legal Information Processing System (CCLIPS) is a conceptual
retrieval system whose domain is the Louisiana Civil Code.  Statutes are
coded in Atomically Normalized Form (ANF) and entered into a database.  Legal
situations are entered by the user in ANF and relevant statutes are retrieved.
We discuss the current status of the system and some plans for further
development.

%A Evan Tick
%T Lisp and Prolog Memory Performance
%R CSL T.R. 86-291
%I Stanford University Computer Systems Laboratory
%D January 1986
%X This  report presents a comparison between a Lisp and Prolog architecture bas
ed
on memory performance.  Four Lisp programs were translated into Common Lisp and
Prolog abstract  machine  instruction  sets.    The  translated  programs  were
emulated  and  memory  reference  counts  collected.    Memory usage statistics
indicate how the two languages do fundamental computations different ways  with
varying efficiency.  Additional measurements of production systems running on a
conventional host are presented.

%A Kiyomi Koyama
%T Microprogram Control of a Prolog Machine
%R CSL-TN-86-286
%D January 1986
%X
.br
br
A Prolog machine design and its control are described.   The  machine  features
two-stage  pipelining,  a  triple bus interconnection data path and support for
concurrent control of micro-operations.  The objective of  this  design  is  to
improve  execution  of a Prolog processor by simultaneously performing multiple
micro-operations.  Capabilities of concurrent operation support  are  described
in  detail  and  demonstrated  using  some example Prolog functions.  Two-stage
pipeline technique as applied to non-deterministic control  of  Prolog  program
execution will be presented.
.br
br
37 pages.....$4.35

%A R. S. Michalski
%A I. Mozetic
%A J. Hong
%A N. Lavrac
%T The AQ15 Inductive Learning System: An Overview and Experiments
%R 1260
%I The University of Illinois at Urbana-Champaign, Department of Computer Scienc
e
%D July 1986
%K AI04

%A J. J. Shilling
%T Automated Reference Librarians for Program Libraries and
Their Interaction with Language Based Editors
%R 1268
%I The University of Illinois at Urbana-Champaign, Department of Computer Scienc
e
%D August 1986
%K AA14

%A Larry Rendell
%T Induction, Of and By Probability
%R 1293
%R 1268
%I The University of Illinois at Urbana-Champaign, Department of Computer Scienc
e
%D August 1986
%K AI04

%A Marianne Winslett Wilkins
%T A Model-Theoretic Approach to Updating Logical Databases
%R STAN-CS-86-1096
%I Stanford University, Department of Computer Science
%D January 1986
%D January 1986
%K AI10 AA09
%Y $5.00

%A Jitendra Malik
%T Interpreting Line Drawings of Curved Objects
%R STAN-CS-86-1099
%I Stanford University, Department of Computer Science
%D December 1985
%K AI06
%Y $15.00

%A Martin Abadi
%A Zohar Manna
%T Modal Theorem Proving
%R STAN-CS-86-1100
%I Stanford University, Department of Computer Science
%D May 1986
%K AA13 AI11
%Y $5.00

%A David E. Foulser
%T On Random Strings and Sequence Comparisons
%R STAN-CS-86-1101
%I Stanford University, Department of Computer Science
%D February 1986
%K O06
%Y $microfiche only  charge listed as N/A

%A Devika Subramanian
%T A Survey of AI Classnotes for Winter 84-85
%R STAN-CS-86-1104
%I Stanford University, Department of Computer Science
%D April 1986
%K AI16
%Y $15.00

%A Martin Abadi
%A Zohar Manna
%T A Timely Resolution
%R STAN-CS-86-1106
%I Stanford University, Department of Computer Science
%D April 1986
%K AI11 temporal logic AI10

%A David E. Smith
%T Controlling Inference
%R STAN-CS-86-1107
%I Stanford University, Department of Computer Science
%D April 1986
%K AI03
%Y $15.00

%A K. Morris
%A J. Ullman
%A A. Van Gelder
%T Design Overview of the NAIL! System
%R STAN-CS-86-1108
%I Stanford University, Department of Computer Science
%D May 1986
%K AI10  AA09
%X Nail = Not another implementation of logic
%Y $5.00

%A Ross Casley
%T A Proof Editor for Propositional Temporal Logic
%R STAN-CS-86-1109
%I Stanford University, Department of Computer Science
%D May 1986
%K AI11
%Y $5.00

%A Y. Malachi
%A Z. Manna
%A R. Waldinger
%T TABLOG: A New Approach to Logic Programming
%R STAN-CS-86-1110
%I Stanford University, Department of Computer Science
%D March 1985
%K AI10
%Y $5.00

%A Paul Rosenbloom
%A John Laird
%T Mapping Explanation-Based Generalization onto Soar
%R STAN-CS-86-1111
%I Stanford University, Department of Computer Science
%D June 1986
%K AI16 explanation-based generalization
%Y $5.00

%A Jeffrey F. Naughton
%T Optimizing Function-Free Recursive Inference Rules
%R STAN-CS-86-1114
%I Stanford University, Department of Computer Science
%D May 1986
%K AI10
%Y $5.00

%A B. G. Buchanan
%A B. Hayes-Roth
%A O. Lichtarge
%T The Heuristic Refinement Method for Deriving Solution Structures of Proteins
%R STAN-CS-86-1115
%I Stanford University, Department of Computer Science
%D March 1986
%K AA10 AI01
%Y $5.00

%A Li-Min Fu
%A Bruce G. Buchanan
%T Inductive Knowledge Acquisition for Rule-based Expert Systems
%R STAN-CS-86-1116
%I Stanford University, Department of Computer Science
%D October 1985
%K AI01
%Y $5.00

%A D. Howe
%T Implementing Number Theory: An Experiment with NUPRL
%R 86-752
%I Cornell University, Department of Computer Science
%D May 1986
%K AA13 AI11 AI14

%A J. Sasaki
%T Extracting Efficient Code From Constructive Proofs
%R 86-757
%I Cornell University, Department of Computer Science
%D JUNE 1986
%K AA08

%A M. P. Mendler
%T First and Second Lambda Calculi with Recursive Types
%R 86-764
%I Cornell University, Department of Computer Science
%D July 1986
%K T01

%A J. Bates
%T THEFRL Mathematics Environment: A Knowledge Based Medium
%R 86-768
%I Cornell University, Department of Computer Science
%D August 1986
%K AA13

%A C. Kreitz
%T Constructive Automata Theory Implemented with the Nuprl Proofl Development
Systems
%R 86-779
%I Cornell University, Department of Computer Science
%D September 1986
%K AA13 AA08 AI11

%A A. Moitra
%A P. Panangaden
%T A Proof System for Dataflow Networks with Indeterminate
Modules
%R 86-782
%I Cornell University, Department of Computer Science
%D September 1986
%K AA13 AA08 AI11

%A J. D. Ward
%A B. E. Gillett
%A A. R. DeKock
%T CIGEN: A System for Testing Knowledge Base Compilation
Heuristics on a Microcomputer
%R CSC 84-10
%I University of Missouri-Rolla Department of Computer Science
%D 1984
%K AA08

%A K. W. Whiting
%A A. R. DeKock
%A J. B. Prater
%T A Focus of Attention Algorithm for Expert Systems
%R CSC 84-12
%I University of Missouri-Rolla Department of Computer Science
%D 1984
%K AI01

%A R. M. Butler
%A A. R. DeKock
%T An Algorithm for Parallel Subsumption
%R CSc 84-1
%I University of Missouri-Rolla Department of Computer Science
%D 1985
%K H03 AI11

%A R. L.Boehning
%A B. E. Gillett
%T A Parallel Branch and Bound Algorithm for Integer Linear
Programming Models
%R CSC 85-2
%I University of Missouri-Rolla Department of Computer Science
%D 1985
%K H03 AI03

%A R. S. Dare
%A A. R. DeKock
%T Genesis of an Expert System for UMR Degree Auditing
%R CSC 86-3
%I University of Missouri-Rolla Department of Computer Science
%D 1986
%K AI01 AA07

%A J. H. Marchal
%A A. R. DeKock
%T MICA: prototyping an Expert System Consultant
%R CSC 86-5
%I University of Missouri-Rolla Department of Computer Science
%D 1986
%K AI01

%A J. A. Vila Ruiz
%A A. R. DeKock
%T A Computerized Audio-Visual Speech Model
%R CSC 86-4
%I University of Missouri-Rolla Department of Computer Science
%D 1986
%K AI05

%A D. Wise
%T The Applicative Style of Programming
%R CSTR 84-2
%I Oregon State University, Department of Computer Science
%D 1984

%A F. Springsteel
%T Expert Systems for Exploratory Data Analysis: Towards Automated Research
%R CSTR 85-30-1
%I Oregon State University, Department of Computer Science
%D 1985
%K AA12 AI01 automated knowledge acquisition

%A F. Springsteel
%T Biomedical Knowledge Acquisition: Three Systems Reviewed
%R CSTR-86-60-1
%I Oregon State University, Department of Computer Science
%D 1986
%K AA01 AI01 AA12 automated knowledge acquisition

%A T. Dietterich
%T Learning at the Knowledge Level
%R CSTR-86-30-1
%I Oregon State University, Department of Computer Science
%D 1986
%K AI04

%A T. G. Dietterich
%A N. S. Flann
%A D. C. Wilkins
%T A Summary of Machine Learning Papers from IJCAI-85
%R CSTR-86-30-2
%I Oregon State University, Department of Computer Science
%D 1986
%K AI04

%A N. S. Flann
%A T. G. Dietterich
%T Two Short Papers on Machine Learning
%R CSTR-86-30-3
%I Oregon State University, Department of Computer Science
%D 1986
%K AI04

%A A. Birjandi
%A T. G. Lewis
%T YASHAR: A Ruled Based Meta-tool for Program Development
%R CSTR-86-10-1
%I Oregon State University, Department of Computer Science
%D 1986
%K AI01 AA08
%X this system does computer language to language translations and
restructuring of code

%A A. Birjandi
%A T. G. Lewis
%T ARASH: A Re-Structuring Environment for Building Software Systems
From Reusable Components
%R CSTR-86-10-2
%I Oregon State University, Department of Computer Science
%D 1986
%K AA08

%A A. Birjandi
%A T. G. Lewis
%T Artimis: A Module Indexing and Source Program Reading and Understanding
Environment
%R CSTR-86-10-3
%I Oregon State University, Department of Computer Science
%D 1986
%K AA14 AA08

%A J. S. Bennett
%A T. G. Dietterich
%T The Test Incorporation Hypothesis and the Weak Methods
%R CSTR-86-30-4
%I Oregon State University, Department of Computer Science
%D 1986
%K AI03

%A N. S. Flann
%A T. G. Dietterich
%T Selecting Appropriate Representations for Learning From Examples
%R CSTR-86-30-5
%I Oregon State University, Department of Computer Science
%D 1986
%K AI16 AI04

%A C. S. Rapp
%T Algebra READER: An Expert Algebra Work Problem Reader
%R CSTR-86-30-6
%I Oregon State University, Department of Computer Science
%D 1986
%K AA07 AA13 AI02 AI01

%A W. S. Bregar
%A A. M. Farley
%A G. Bayley
%T Knowledge Sources for an Intelligent Algebra Tutor
%R CSTR-86-30-7
%I Oregon State University, Department of Computer Science
%D 1986
%K AA07 AA13

%A C. Swart
%A D. Richards
%T On the Inference of Strategies
%R CSTR-86-20-3
%I Oregon State University, Department of Computer Science
%D 1986
%K AI04 O06

%A W. G. Rudd
%A K. Uppuluri
%A G. R. Cross
%A S. Haley
%T Expert Systems for Management of Pests of Agricultural Crops
%R CSTR-86-60-4
%I Oregon State University, Department of Computer Science
%D 1986
%K AA23 AI01

%A T. G. Dietterich
%A D. G. Ullman
%T FORLOG: A Logic-based Architecture for Design
%R CSTR-86-30-8
%I Oregon State University, Department of Computer Science
%D 1986
%K AA05 AI10

%A D. G. Ullman
%A L. A. Stauffer
%A T. G. Dietterich
%T Preliminary Results of an Experimental Study of the Mechanical Design
Process
%R CSTR-86-30-9
%I Oregon State University, Department of Computer Science
%D 1986
%K AA05 AI08

%A Edward A. Stohr
%A Jon A. Turner
%A Yannis Vassiliou
%A Norman H. White
%T Research in Natural Language Retrieval Systems
%R 30
%I New York University, Center for Research on Information Systems
%K AA09 AI02

%A Jon A. Turner
%A Matthias Jarke
%A Edward A. Stohr
%A Yannis Vassiliou
%A Norman H. White
%T Using Restricted Natural Language for Data Retrieval: A Plan for Field Evalua
tion
%R 38
%I New York University, Center for Research on Information Systems
%K AA09 AI02

%A Yannis Vassiliou
%A James Clifford
%A Matthias Jarke
%T How Does an Expert System Get its Data?
%R 50
%I New York University, Center for Research on Information Systems
%K AI01

%A Matthias Jarke
%A Jacob Shalev
%T A Knowledge-Based Approach to the 'Analysis and Design of Business Transactio
n
Processing Systems
%R 53
%I New York University, Center for Research on Information Systems
%K AA09 AA06

%A Yannis Vassiliou
%A Matthias Jarke
%A Edward A. Stohr
%A Jon A. Turner
%A Norman H. White
%T Natural Languages for Database Queries: A Laboratory Study
%R 55
%I New York University, Center for Research on Information Systems
%K AI02 AA09

%A Matthias Jarke
%A Yannis Vassiliou
%T Coupling Expert Systems with Database Management Systems
%R 54
%I New York University, Center for Research on Information Systems
%K AI01 AA09

%A James Clifford
%A Matthias Jarke
%A Yannis Vassiliou
%T A Short Introduction to Expert Systems
%R 59
%I New York University, Center for Research on Information Systems
%K AI01 AT08

%A Matthias Jarke
%A Jon A. Turner
%A Edward A. Stohr
%A Yannis Vassiliou
%A Norman H. White
%A Ken Michielsen
%T A Field Evaluation of Natural Language for Data Retrieval
%R 62
%I New York University, Center for Research on Information Systems
%K AI02 AA09

%A Matthias Jarke
%A James Clifford
%A Yannis Vassiliou
%T An Optimizing Prolog Front End to a Relational Query Systems
%R 65
%I New York University, Center for Research on Information Systems
%K AA09 T02

%A Taracad Sivasankaran
%A Matthias Jarke
%T Logic-Based Formula Management Strategies in an Actuarial Consulting System
%R 69
%I New York University, Center for Research on Information Systems
%K AA06 AA12 AI01

%A Matthias Jarke
%A Jurgen Krause
%A Yannis Vassiliou
%T Studies in the Evaluation of a Domain-Independent Natural Language Query Syst
em
%R 72
%I New York University, Center for Research on Information Systems
%K AI02 AA09

%A Yannis Vassiliou
%A Jim Clifford
%A Matthias Jarke
%T Database Access Requirements of Knowledge Based Systems
%R 74
%I New York University, Center for Research on Information Systems
%K AA09

%A Matthias Jarke
%T External Semantic Query Simplification: A Graph Theoretic Approach and its
Implementation in Prolog
%R 75
%I New York University, Center for Research on Information Systems
%K AA09 T02

%A Vasant Dhar
%A Casey Quayle
%T An Approach to Dependency Directed Backtracking Using Domain Specific Knowled
ge
%R 89
%I New York University, Center for Research on Information Systems
%K AI03

%A Vasant Dhar
%T On the Plausibility and Scope of Expert Systems in Management
%R 98
%I New York University, Center for Research on Information Systems
%K AI01 AA06

%A James Clifford
%A Matthias Jarke
%A Henry C. Lucas
%T Designing Expert Systems in a Business Environment
%R 99
%I New York University, Center for Research on Information Systems
%K AI01

%A Vasant Dhar
%A Matthias Jarke
%T Analogical and Dependency-Directed Reasoning Strategies for Large Systems
Evolution
%R 100
%I New York University, Center for Research on Information Systems
%K AI16

%A Jae B. Lee
%A Edward A. Stohr
%T Representing Knowledge for Portfolio Management Decision Making
%R 101
%I New York University, Center for Research on Information Systems
%K AA06 AI01  AI13

%T Some Thoughts on Proof Discovery
%R AI-208-86
%I Microelectronics  and Computer Technology Corporation
%D June 1986
%K AI16

%T Models of Technology Transfer at MCC
%R AI-160-86
%I Microelectronics  and Computer Technology Corporation
%D May 1986
%K AT19

%T A Man-Machine Procedure for Building a Medium Sized Knowledge Base by
Analogy and Learning: Preliminary Report
%R AI-159-86
%I Microelectronics  and Computer Technology Corporation
%D May 1986
%K AI16 AI04

%T The Use of Analogy in Automatic Proof Discovery: Preliminary Report
%R Ai-158-86
%I Microelectronics  and Computer Technology Corporation
%D May 1986
%K AI16

%T Algorithms for Subpixel Registration
%R AI-157-86
%I Microelectronics  and Computer Technology Corporation
%D April 1986
%K AI06

%T Extended Contradiction Resolution
%R AI-102-86
%I Microelectronics  and Computer Technology Corporation
%D March 1986
%K AI16

%T Expert Systems in the Marketplace
%R AI-101-86
%I Microelectronics  and Computer Technology Corporation
%D March 1986
%K AI01

%T Automating Knowledge Acquisition From Experts
%R AI-082-86
%I Microelectronics  and Computer Technology Corporation
%D March 1986
%K AI01

%T A Diffusing Computation for Truth Maintenance
%R AI-016-86
%I Microelectronics  and Computer Technology Corporation
%D 1985
%K AI15

%T Rule-Based Geometrical Reasoning for the Interpretation of Line Drawings
%R AI-013-86
%I Microelectronics  and Computer Technology Corporation
%D January 24, 1986
%K AI01 AI06

%T Efficient Management of Backtracking in And-Parallelism
%R AI-181-85
%I Microelectronics  and Computer Technology Corporation
%D December 12, 1985
%K AI10 H03 AI03

%T A Knowledge Engineering Bibliography
%R AI-119-85
%I Microelectronics  and Computer Technology Corporation
%D November 1985
%K AI01 AT09

%T An Encoding Technique for the Efficient Implementation of Type
Inheritance
%R AI-109-85
%I Microelectronics  and Computer Technology Corporation
%D December 1985
%K O06

%T Suggested Reading List for an Introduction to Artificial Intelligence
%R AI-100-85
%I Microelectronics  and Computer Technology Corporation
%D October 1985
%K AT09 AI16

%T Machine Translation: An American Perspective
%R AI-083-85
%I Microelectronics  and Computer Technology Corporation
%D August 1985
%K AI02 GA02

%T Integrating Data Type Inheritance into Logic Programming
%R AI-082-85
%I Microelectronics  and Computer Technology Corporation
%D August 1985
%K AI10

%T Logic and Inheritance
%R AI-076-85
%I Microelectronics  and Computer Technology Corporation
%D July 1985
%K AI10

%T LOGIN: A Logic Programming Language with Built-In Inheritance
%R AI-068-85
%I Microelectronics  and Computer Technology Corporation
%D July 1985
%K AI10

%T An Algorithm for Truth Maintenance
%R AI-062-85
%I Microelectronics  and Computer Technology Corporation
%D April 1985
%K AI15

%T CYC: Using Common Sense Knowledge to Overcome Brittleness and
Knowledge Acquisition Bottlenecks
%R AI-055-85
%I Microelectronics  and Computer Technology Corporation
%D July 15, 1985
%K AI16

%T "I Had A Dream" AAAI Presidential Address
%R AI-054-85
%I Microelectronics  and Computer Technology Corporation
%D August 19, 1985
%K AI16

%T Extraction of Expert System Rules From Text
%R AI-017-85
%I Microelectronics  and Computer Technology Corporation
%D June 1985
%K AI01 AI02

%T The Treatment of Grammatical Categories and Word Order in Machine
Translation
%R Ai-015-85
%I Microelectronics  and Computer Technology Corporation
%D March 1985
%K AI02

%T An Evaluation of Metal: The LRC Machine Translation System
%R AI-014-85
%I Microelectronics  and Computer Technology Corporation
%D March 1985
%K AI02

%A S. V. Shil'man
%T Adaptive-Optimal Filtering in Random Processes
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 249-261
%K O06 AI06

%A O. Yu. Pershin
%T A Class of Extremal Combinatorial Problems for Multicomponent Network
Design
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 262-269
%K AI03 O06

%A V. I. Borzenko
%T Extrapolation of a System of Classifications
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 270-275
%K O06

%A V. V. Mottl
%A I. B. Muchnik
%T Algorithm for Recognition of a Stream of Random Events
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 276-278
%K AI06 O06

%A Dominique Perrin
%A Jean-Erric Pin
%T First-Order Logic and Star-Free Sets
%J Journal of Computer and System Sciences
%V 32
%N 3
%D June 1986
%P 393-406
%K AI11

%A J. A. Bergstra
%A J. W. Klop
%T Conditional Rewrite Rules: Confluence and Termination
%J Journal of Computer and System Sciences
%V 32
%N 3
%D June 1986
%P 323-362
%K AI14

%A M. S. Esparz
%T High-Priced Lisp Hardware Obsolete in Near Future, Says Study
%J InfoSystems
%V 33
%N 9
%D September 1986
%P 16
%K H02

%A D. H. Feedman
%T Expert Systems Moving from Glamour Technology to Workhorse
%J InfoSystems
%V 33
%N 9
%D September 1986
%P 14-15
%K AI01

%A Ewa Orlowska
%T Semantic Analysis of Inductive Reasoning
%J Theoret. Comput. Sci
%V 43
%N 1
%D 1986
%P 81-89
%K AI16

%A Francoise Bellegarde
%T Convergent Term Rewriting Systems can be Used for Program Transformation
%B  Programs as Data Objects
%S Lecture Notes in Computer Science
%V 217
%I Springer-Verlag
%C Berlin-New York
%D 1986
%P 24-41
%K AA08 AI14

%A Adolfo Lagomasino
%A Andrew P. Sage
%T Imprecise Knowledge Representation in Inferential Activities
%B Approximate Reasoning in Expert Systems
%E Madan M. Gupta
%E Abraham Kandel
%E Wyllis Bandler
%E Jerry B. Kiszka
%I North Holland  Publishing Co.
%C Amsterdam-New York
%D 1985
%P 473-497
%K O04

%A Murray Eden
%A Michael Unser
%A Riccardo Leonardi
%T Polynomial Representation of Pictures
%J Signal Process.
%V 10
%N 4
%D 1986
%P 385-393
%K AI06

%A Christian Ronse
%T Definitions of Convexity and Convex Hulls in Digital Images
%J Bull. Soc. Math. Belg. Ser. B
%V 37
%N 2
%D 1986
%P 71-85
%K AI06

%A David C. Rine
%T Some Applications of Multiple-Valued Logic and Fuzzy Logic to Expert Systems
%B Approximate Reasoning in Expert Systems
%E Madan M. Gupta
%E Abraham Kandel
%E Wyllis Bandler
%E Jerry B. Kiszka
%I North Holland  Publishing Co.
%C Amsterdam-New York
%D 1985
%P 407-434
%K O04 AI01

%A Hung T. Nguyen
%A Irwin R. Goodman
%T On Foundations of Approximate Reasoning
%B Approximate Reasoning in Expert Systems
%E Madan M. Gupta
%E Abraham Kandel
%E Wyllis Bandler
%E Jerry B. Kiszka
%I North Holland  Publishing Co.
%C Amsterdam-New York
%D 1985
%P 47-59
%K AI16 O04 AI01

%A S. T. Wierzchon
%T Mathematical Tools for Knowledge Representation
%B Approximate Reasoning in Expert Systems
%E Madan M. Gupta
%E Abraham Kandel
%E Wyllis Bandler
%E Jerry B. Kiszka
%I North Holland  Publishing Co.
%C Amsterdam-New York
%D 1985
%P 61-69
%K AI16 O04 AI01

%A A. Lananer
%T Associate Processing in Brain Theory and Artificial Intelligence
%B Brain Theory
%I Springer-Verlag
%C Berlin-New York
%D 1986
%P 193-210
%P 193-210
%K AI08 AI16

%A Lawrence R. Baniner
%A Jay G. Wilpon
%A Biing-Hwang Juang
%T A Segmental k-Means Training Procedure for Connected Word Recognition
%J AT&T Technical Journal
%V 65
%N 3
%D May-June 1986
%P 21-40
%K AI04 AI05

%A A. A. Natan
%A A. I. Samylovskiy
%T Recognition of Gaussian Random Processes by Local Analysis of Their
Properties
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 128-135
%K AI06

%A M. V. Fomina
%T Methods for Successive Construction of a Hierarchical Representation of
the States of a Complex Object
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 136-145
%K AI16

%A L. B. Groysberg
%T Planning of Component Tests for Confirmation of System Reliability
%J Automation and Remote Control
%V 47
%N 2 Part 2
%D February 1986
%P 146-153
%K AI16  AA05

%A E. Vidal Ruiz
%T An Algorithm for Finding Nearest Neighbors in (Approximately) Constant
Average Time
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 145-158
%K AI06 O06

%A S. K. Pal
%A P. K. Pramanik
%T Fuzzy Measures in Determining Seed Points in Clustering
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 159-164
%K O06

%A G. T. Toussaint
%T Interactive Curve Drawing by Segmented Bezier Approximation with a
Control Parameter
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 171-176
%K O06

%A A. Rosenfeld
%T Continuous Functions on Digital Pictures
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 177-184
%K AI06

%A E. R. Davies
%T Image Space Transforms for Detecting Straight Edges in Industrial Images
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 185-192
%K AI06

%A S. K. Parui
%A S. Eswara Sarma
%A D. Dutta Majumder
%T How to Discriminate Shapes Using Shape Vector
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 201-204
%K AI06

%A A. Schening
%A H. Nieman
%T Computing Depth from Stereo Images by Using Optical Flow
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 205-212
%K AI06

%A T. H. Phillips
%A A. Rosenfeld
%T A Simplified Method of Detecting Structure in Glass Patterns
%J Pattern Recognition Letters
%V 4
%N 3
%D July 1986
%P 213
%K AI06

%A J. K. Mattila
%T On Some Logical Points of Fuzzy Conditional Decision Making
%J Fuzzy Sets and Systems
%V 20
%N 2
%D October 1986
%P 137-146
%K O04

%A K. Nakamura
%T Preference Relations on a Set of Fuzzy Utilities as
a Basis for Decision Making
%J Fuzzy Sets and Systems
%V 20
%N 2
%D October 1986
%P 147-162
%K AI13 O04

%A M. R. Casals
%A M. A. Gil
%A P. Gil
%T On the Use of Zadeh's Probabilistic Definition for
Testing Statistical Hypothesis from Fuzzy Information
%J Fuzzy Sets and Systems
%V 20
%N 2
%D October 1986
%P 175-190
%K O04

%A P. Dallant
%A A. Meunier
%A P. S. Christel
%A L. Sedel
%T Semi-automatic Image-Analysis Applied to the Quantification
of Bone Microstructure
%J Journal of Biomedical Engineering
%V 8
%N 4
%D October 1986
%P 320-328
%K AA01 AI06

%A C. E. Riese
%A S. M. Zubrick
%T Using Rule Induction to Combine Declarative and Procedural Knowledge
Representations
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 603-606
%K AI16 AI04

%A D. S. Prerau
%A A. S.Gunderson
%A R. E. Reinke
%A S. K. Goyal
%T The COMPASS Expert System: Verification, Technology Transfer, and
Expansion
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 597-602
%K AI01

%A B. Pinkowski
%T A Lisp-based System for Generating Diagnostic Keys
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 592-596
%K T01

%A S. R. Mukherjee
%A M. Sloan
%T Positional Representation of English Words
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 587-591
%K AI02

%A J. H. Martin
%T Knowledge Acquisition Through Natural Language Dialogue
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 582-586
%K AI02

%A D. M. Mark
%T Finding Simple Routes: 'Ease of Description' as an Objective Function
in Automated Route Selection
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 577-581

%A S. Mahalingam
%A D. D. Sharma
%T WELDEX - An Expert System for Nondestructive Testing of Welds
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 572-576
%K AA05 AI01

%A J. Liebowitz
%T Evaluation of Expert Systems: An Approach and Case Study
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 564-571
%K AI01

%A S. J. Laskowski
%A H. J. Antonisse
%A R. P. Bonasso
%T Analyst II: A Knowledge-Based Intelligence Support System
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 558-563
%K AA18

%A D. A. Krawczak
%A P. J. Smith
%A S. J. Shute
%A M. Chignell
%T EP-X: A Knowledge-Based System to Aid in Search of the Environmental
Pollution Literature
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 552-557
%K AA14 AI01 AA10

%A E. Y. Kandrashina
%A O. N. Ochakovskaja
%A Y. A. Zagorulko
%T Time-1: Semantic System for Dynamic Object Domain
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 548-551
%K AI16

%A C. I. Kalme
%T A General Purpose Language for Coupled Expert Systems
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 539-547
%K T03 H03 AI01

%A J. R. James
%A P. P. Bonissone
%A D. K. Frederick
%A J. H. Taylor
%T A Retrospective View of CACE-III: Considerations in Coordinating Symbolic
and Numeric Computation in a Rule-Based Expert System
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 532-538
%K T03 AI14 AI01

%A R. T. Hartley
%T Representation of Procedural Knowledge for Expert Systems
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 526-531
%K AI16 AI01

%A J. J. Hannan
%A P. Politakis
%T ESSA: An Approach to Acquiring Decision Rules for Diagnostic Expert
Systems
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 520-525
%K AA21

%A K. Hammer
%A J. Hardin
%A D. Rudisill
%A A. Goldfein
%T Using a Predictive Parse to Create a Modeless Editor
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 514-519
%K AA15

%A R. L. Constable
%T Implementing Mathematics with the Nupri Proof Development System
%I Prentice-Hall
%C Englewood Cliffs, NJ
%D 1986
%K AI11 AA13
%X 299 pages $21.95

%A L. O. Hall
%A W. Bandler
%T Relational Knowledge Acquisition
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 509-513
%K AI16

%A W. D. Hagament
%A M. Gardy
%T MEDCAT/CATS: Two Contrasting Artificial Intelligence Applications in
Medical Education
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 503-508
%K AA07 AA01

%A J. F. Gilmore
%A K. Pulaski
%T A Survey of Expert System Tools
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 498-502
%K T03

%A A. Garcia-Ortiz
%T Computer  Algebra Applied to the Design of Optical Sensor Platforms
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 493-497
%K AI14 AA16

%A B. R. Fox
%A K. G. Kempf
%T Complexity, Uncertainty, and Opportunistic Scheduling
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 487-492
%K O04 AA05 AI16 O06 AI03

%A M. E. Cohen
%A D. L. Hudson
%A N. Gitlin
%A L. T. Mann
%A J. Van den Bogaerde
%A L. Leal
%T Knowledge Representation and Classification of Chromatographic Data for
Diagnostic Medical Decison Making
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 481-486
%K AA02 AA01

%A F. Brundick
%A J. Dumer
%A T. Hanratty
%A P. Tanenbaum
%T GENIE: An Inference Engine with Diverse Applications
%J The Second Conference on Artificial Intelligence Applications
%D 1985
%P 473-480
%K T03

%A H. Winter
%T Artificial Intelligence in Man-Machine Systems
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 1-22
%K AA15

%A J. Mylopoulos
%A A. Borgida
%A S. Greenspan
%A C. Meghini
%A B. Nixon
%T Knowledge Representation in the Software Development Process - A Case Study
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 23-44
%K AA08

%A B. Radig
%T Design and Applications of Expert Systems
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 45-61
%K AA08

%A W. Wahlster
%T The Role of Natural Language in Advanced Knowledge Based Systems
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 62-83
%K AI02 AA15

%A G. Fischer
%T Cognitive Science - Information Processing in Humans and Computers
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 84-111
%K AI08

%A A. Meystel
%T Knowledge-Based Controller for Intelligent Mobile Robots
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 112-140
%K AI07 AA19

%A S. E. Cross
%A R. B. Bahnij
%A D. O. Norman
%T Knowledge-Based Pilot Aids - A Case Study in Mission Planning
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 141-174
%K AA19

%A U. Volckers
%T Dynamic Planning and Time-Conflict Resolution in Air Traffic Control
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 175-197
%K AI09 O03

%A L. A. Zadeh
%T Outline of a Computational Approach to Meaning and Knowledge Representation B
ased on
the Concept of a Generalized Assignment Statement
%B Artificial Intelligence and Man-Machine Systems
%E H. Winter
%V 80
%S Lecture Notes in Control and Information Sciences
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 198
%K O04 AI16

%A J. K. Kastner
%T Continuous Real-Time Expert System for Computer Operations
%J Data Processing
%V 28
%N 8
%D October 1986
%P 411-425
%K O03 AA08 AI01

%A Keith Clark
%A Steve Gregory
%T PARLOG: Parallel Programming in Logic
%J ACM Transactions on Programming Languages and Systems
%V 8
%N 1
%D January 1986
%P 1-49
%K AI10 H03

%A G. I. Janbykh
%T Optimization of the Structure of Computer Networks Using Branch and Bound
%J Avtomatika I. vychisletenlnaya Teknika
%N 5
%D September-October 1986
%P 3-13
%K AA08 AI03

%A W. Rauchhindin
%T Software Integrates AI, Standard Systems
%J Mini-Micro Systems
%V 19
%N 12
%D October 1986
%P 69-86

%A Dragan Kolar
%A Vojislav Stojkovic
%T The Implementation of CF Grammars by PROLOG Language
%J Univ. u Novm Sadu Zb. Rad. Prirod. Mat Fak. Ser. Mat
%V 15
%N 1
%P 245-252
%K T02

%A Krzysztof R. Apt
%A Dexter C. Kozen
%T Limits for Automatic Verification of Finite-tate Concurrent Systems
%J Inform. Process. Lett
%V 22
%N 6
%D 1986
%P 307-309
%K AA08

%A Robert L. Constable
%T Constructive Mathematics as a Programming Logic I. Some Principles of Theory
%B Topics in the Theory of Computation (Borgholm, 1983)
%V 102
%S North-Holland Math. Stud.
%I North Holland
%C Amsterdam-New York
%D 1985
%P 21-37
%K AI10 AA13

%A H. Langmaack
%T A New Transformational Approach to Partial Correctness Proof Calculi for ALGO
L
68-Like Programs with Finite Modes and Simple Side Effects
%B Topics in the Theory of Computation (Borgholm, 1983)
%V 102
%S North-Holland Math. Stud.
%I North Holland
%C Amsterdam-New York
%D 1985
%D 1985
%P 73-102

%A Philippe Devienne
%A Patrick Lebegue
%T Weighted Graphs: A Tool for Logic Programming
%B CAAP 86 (Nice, 1986)
%V 214
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 100-111
%K AI10

%A James S. Royer
%T Inductive Inferences of Approximations
%J Information and Control
%V 70
%N 2-3
%D August-September 1986
%P 156-178
%K AI03

%A Sergiu Hart
%A Micha Sharir
%T Probabilistic Propositional Temporal Logics
%J Information and Control
%V 70
%N 2-3
%D August-September 1986
%P AI10 AI16 O04 AI11

%A K. Yalumov
%T KET: A Knowledge Engineering Tool
%J Computers in Industry
%V 7
%N 5
%D October 1986
%P 417-426
%K T03

%A S. F. Bocklisch
%T A Diagnosis Sytem Based on Fuzzy Classification
%J Computers and Industry
%V 7
%N 1
%D February 1986
%P 73-82
%K AI01 O04

%A Justin R. Smith
%T Parallel Algorithms for Depth-first Searches I. Planar Graphs
%J SIAM J. Comput.
%V 15
%N 3
%D 1986
%P 814-830
%K AI03 O06

%A N. N. Nepievoda
%T Deductions in the Form of Graphs
%J Semiotics and Information Science
%N 26
%D 1985
%P 52-82
%X Akad. Nauk SSSR, Vsesoyuz. Inst. Nauchn. i Tekhn. Inform., Moscow
(in Russian)

%A Yu. I. Petunin
%A G. A. Shuldeshov
%T Calculation of a Plane Figure from its Discretized Image
%J Kibernetika (Kiev)
%N 2
%D 1986
%P 1-7
%K AI06
%X Russian with English Summary

%A Shuro Nagata
%A Takeshi Oshiba
%A Sakae Funahashi
%T An Implementation of a Validity Checking Program by Using N-set Partitions
%J Bull. Nagoya Inst. Tech
%V 37
%D 1985
%D 1986
%P 111-116
%K AA08
%X Japanese with English Summary

%A Alex Pelin
%A Jean H. Gallier
%T Exact Computation Sequences
%B CAAP 86 (Nice, 1986)
%V 214
%I Springer-Verlag
%C Berlin-Heidelberg-New York
%D 1986
%P 45-59

%A Henri Prade
%T Corrections to: "A Simple Inference Techique for Dealign with Uncertain
Facts in terms of possibility" (Kybernetes 15 (1986) no. 1 19-24
%J Kybernetes
%V 15
%N 3
%P 214
%K O04 AT13

%A Ronald R. Yager
%T A Note on Projections of Conditional Possibility Distributions in Approximate
Reasoning
%J Kybernetes
%V 15
%N 3
%P 185-187
%K O04

%A R. I Podlovchenko
%T Investigation of s-models of programs from the standpoint of
constructing canonization algorithms for them.
%J Programmirovanie
%N 2
%D 1986
%P 3-13
%K AA08
%X Russian

%A Manfred Broy
%A Bernhard Moller
%A Peter Pepper
%A Martin Wirsing
%T Algebraic Implementations Preserve Program Correctness
%J Sci Comput. Programming
%V 7
%N 1
%D 1986
%P 35-53
%K AA08

%A Yu Qi Guo
%A Lian Li
%A Gang Wu Xu
%T On the Disjunctive Structure of Dense Languages
%J Sci. Sinica Ser. A
%V 28
%N 12
%D 1985
%P 1233-1238

%A Thomas A. Joseph
%A Thomas Rauchle
%A Sam Toueg
%T State Machines and Assertions: An Integrated Approach to Modeling
and Verification of Distributed Systems
%J Sci. Comput. Programming
%V 7
%N 1
%D 1986
%P 1-22

%A Takeshi Shinohara
%T Inductive Inference of Formal Systems From Positive Data
%J Bull Inform. Cybernet.
%V 22
%N 1-2
%D 1986
%P 9-18
%K AI04

%A Moshe Y. Vardi
%T Automata-Theoretic Techniques for Modal Logics of Programs
%J J. Comput. System Sci.
%V 32
%N 2
%D 1986
%P 183-221

%A John N. Martin
%T Some Formal Properties of Indirect Semantics
%J Theoret. Linguist
%V 12
%N 1
%D 1985
%P 1-32
%K AI02 AI16

%A Makoto Haraguchi
%T Analogical Reasoning Using Transformation of Rules
%J Bull. Inform. Cybernet.
%V 22
%N 1-2
%D 1986
%P 1-8
%K AI16

%A Takahashi Yokomori
%T Representation Theorems and Primitive Predicates for Logic Programs
%J Bull. Inform. Cybernet.
%V 22
%N 1-2
%D 1986
%P 19-37
%K AI11

%A Matthias Baaz
%A Alexander Leitsch
%T The Application of Strong Reduction Rules in Automatic Proofs
%J Osterreich Akad. Wiss. Math.-Natur. KL Sitzungsber. II
%V 194
%N 4-10
%D 1985
%P 287-307
%K AA08

%A Michael Leyton
%T A Theory of Information I. General Principles
%J J. Math. Psych.
%V 30
%N 2
%D 1986
%P 103-160
%K AI16 AI08

%A J. J. Harvey
%T Expert Systems: An Introduction
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 100-108
%K AI01 AT08

%A J. J. Harvey
%T ESSAI Expert Systems Toolkit
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 109-114
%K AI01 T03

%A M. A. Newstead
%A R. Pettipher
%T Knowledge Acquisition for Expert Systems
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 115-121
%K AI01

%A G. Jones
%A R. Nuttall
%A K. Stone
%T Integrating Multiple Control Schemes
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 122-127
%K AI01

%A R. Gunhold
%A J. Zettel
%T System 12 In-Factory Testing
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 128-134
%K AA04 AI01

%A H. Schelfhout
%T Customer Application Engineering for System 12 Hardware
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 135-140
%K AA04 AI01

%A N. Theuretzbacher
%T Expert System Technology for Safety-Critical Real-Time Systems
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 147-153
%K AI01 O03

%A M. Thandasseri
%T Expert Systems Application for TXE4A Exchanges
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 154-161
%K AI01 AA04

%A P. Benson
%T Artificial Intelligence Assisted Packet Radio Connectivity
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 162-167
%K AI01 AA04

%A E. Gaudry
%T Electronic Warfare Application for Expert Systems
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 168-173
%K AA18

%A M. E. Atwood
%A E. R. Radlinski
%T Diagnostic System Architecture
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 174-179
%K AA21

%A M. E. Atwood
%A R. Brooks
%A E. R. Radlinski
%T Causal Models: The Next Generation of Expert Systems
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 180-184
%K AI01 AI16

%A D. Neiman
%T Technological Considerations for Industrial Expert Systems Applications
%J Electrical Communication
%V 60
%N 2
%D 1986
%P 185
%K AI01

%A M. Chester
%T The Military Reconnoiters Neural Systems
%J Electronics Product Magazine
%V 29
%N 10
%D October 15 1986
%P 78-82
%K AI12 AA18

%A Dennis de Champeaux
%T Subproblem Finder and Instance Checker, Two Cooperating Modules for Theorem
Provers
%J JACM
%V 33
%N 4
%D October 1986
%P 633-657
%K AI11

%A W. Eric L. Grimson
%T The Combinatorics of Local Constraints in Model-Based Recognition and Localiz
ation
from Sparse Data
%J JACM
%V 33
%N 4
%D October 1986
%P 658-686
%K AI06

%A B. Ramamurthi
%A A. Gersho
%T Classified Vector Quantization of Images
%J IEEE Transactions on Communications
%V 34
%N 11
%D November 1986
%P 1105-1115
%K AI06

%A R. Buhr
%T Front-face Analysis and Classification
%J ntzArchiv
%V 8
%N 10
%D October 1986
%P 245-256
%K AI06

%A E. M. Clarke
%A E. A. Emerson
%A A. P. Sistla
%T Automatic Verification of Finite-State Concurrent Systems Using Temporal
Logic Specifications
%J ACM TRANS on Programming Languages and Systems
%V 8
%N 2
%D April 1986
%P 244-265
%K AA08

%A R. Narasimhan
%T Artificial Intelligence in 5th-Generation Computers
%J SADHANA-Acad. Proc. Eng. Sci
%V 9
%D September 1986
%P 71-84
%K AI16

%A P. V. S. Rao
%A K. K. Paliwal
%T Automatic Speech Recognition
%J SADHANA-Acad. Proc. Eng. Sci
%V 9
%D September 1986
%P 85-120
%K AI05

%A D. D. Majumder
%T Pattern Recognition, Image Processing and Computer Vision in 5th Generation
Computer Systems
%J SADHANA-Acad. Proc. Eng. Sci
%V 9
%D September 1986
%P 139
%K AI06

%A A. Victor Cabot
%A S. Selcuk Erenguc
%T A Branch and Bound Algorithm for Solving a Class of Nonlinear Integer
Programming Problems
%J Naval Research Logistics Quarterly
%P 559-568
%K AI03

%A Terry Winograd
%A Fernando Flores
%T Understanding Computers and Cognition
%I Ablex Publishing Corporation
%C Norwood, NJ
%D 1986
%K AT15 AI08 AI16
%X 224 pages ISBN 0-89391-050-3 $24.95

%A Tsuyoshi Yamamoto
%T An Application of List Processing Artificial Intelligence to Computer
Graphics and CAD
%J Pixel
%N 40
%D 1986
%P 80-85
%K AA04 UNIX graphics T01

%A R. Hauser
%T NewCAT: Parsing Natural Language Using Left-Associative Grammar
%S Lecture Notes in Computer Science
%V 231
%I Springer-Verlag
%D 1986
%K AT15 AI02
%X 540 pages Figures, $34.80 ISBN 3-540-16781-1

%A T. Samad
%T Natural Language Interface for Computer-Aided Design
%S Kluwer International Series in Engineering and Computer Science
%V 14
%I Kluwer Academic Publishers
%D 1986
%X 188 pages, $38.95, ISBN 0-89838-222-X

%A P. E. Utgoff
%T Machine Learning of Inductive  Bias
%S Kluwer INternational Series in Engineering and Computer Science
%V 15
%I Kluwer Academic Publishers
%D 1986
%X 165 pages, $37.50, ISBN 0-89838-223-8

%A S. P. Dutta
%A R. S. Lashkari
%A G. Nadoli
%A T. Ravi
%T A Heuristic Procedure for Determining Manufacturing Families
from Design-Based Grouping for Flexible Manufacturing Systems
%J Computers and Industrial Engineering
%V 10
%N 3
%D 1986
%P 193-202
%K AA26

%A Efraim Turban
%T Expert Systems- Another Frontier for Industrial Engineering
%J Computers and Industrial Engineering
%V 10
%N 3
%D 1986
%P 227-236
%K AI01

%A Michael M. Skolnick
%T Application of Morphological Transformation to the Analysis of
Two-Dimensional Electrophoretic Gels of Biological Materials
%J Computer Vision, Graphics, and Image Processing
%V 35
%N 3
%D September 1986
%P 306-332
%K AA10 AI06

%A Stanely R. Sternberg
%T Grayscale Morphology
%J Computer Vision, Graphics, and Image Processing
%V 35
%N 3
%D September 1986
%P 333-354
%K AI06

%A Fernand Meyer
%T Automatic Screening of Cytological Specimens
%J Computer Vision, Graphics, and Image Processing
%V 35
%N 3
%D September 1986
%P 356-369
%K AA10 AI06

%A Xinhua Zhuang
%A Robert M. Haralick
%T Morphological Structuring Element Decomposition
%J Computer Vision, Graphics, and Image Processing
%V 35
%N 3
%D September 1986
%P 370-382
%K AI06

%A Leonardo C. Topa
%A Robert J. Schalkoff
%T An Analytical App[roach to the Determination of Planar Surface Orientation
Using Active-Passive Image Pairs
%J Computer Vision, Graphics, and Image Processing
%V 35
%N 3
%D September 1986
%P 404
%K AI06

%A Akira Shiozaki
%T Edge Extraction Using Entropy Operator
%J Computer Vision, Graphics and Image Processing
%V 36
%N 1
%D October 1986
%P 1-9
%K AI06

%A Son Pham
%T Digital Straight Segments
%J Computer Vision, Graphics and Image Processing
%V 36
%N 1
%D October 1986
%P 10-30
%K AI06

%A Hussein A. H. Ibraham
%A John R. Kender
%A David Elliot Shaw
%T On the Application of Massively Parallel SIMD Tree Machines to Certain
Intermediate Level Vision Tasks
%J Computer Vision, Graphics and Image Processing
%V 36
%N 1
%D October 1986
%P 42-52
%K H03 AI06

%A Marijke F. Augusteijn
%A Charles R. Dyer
%T Recognition and Recovery of the Three-Dimensional Planar Point Patterns
%J Computer Vision, Graphics and Image Processing
%V 36
%N 1
%D October 1986
%P 76-99
%K AI06

%A John Tyler
%T Sppec Recognition System Using Walsh Analysis and Dynamic Programming
%J Microprocessors and Microsystems
%V 10
%N 8
%D October 1986
%P 427-433
%K AI05 H01

%A N. Rushby
%T A Knowledge-Engineering Approach to Instructional Design
%J The Computer Journal
%V 29
%N 5
%N 11
%D October 1986
%P 385-389
%K AA07

%A H. Barringer
%A I. Mearns
%T A Proof System for ADA Tasks
%J The Computer Journal
%V 29
%N 5
%N 11
%D October 1986
%P 404-415
%K AA08 AI11

%A J. M. Hoc
%T Review of Introduction Expert Systems by M. Gondran
%J Le Travail Human
%V 49
%N 3
%D September 1986
%P 278
%K AT15 AI01

%A J. M. Hoc
%T Review of Man Faced with Artificial Intelligence by J. D. Warnier
%J Le Travail Human
%V 49
%N 3
%D September 1986
%P 280
%K AT15

%A E. Schuster
%A P. Knoflach
%A K. Huber
%A G. Grabner
%T An Interactive Processing System for Ultrasonic Compound Imaging,
Real-Time Image Processing and Texture Analysis
%J Ultrasonic Imaging
%V 8
%N 2
%D 1986
%P 131
%K AA01 AI06

%A R. Opie
%T Expert Systems Developing Applications
%J Control and Instrumentation
%V 18
%N 10
%D 1986
%P 57-60
%K AI01