index
int64
0
18.8k
text
stringlengths
0
826k
year
stringdate
1980-01-01 00:00:00
2024-01-01 00:00:00
No
stringlengths
1
4
400
Mixing Binary and Continuous Connection Schemes for Knowledge Access N.E. Sharkey. R.F.E. Sutcliffe and W.R. Wobcke*. Centre for Cognitive Science, University of Essex, UNITED KINGDOM. ABsTRAcr We present BACAS. a Binary and Conti...
1986
135
401
CHEF: A Model of Case-based Planning.* Kristian J. Hammond Department of Computer Science Yale University ABSTRACT Case-based planning is based on the idea that a machine planner should make use of its own past experience in developing new plans, relying on its m...
1986
136
402
The Structure-Mapping Engine* Brian Falkenhainer Kenneth D. Forbus Qualitative Reasoning Group Dedre Gentner Psychology Department University of Illinois 1304 W. Springfield Ave Urbana, Illinois, 61801 ABSTRACT This paper describes the Structure-Mapping ...
1986
137
403
SNePS CONSIDERED AS A FULLY INTENSIONAL PROPOSITIONAL SEMANTIC NETWORK Stuart C. Shapiro and William J. Rapaport Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260 { rapaport 1 Shapiro }%buffalo@csnet-relay ABSTRACT W’e present ...
1986
138
404
A QUANTITATIVE ANALYSIS OF ANALOGY BY SIMILARITY Stuart J. Russell Department of Computer Science Stanford University Stanford, CA 94305 ABSTRACT In the absence of specific relevance information, the tradi- tional assumption in the study of analogy has been that the mo...
1986
139
405
SCAT, AN AUTOMATIC-PROGRAMMING TOOL FOR TELECOMMUNICATIONS SOFTWARE S. Barra, 0. Ghisio, F. Manucci CSELT - via G. Reiss Romoli, 274 - 10148 Turin (Italy) ABSTRACT The size, complexity and long 1 ife-time of telecommunications software, e.g. the...
1986
14
406
HYPOTHETICALS AS HEURISTIC DEVICE * Edwina L. Rissland and Kevin D. Ashley Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01002 (413) 545-0332 Abstract In this paper we examine the use of hypotheticals as a heuristic device ...
1986
140
407
ABSTRACT CAN A SYSTEM BE INTELLIGENT IF IT NEVER GIVES A DAMN? Thomas Edelson Department of Computer Science Georgetown University Washington, DC 20057 I explore whether all types of cognitive faculties are possible in a system which does not also have ...
1986
141
408
Debugging User Conceptions of Interpretation Processes M. J. Coon&*, R. T. Hartley* and J. G. Stellt *Computing Research Laboratory, New Mexico State University TDepartment of Computer Science, Manchester University, U.K. ABSTRACT The use of high level declara...
1986
142
409
IMPOSING STRUCTURE ON LINEAR PROGRAMMING PROBLEMS: AN EMPIRICAL ANALYSIS OF EXPERT AND NOVICE MODELS Wanda Orlikowski Vasant Dhar Department of Computer Applications and Information Systems New York University ABSTRACT Research on expert-novice ...
1986
143
410
INTELLIGENT TUTORING SYSTEMS BASED UPON QUALITATIVE MODEL EVOLUTIONS Barbara Y. White and John R. Frederiksen BBN Laboratories 10 Moulton Street Cambridge, MA 02238 ABSTRACT One promising educational application of computers derives from their ability to ...
1986
144
411
An Analysis of Tutorial Reasoning About Programming Bugs David C. Littman, Jeannine Pinto & Elliot Soloway Cognition and Programming Project Department of Computer Science Yale University Abstract New Haven, CT 06620 what knowledge to teach a stude...
1986
145
412
Constraint Propagation Algorithms for Temporal Reasoning Marc Vilain Henry Kautz BBN LABORATORIES UNIVERSITY OF ROCHESTER 10 MOULTON ST. COMPUTER SCIENCE DEPT. CAMBRIDGE, MA 02238 ROCHESTER, NY 14627 Abstract: This paper considers computational aspects of several temporal representat...
1986
146
413
What Can Machines Know? On the Epistemic Properties of Machines Ronald Fagin Joseph Y. Halpern Moshe Y: Vardi IBM Almaden Research Center 650 Harry Road San Jose, California 95 120-6099 Abstract: It has been argued that knowledge is a useful tool for designing and a...
1986
147
414
IS BELIEF REVISION HARDER THAN YOU THOUGHT? Marianne Winslett’ Stanford University, Computer Science Dept. Stanford CA 94305 Abstract. Suppose one wishes to construct, use, and maintain a knowledge base (KB) of beliefs about the real world, even though the facts about that w...
1986
148
415
Self-Reference, Knowledge, Belief, and Modality Donald Perlis University of Maryland Department of Computer Science College Park, Maryland 20742 ABSTRACT An apparently negative result of Montague has diverted research in formal modalities ...
1986
149
416
SYSTEM INTEGRATION OF KNOWLEDGE-BASED MAINTENANCE AIDS Christopher A. Powell, Cynthia K. Pickering, & Keith T. Wescourt FMC Central Engineering Laboratories 1185 Coleman Ave Box 580 Santa Clara, CA 95052 ABSTRACT There are many examples of knowledg...
1986
15
417
A VIEWPOINT DISTINCTION IN THE REPRESENTATION OF PROPOSITIONAL ATTITUDES John A. Bamden Computer Science Department Indiana University Bloomington, Indiana 47405 ABSTRACT A representation scheme can be used by a cognitive agent as a basis for its normal, inbuilt cognitive...
1986
150
418
POINTWISE CIRCUMSCRIPTION: PRELIMINARY REPORT Vladimir Lifschitz Department of Computer Science St an ford IIniversity Stanford, CA 94305 Abstract Circumscription is the minimization of predicates subject to restrictions expressed by predicate formulas. ...
1986
151
419
THE LOGIC OF PERSISTENCE Henry A. Kautz Department of Computer Science University of Rochester Rochester, New York 14627 ABSTRACT A recent paper [Hanks19851 examines temporal rea- soning as an example of default reasoning. They conclude that all current systems of default reasoning, including...
1986
152
420
A COMPARISON OF THE COMMONSENSE AND FIXED POINT THEORIES OF NONMONOTONICITY Dr. Frank M. Brown Department of Computer SC University Lawrence ABSTRACT The mathematical fixed point theories of nonmonotonic reasoning are examined and compared to a commonsense ...
1986
153
421
Chronological Ignorance Time, Nonmonotonicity, Necessity and Causal Theories Yoav Shoham Yale University Computer Science Department Abstract. Concerned with the problem of reason- ing efficiently about change within a formal system, we identify the initiution problem....
1986
154
422
Propagating temporal constraints for scheduling ing Jean-Francois Rit LIFIA, BP 68, 38402 Saint-Martin-d’Heres, FRANCE ITMI, Chemin des pres, ZTRST, 38240 Meylan, FRANCE Abstract We give in this article a general frame for propagat- temporal constraints over events, these events be- ...
1986
155
423
A REPRESENTATION FOR TEMPORAL SEQUENCE AND DURATION IN MASSIVELY PARALLEL NETWORKS: Exploiting Link Interactions Hon Wai Chun Computer Science Department Brandeis University Waltham, MA 02254 U.S.A. ABSTRACT One of the major representational ...
1986
156
424
A REPRESENTATION FOR COLLECTIONS OF TEMPORAL INTERVALS* Bruce Leban, David D. McDonald and David R. Forster Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 ABSTRACT Temporal representation and reasoning are necessary components of sy...
1986
157
425
Default geasoning, Nonmonotonic Logics, and the Frame Problem Steve Hanks and Drew McDermott’ Department of Computer Science, Yale University Box 2158 Yale Station New Haven, CT 06520 Abstract Nonmonotonic formal systems have been proposed as an exten- sion to classica...
1986
158
426
Time Representation: A Taxonomy of Interval Relations * Peter Ladkin Kestrel Institute 1801 Page Mill Road Palo Alto, Ca 94304-1216. Abstract James Allen in [AZZ2] formulated a calculus of convex time in- tervals, which is being applied to commonsense reasoning by Allen, ...
1986
159
427
Star Pl an I I Evolution of an Expert System Ronald W. Siemens, Marilyn Golden, and Jay C. Ferguson Ford Aerospace & Communications Corporation Sunnyvale Operation, 1260 Crossman Avenue Sunnyvale, California 94089-1198, (408)743-3206 ABSTRACT An expert system for satel...
1986
16
428
Primitives and Units for Time Specification * Peter Ladkin Kestrel Institute 1801 Page Mill Road Palo Alto, Ca 94304-1216. Abstract We work in a calculus of intervals, formulated by James Allen for convex intervals, and by ourselves for unions of convex in-...
1986
160
429
On the Parallel Complexity of Some Constraint Satisfaction Problems Simon ICasif Department of Electrical Engineering and Computer Science The Johns Hopkins University ABSTRACT Constraint satisfaction networks have been shown to be a very useful tool ...
1986
161
430
A Four-Valued Semantics for Frame-Based Description Languages Peter F. Patel-Schneider Schlumberger Palo Alto Research 3340 Hillview Avenue Palo Alto, CA 94304 ABSTRACT One severe problem in frame-based description languages in that computing subsu...
1986
162
431
ON THE LOGIC OF PROBABILISTIC DEPENDENCIES Judea Pearl Cognitive Systems Laboratory, Computer Science Dept., UCLA, Los Angeles, CA. 90024 ABSTRACT This paper uncovers the axiomatic basis for the probabilistic relation “x is independent of y , given z ” and offers it as a formal definition of inform...
1986
163
432
INFERENCE IN A TOPICALLY ORGANIZED SEMANTIC NET Johannes de Haan and Lenhart K. Schubert Department of Computing Science, University of Alberta Edmonton, Alberta, Canada T6G 2Hl ABSTRACT A semantic net system in which knowled; ge is topically or- ganized...
1986
164
433
ARE THERE PREFERENCE TRADE-OFFS IN ATTACHMENT DECISIONS? Lenhart K. Schubert Department of Computing Science University of Alberta, Edmonton Abstract. The paper argues for an affirmative answer to the question, against the view that correct attachment decisions can be ...
1986
165
434
COMPREHENSION-DRIVEN GENERATION OF META-TECHNICAL UTTERANCES IN MATH TUTORING* Ingrid Zukerman and Judea Pearl Cognitive Systems Laboratory, Computer Science Department, UCLA, Los Angeles, CA 90024 ABSTRACT A technical discussion often contains conversa- tional expr...
1986
166
435
A LOGICAL-FORM AND KNOWLEDGE-BASE DESIGN FOR NATURAL LANGUAGE GENERATION* Norman K. Sondheimer USC/information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 ABSTRACT This paper presents a technique for interpreting output demands by a natural ...
1986
167
436
CSDERSTANDISG PLAN ELLIPSIS Diane J. Litman AT&T Bell Laboratories 3C-308A 600 Mountain Avenue Murray Hill. NJ 07974’ ABSTRACT This paper presents an extended and unified approach to the interpretation of sentence fragments and elliptical utterances with...
1986
168
437
DYNAMICALLY COMBINING SYNTAX AND SEMANTICS IN NATURAL LANGUAGE PROCESSING Steven L. Lytinen Department of Computer Science Yale University Box 2158 Yale Station New Haven, CT 00520, USA ABSTRACT A controversy has existed over the interaction of syntax...
1986
169
438
P.I.E.S.: An Engineer’s “Do-It-Yourself’ Knowledge System for Interpretation of Parametric Test Data Jeff Yung-Choa Pan and Jay M. Tenenbaum Schlumberger Palo Alto Research 3340 Hillview Avenue Palo Alto, CA 94304 ABSTRACT PIES is a knowledge system for interpreting the paramet...
1986
17
439
DUAL FRAMES: A NEW TOOL FOR SEMANTIC PARSING Jean-Louis Binot’ IBM Thomas J. Watson Research Center, Hawthorne, P.O. Box 218, Yorktown Heights, N.Y. 10598. ABSTRACT The dual frames method is a new tool for specifying and establishing semantic dependencies, which has been implemented ...
1986
170
440
A NEAT1 THEORY OF MARKER PASSING Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 02912 Abstract We describe here the theory behind the language comprehension program Wimp. Wimp understands by first, fi...
1986
171
441
Using Commonsense Knowledge to Disambiguate Prepositional Phrase Modifiers Dr. K. Dahlgren IBM Los Angeles Scientific Center 11601 Wilshire Blvd. Los Angeles, CA 90025 Abstract This paper describes a method using commonsense knowledge for discarding spurious s...
1986
172
442
Beyond Exploratory Programming: A Methodology and Environment for Conceptual Natural Language Processing Philip Johnson Wendy Lehnert Department of Computer and Information Science University of Massachusetts Amherst, Mass. 01003 Abstract ...
1986
173
443
A SIMPLE MOTION PLANNING ALGORITHM FOR GENERAL ROBOT MANIPULATORS Tom&s Lozano-P&ez MIT Artificial Intelligence Laboratory 545 Technology Square Cambridge, Mass. 02139 USA Abstract: This paper presents a simple and efficient algorithm, using ...
1986
174
444
Tactile Recognition by Probing: Identifying a Polygon on a Plane R. E. Ellis Edward M. Riseman Allen R. Hanson Laboratory for Perceptual Robotics Department of Computer and Information Science University of Massachusetts, Amherst, MA 01003 ABSTRACT An outstanding pr...
1986
175
445
Abstraction and Representation of Continuous Variables in Connectionist Networks Eric Saund Department of Brain and Cognitive Sciences and the Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, Massachusetts 02139 Abstract A method is present...
1986
176
446
SIMD Tree Algorithms for Image Correlation Hussein A. H. Ibrahim John R. Kender David Elliot Shaw Department of Computer Science Columbia University New York, N.Y. 10027 Abstract This paper examines the applicability of fine-grained “pure” tree SIMD machines, ...
1986
177
447
ON THE RECONSTRUCTION OF A SCENE FROM TWO UNREGISTERED IMAGES Harit P Trivedi* GEC Research Limited Long Range Research Laboratory Wembley, Middlesex, UK ABSTRACT It is sometimes desirable to compute depth from unregistered pairs of images. I show that it is possibl...
1986
178
448
Depth and Flow From Motion Energy David J. Heeger CIS Department AI Center University of Pennsylvania SRI International Philadelphia, Pa. 19104 Menlo Park, Ca. 94025 Abstract This paper presents a model of motion perception that utilizes the output of mo...
1986
179
449
Saturn: An Automatic Test Generation System for Digital Circuits Narinder Singh Department of Computer Science Stanford University Stanford, CA 94305 ABSTRACT This paper describes a novel test generation system, called Saturn, for testing digital circuits. The syste...
1986
18
450
SHAPE FROM DARKNESS: Deriving Surface Information from Dynamic Shadows John R. Kender” Earl M. Smith Department of Computer Science Columbia University New York, New York 10027 1 Abstract We present a new method, shape from darkness, for extracting surface shape information bas...
1986
180
451
3-D MOTION RECOVERY FROM TIMEVARYING OPTICAL FLOWS Kwangyoen Wohn and Jian Wu Division of Applied Sciences Harvard University Cambridge, MA 02138 Abstract Previous research on analyzing time-varying image sequences has concentrated on finding...
1986
181
452
A STOCHASTIC APPROACH TO STEREO VISION Stephen T. Barnard Artificial Intelligence Center SRI International 333 Ravenswood Avenue Menlo Park, California 94025 Abstract A stochastic optimization approach to stereo matching is pre- sented. Unlike conventional correl...
1986
182
453
Determining the 3-D Motion of a Rigid Surface Patch without Correspondence, under Perspective Projection: I. Planar Surfaces. II. Curved Surfaces. John (Yiannis) Aloimonos and Isidore Rigoutsos Department of Computer Science The University of Rochester, Rochester, New York 14627. Abstract ...
1986
183
454
Stereo Integral Equation Grahame B. Smith Artificial Intelligence Center, SRI International Menlo Park, California 94025 Abstract A new approach to the formulation and solution of the prob- lem of recovering scene topography from a stereo image pair is presented. The approach circumv...
1986
184
455
PARTS: STRUCTURED DESCRIPTIONS OF SHAPE Alex P. Pentland Artificial Intelligence Center, SRI International Medlo Park, California and Center for the Study of Language and Information Stanford Universitv ABSTRACT ’ A shape representation is presented that has been shown competent ...
1986
185
456
CONSTRAINT-THEOREMS ON THE PROTOTYPIFICATION OF SHAPE Michael Leyton Harvard University and State University of New York at Buffalo * ABSTRACT Mathematical results are presented that strongly constrain the prototypification of complex shape. Such shape requires ...
1986
186
457
LINEAR IMAGE FEATURES IN STEREOPSIS Michael Kass Schlumberger Palo Alto Research 3340 Hillview Ave. Palo Alto, CA 94304 ABSTRACT Most proposed algorithms for solving the stereo corre- spondence problem have used matching based in some way on linear im...
1986
187
458
SIGNAL MATCHING THROUGH SCALE SPACE Andrew Witkin Demetri Terzopoulos Michael Kass Schlumberger Palo Alto Research 3340 Hillview Ave. Palo Alto, CA 94304 ABSTRACT Given a collection of similar signals that have been de- formed with respect to each other, the g...
1986
188
459
A GR7QH’H-oRII!X~ KI- ~REQ!XlZATION AND UNIFICATION TEIcHNIQuEm ~ICATXY SELECTING AND INVOKING So- FUNCTIONS William F. Kaemrrer er and James A. Larson Honeywell wuter Sciences Center Artificial Intelligence Section 1000 Boone Avenue North Golden Valley, Minnesota 55427 A...
1986
19
460
The Butterfly TM Lisp System Seth A. Steinberg Don Allen Laura B agnall Curtis Scott Bolt, Beranek and Newman, Inc. 10 Moulton Street Cambridge, MA 02238 ABSTRACT This paper describes the Common Lisp system that BBN is developing for its ButterflyTM multiprocessor. The BBN ButterflyTM i...
1986
2
461
DESIGNING FOR MANUFACTURABILITY IN RIVETED JOINTS A. R. Kilhoffer Cincom Systems, Inc. 2300 Montana Avenue Cincinnati, OH 45211, USA ABSTRACT The study of human experts in the areas of design and manufacturing has lead to two hypotheses concerning the problem sol...
1986
20
462
APPLICATION OF KNOWLEDGE BASED SYSTEMS TECHNOLOGY TO TRIFLE QUADRUPOLE MASS SPECTROMETRY (TQMS) Hal R. Brand and Carla M. Wong Lawrence Livermore National Laboratory P.O. Box 808, Mail Stop L-365, Livermore, Ca. 94550 ABSTRA...
1986
21
463
PLAN RECOGNITION FOR AIRBORNE TACTICAL DECISION MAKING Jerome Azarewicz Glenn Fala Ralph Fink Christof Heithecker Naval Air Development Center Warminster, PA 18974 ABSTRACT Airborne tactical decision making is degraded as a result of sophisticated ...
1986
22
464
KNOWLEDGE-BASED SIMULATION OF A GLASS ANNEALING PROCESS: AN AI APPLICATION IN THE GLASS INDUSTRY Richard A. Herrod, Ph.D. Jeff Rickel Texas Instruments Incorporated P.O. Box 225474 MS 439 Dallas, Texas 75265 ABSTRACT This paper describes a knowledge-b...
1986
23
465
Qualitative Simulation of Semiconductor Fabrication John Mohammed Schlumberger Palo Alto Research 3340 Hillview Avenue Palo Alto, CA 94304 ABSTRACT As part of a larger effort aimed at providing symbolic, computer-aided tools for semiconductor fabrication ex- perts, we ...
1986
24
466
A RULE-BASED SYSTEM FOR DOCUMENT UNDERSTANDING Debashish Niyogi and Sargur N. Srihari Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260, USA ABSTRACT .A rule-based system to make illfelences about ~CTU~VPUI images is int reduced. ...
1986
25
467
AN EXPERT SYSTEM CHORALE HARMONIZATION’ Kemal Ebcioglu2 Department of Computer Science 226 Bell Hall State University of New York at Buffalo Buffalo, NY 14260 Abstract We have designed an expert system called CHORAL, for harmonizing four-part chorales in the style of J.S....
1986
26
468
Generating Tests by Exploiting Designed Behavior Mark Harper Shirley MIT Artificial Intelligence Laboratory 545 Technology Square Cambrzdge, MA 02139 (mhs@mit-htvax.arpa) Abstract One of the hardest problems in digital circuit design is test pattern generation...
1986
27
469
EVIDENTIAL REASONING Will-l TEMPORAL ASPECTS Dr. Thomas C. Fall Advanced Decision Systems 201 San Antonio Circle, Suite 286 Mountain View, California 94040-l 289 ABSTRACT In the real world, one usually cannot gather enough evidence to completely determine the activity of a system. ...
1986
28
470
A FRAMEWORK FOR EVIDENTIAL-REASONING SYSTEMS* John D. Lowrance Thomas D. Garvey Thomas M. Strat Artificial Intelligence Center SRI Internat ional Menlo Park, California Abstract Evidential reasoning is a body of techniques that supports autom...
1986
29
471
CIS: ,4 MASSIVELY CONCURRENT RULE-BASED SYSTEM Guy E. Blelloch AI Lab, Massachusetts Institute of Technology Rm. 739. 545 Technology Square Cambridge, MA 02139 Net Mail: guyb@mit-ai Abstract Recently researchers have suggested several computational mo...
1986
3
472
PROTEAN: DERIVING PROTEIN STRUCTURE FROM CONSTRAINTS Barbara Hayes-Roth*, Bruce Buchanan*, Olivier Lichtarge+. Mike Hewett*, Russ Altman*, James Brinkley*, Craig Cornelius*, Bruce Duncan*, and Oleg Jardetzky+l KNOWLEDGE SYSTEMS LABORATORY ...
1986
30
473
BACK TO BACKTRACKING: CONTR.OLLING THE ATMS Johan de Kleer Intelligent Systems Laboratory XEROX Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, California 94304 and Brian C. Williams M.I.T. Artificial Intelligence Laboratory 545...
1986
31
474
KNOWLEDGE-BASED VALIDITY MAINTENANCE FOR PRODUCTION SYSTEMS+' Philip R. Schaefer Martin Marietta Denver Aerospace P.O. Box 179, M.S. 0427, Denver, CO 80201 Isil H. Bozma Yale University, New Haven, CT 06520 Randall D. Beer Center for Automation and Intelligent Systems Research Case Western Reser...
1986
32
475
A PARALLEL SELF-MODIFYING DEFAULT REASONING SYSTEM Jack blinker Donald Perlis Krishnan Subramanian Department of Computer Science University of Maryland Institute University of Maryland for Advanced Computer Studies College Park, MD 20742 ABSTRA...
1986
33
476
Towards Explicit Integration of Knowledge in Expert Systems: An Analysis of MYCIN’s Therapy Select&n Algorithm Jack Mostow’ Computer Science Department Rutgers University Hill Center - Busch Campus New Brunswick, New Jersey 08903 Abstract ...
1986
34
477
The Shifting Terminological Space: An Impediment to Evolvability William Swartout Robert Neches USC/Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 Abstract In an expert system, rules or methods interact by creating situations to which other ...
1986
35
478
USING QUALITATIVE REASONING TO UNDERSTAND FINANCIAL ARITHMETIC Chidanand Apt6 and Se June Hong IBM Thomas J. Watson Research Center Yorktown Heights, New York 10598 Abstract This paper describes a general mechanism for the qualitative inter- pretation of simple arithme...
1986
36
479
MOLE: A Knowledge Acquisition Tool That Uses its Head Larry Eshelman and John McDermott Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 Abstract MOLE can help domain experts build a heuristic classification problem-solver by working with them t...
1986
37
480
PROBLEM FEATURES THAT INFLUENCE THE DESIGN OF EXPERT SYSTEMS’ Paul J. Kline and Steven B. Dolins Artificial Intelligence Laboratory Computer Science Center Texas Instruments Incorporated Dallas, TX. 75266 ABSTRACT An analysis was made of a set of design guidelines for ...
1986
38
481
Knowledge Level Engineering: Ontological Analysis James H. Alexander, Michael J. Freiling, Sheryl J. Shulman, Jeffrey L. Staley, Steven Rehfuss and Steven L. Messick Computer Research Laboratory Tektronix Laboratories ABSTRACT Knowledge engineering suffers from a lack of formal tools...
1986
39
482
A Software and Hardware Environment for Developing Al Applications on Parallel Processors R. Bisiani Computer Science Dept. Carnegie Mellon University Pittsburgh, PA 15213 (4121 268-3072 Abstract This paper describes and reports on the use of an environment, called Agora, that supports the...
1986
4
483
FRAMEWORK FOR PROTOTYPING EXPERT SYSTEMS FOR FINANCIAL APPLICATIONS Jacob Y. Friedman and Atul Jain Decision Support Group, Management Consulting Services Coopers & Lybrand, New York, NY 10020 ABSTRACT Analysis of difficulties in trans- ferring expert systems technology into the financial ind...
1986
40
484
A KNOWLEDGE REPRESENTATION TECHNIQUE FOR SYSTEMS DEALING WITH HARDWARE CONFIGURATION* Jeff Pierick ROLM Corporation 4900 Old Ironsides Dr. Santa Clara, CA 95054 Massachusetts Institute of Technology Laboratory for Computer Science 77 Massachusetts Ave. Cambridge, MA 02139 ABSTRACT A ...
1986
41
485
AGNESS: A GENERALIZED NETWORK-BASED EXPERT SYSTEM SHELL* James R. Slagle Michael R. Wick Marius 0. Poliac Computer Science Department 207 Church Street, S.E. 136 Lind Hall University of Minnesota Minneapolis, MN 55455 ABSTRACT AGNESS is an expert system shell developed at...
1986
42
486
SYNTELTM: KNOWLEDGE PROGRARlhlING USING FUNCTIONAL REPRESENTATIONS Rene Reboh and Tore Risch Syntelligence, Inc. 1000 Hamlin Court, PO Box 3620 Sunnyvale, CA 94088 ABSTRACT SYNTELTM is a novel knowledge representation language that provides traditional features of e...
1986
43
487
GBB: A Generic Blackboard Development System Daniel D. Corkill, Kevin Q. Gallagher, and Kelly E. Murray Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 Abstract This paper describes a gener...
1986
44
488
ISCS - A TOOL KIT FOR CONSTRUCTING KNOWLEDGE-BASED SYSTEM CONFIGURATORS Harry Wu, Hon Wai Chun, Alejandro Mimo Honeywell Information Systems 300 Concord Rd., MS895A Billerica, MA 01821. 617-671-3663 I. INTRODUCTION System configuration is the process by which ...
1986
45
489
RECENT DEVELOPMENTS IN NIKL Thomas S. Kaczmarek Raymond Bates Gabriel Robins USC/Information Sciences Institute 4676 Admiralty Way Marina Del Rey, CA 90292 ABSTRACT NIKL (a New Implementation of KL-ONE) is one of the members of the KL-ONE family of knowledge representation lang...
1986
46
490
A HYBRID STRUCTURED OBJECT AND CONSTRAINT REPRESENTATION LANGUAGE* David R. Harris Sanders Associates 95 Canal Street Nashua, New Hampshire 03061 ABSTRACT SOCLE is a hybrid representation system in which cells of constraints are identified with slots of fra...
1986
47
491
A System Which Uses Examples To Learn VLSI Structure Manipulations Richard H. Lathrop* and Robert S. Kirk** * MIT Artificial Intelligence Laboratory, NE43-795 545 Technology Square, Cambridge, MA 02139 ** Gould/AM1 Semiconductors, Inc. 3800 Homestead Road, Santa Clara, CA...
1986
48
492
Refining the Knowledge Base of a Diagnostic Expert System: An Application of Failure-Driven Learning Michael J. Pazzani The Aerospace Corporation P.O.Box 92957 Los Angeles, CA 90009 Abstract This paper discusses an application of failure-driven learning to the construction of the ...
1986
49
493
CONNECTION MACHINE STEREOMATCHING Michael Drumheller Thinking Machines Corporation 245 First Street Cambridge, Massachusetts 02142 Abstract: This paper describes a parallel real-time stereomatching algorithm and its implementation on the Connection MachineTM c...
1986
5
494
LEARNING ARITHMETIC PROBLEM SOLVER Masamichi SHIMURA and Seiichiro SAKURAI Tokyo Institute of Technology Department of Computer Science Ohokayama, Ileguro, Tokyo ABSTRACT In this paper we describe a problem solving system with a learning mechanism (Learning Arithmetic Problem Solver, LAPS), w...
1986
50
495
THE MULTI-PURPOSE INCREMENTAL LEARNING SYSTEM AQ15 AND ITS TESTING APPLICATION TO THREE MEDICAL DOMAINS* Ryszard S. Michalski, Igor Mozetic**, Jiarong Hong***, Nada Lavrac**, Department of Computer Science University of Illinois at Urbana-...
1986
51
496
RESTRICTING LOGIC GRAMMARS EDWARD P. STABLER, JR. Quintus Computer Systems 2345 Yale St., Palo Alto, CA, 94306 stabler@quintus.uucp ABSTRACT A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natura...
1986
52
497
A PARSER FOR PORTABLE NL INTERFACES USING GRAPH-UNIFICATION-BASED GRAMMARS Kent Wittenburg Microelectronics and Computer Technology Corporation Abstract This paper presents the reasoning behind the selection and design of a parser for the Lingo project o...
1986
53
498
A CHINESE NATURAL LANGUAGE PROCESSING SYSTEM BASED UPON THE THEORY OF EMPTY CATEGORIES Long-Ji Lin*, James Huang**, K.J. Chen*** and Lin-Shan Lee* *Dept. of Electrical Engineering, National Taiwan University, Taiwan, R.O.C. **Dept. of Modern ...
1986
54
499
ADAPTING MUMBLE: EXPERIENCE WITH NATURAL LANGUAGE GENERATION Robert Rubinoff Computer and Information Science Department Moore School of Electrical Engineering University of Pennsylvania Philadelphia, PA 19 104 1 Abstract This paper describes the cons...
1986
55