Split (11)

AAAI · 18.8k rows

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
100	THE ROLE OF LOGIC IN KNOWLEDGE REPRESENTATION AND COMMONSENSE REASONING* Robert C. Moore Artificial Intelligence Center SRI International, Menlo Park, California 94025 ARSTRACT This paper examines the role that formal logic ought to play in representing and reasoning with commonsense knowledge. We ...	1982	103
101	Johsn de Kleer and John Scely Wown XEROX PARC Cognitive and Instructional Sciences 3333 Coyote FIill Road Palo Alto. California 94304 lhis paper explores a particular kind of qualitative reasoning, called envisioning, that is capable of producing causal explanations for device behavior. It has b...	1982	104
102	Diagnosis Using Ilierarchical Design Models Michael R. Genesereth Stanford University Stan ford, California 94305 Abstract: This paper presents a new algorithm for the diagnosis of computer hardware faults. The ?l(yorithrn uses a general inference procedure to compute ...	1982	11
103	THE CRITTER SYSTEM: ANALYZING DIGITAL CIRCUITS BY PROPAGATING BEHAVIORS AND SPECIFICATIONS Van E. Kelly Louis I. Steinberg Department of Computer Science Rutgers University New Brunswick, NJ 08903 ABSTRACT CRITTER is a system that reasons about ...	1982	12
104	IDT: AN INTELLIGENT DIAGNOSTIC TOOL Hal Shubin John Wade Ulrich Knowledge Engineering Group Digital Equipment Corporation South Lawrence, MA 01843 ABSTRACT IDT is an intelligent hardware diagnostic tool that has been successfully used to identify faults in PDP 11103 compu...	1982	13
105	REACTOR: AN EXPERT SYSTEM FOR DIAGNOSIS AND TREATMENT OF NUCLEAR REACTOR ACCIDENTS William R. Nelson EG&G Idaho Inc. P.O. Box 1625 Idaho Falls, ID 83415 ABSTRACT REACTOR is an expert system under development at EG&G Idaho, Inc., that will assist operators in the diagnosis...	1982	14
106	A CSA I"lkDEL-BASLD N1;CLkAT; PUWEl\ PLAN? CbNNSLL?,AN'I' W.E. UnderL"ood School of Information aI;d Computer Science Georgia Institute of lechnology Atlanta, GA ABSTRACT ?,n experimental computer-based nuclear pober plant consultant is described. The irlference pro...	1982	15
107	Information Acquisition in Diagnosis Rnmcsh S. Patil, Pctcr Szolovits Massachusetts Institute of ‘I’cchnology and 1 .aboratory for Computer Science 545 Technology Square Cambridge, Massachusetts 02139 William II. Schwartz, M.D., Dept. of Mcdicinc, ‘l’ufts University School of Medicine, and...	1982	16
108	DEEP VERSUS COMPILED KNOWLEDGE APPROACHES TO DIAGNOSTIC PROBLEM-SOLVING B. Chandrasekaran and Sanjay Mittal Dept. of Computer and Information Science The Ohio State University Columbus, Ohio 43210 ABSTRACT In this paper we argue that given a body of ...	1982	17
109	INDUCTION OF CAUSAL RELATIONSHIPS FROM A TIME-ORIENTED CLINICAL DATABASE: AN OVERVIEW OF THE RX PROJECT Robert L. Blum Stanford University Department of Computer Science Margaret Jacks Hall, Stanford, California 94305 ABSTRACT The RX computer program examines a time-ori- ...	1982	18
110	USER PARTICIPATION IN THE KEASONING PROCESSES OF EXPERT SYSTEMS Martha E. Pollack, Julia Hirschberg and Bonnie Webber Department of Computer and Information Science The Moore School University of Pennsylvania, Philadelphia, Pa. 19104 To date, user participation in the reason...	1982	19
111	KNOWLEDGE MANAGEMENT: A PRACTICAL AMALGAM OF KNOWLEDGE AND DATA BASE TECHNOLOGY Charles Kellogg System Development Corporation Santa Monica, California 90406 ABSTRACT This paper describes the central features of a system designed for the management of large amounts of application specific knowledge...	1982	2
112	Toward a Learning of Object Models Using Analogical Objects and Verbal Instruction Norihiro Abe, Fumihide Itoh and Saburo Tsuji Department of Control Engineering Faculty of Engineering Science Osaka University Toyonaka Osaka JAPAN” Abstract In this paper an attempt ...	1982	20
113	AN OVERVIEW OF @NIX David Barstow, Roger Dufley, Stephen Smoliar, Stanley Vestal Schlumberger-Doll Research Old Quarry Road Ridgefield, Connecticut 06877 ABSTRACT @NIX is an automatic programming system being developed for use by petroleum scientists who may not ...	1982	21
114	ARBY: Diagnosis with Shallow Causal Uodels Drew McDermott Yale University Department of Computer Science Ruven Brooks ITT Integrated Systems Center ABSTRACT Arby is a software for writing expert electronic systems system or higher order language systems to do diagnosis ...	1982	22
115	A system is described which produ ces explana- animation sequences for a smal 1 CAD system. ABSTRACT GRAPHICAL ANIMATION FR(M KNOWLEDGE Daniel Neiman Dept. of Electrical Engineering and Computer Science The University of Connecticut Storrs, CT 06268 The- animation i...	1982	23
116	A CORNER FINDING ALGORITHM FOR IMAGE ANALYSIS AND REGISTRATION J.-Q. Fang* and T. S. Huang Coordinated Science Laboratory University of Illinois at Urbana-Champaign 1101 W. Springfield Urbana, Illinois 61801 ABSTRACT In our algorithm the gradient of 8 (the gra- dient direction) in a grey level i...	1982	24
117	THE ROLE OF EXE POSITION INFORMATION IN ALGORITHMS FOR SJXREOSCOPIC MATCHING KFrazdny Laboratory for Artificial Intelligence Research Fairchild Instrument and Camera Corporation 4001 Miranda Avenue, MS 30-886 Palo Alto, California 94304 AE3srR4cr. The viewing system parameters probab...	1982	25
118	REPRESENTING SMOOTH PLANE CURVES FOR RECOGNITION: IMPLICATIONS FOR FIGURE-GROUND REVERSAL* D. D. Hoffman & W. A. Richards Artificial Intclligcncc I .ahorntory and Dcpartmcnt of Psychology Mass&usctts Institute of’I’cchnology Cambridge, Massnchusctts 02139 A rcprcscn...	1982	26
119	WHY PFRSPEC?I!IVE IS DIFFICULT: HCW 'IWO AIXORI'IW'IS FAIL* John R. Kender Computer Science Department Columbia University New York, NY 10027 ABSTRACT Attempting to derive image algorithms solely under orthographic projection is deceptively easy. However, orthographic algorithms o...	1982	27
120	TRACKING KNOWN THREE-DIMENSIONAL OBJECTS* Donald B. Gennery Robotics and Teleoperator Group Jet Propulsion Laboratory Pasadena, California 91109 ABSTRACT A method of visually tracking a known three-dimensional object is described. Predi...	1982	28
121	A MODEL BASED VISION SYSTEM FOR RECOGNITION OF MACHINE PARTS Katsushi Ikeuchi Yoshiaki Shirai Computer Vision Section Electrotechnical Laboratory Umezono-l-l-4, Sakura-mura Niihari-gun, Ibaraki, 305 Japan This paper describes a vision system based on the photometric stereo system and a mod...	1982	29
122	REMOVING RESTRICTIONS IN THE RELATIONAL DATA BASE MODEL: the relational data base model the L2 mad& presented here. AN APPLICATION OF PROBLEM SOLVING TECHNIQUES Laurent Sikl6ssy Dept. of Information Eng. University of Illinois at Chicago Chicago, IL 60680 (USA) ABST...	1982	3
123	LOCAL COMPUTATION OF SHAPE Alex Paul Pentlsnd Artificial Intelligence Center SRI International, 333 Ravenswood Ave, Menlo Park, CA. 94025 ABSTRACT Local, parallel analysis of shading in an image may be used to infer surface shape without o priori knowledge abo...	1982	30
124	EDGE DETECTION IN OPTICAL FLOW FIELDS William B. Thompson Kathleen M. Mutch Valdis Berzins Optical flow is ABSTRACT potentially Computer Science Department 136 Lind Hall University of Minnesota Minneapolis, MN 55455 valuable as a source of spatial information. Cu...	1982	31
125	MODELING AND USING PHYSICAL CONSTRAINTS IN SCENE ANALYSIS* M. A. Fischler, L. Quam 2; T. Barnard, R. C. Bolles&*M. Lowry, , G. Smith, and A. Witkin SRI International, Menlo Park, California 94025 ABSTRACT This paper describes the results obtained in a research program ultimately concerned wit...	1982	32
126	Intensity-Based Edge Classification &drew P. Witkin Fairchild Laboratory for Artificial Intelligence Research Palo Alto, CA 94304 ABSlXACT A new intensity-based approach to the classification of edges was developed and implemented. Using basic continuity and indepen...	1982	33
127	SEGMENTATION OF IMAGES INTO REGIONS USING EDGE INFORMATION* Gerard G. Medioni Intelligent Systems Group University of Southern California Los Angeles, California 90089-0272 ABSTRACT using A method for segmentiw aerial images edge information to create regions of similar or smoothly varying...	1982	34
128	A SYSTEMATIC APPROACH TO CONTINUOUS GRAPH LABELING WITH APPLICATION TO COMPUTER VISION* M. D. Diamond, N. Narasimhamurthi, and S. Ganapathy Department of Electrical and Computer Engineering University of Michigan Ann Arbor, MI 48109 ABSTRACT The discrete and continuous graph labeling problem are...	1982	35
129	DETERMINING SURFACE TYPE FROM SURFACE NORMALS Paul Amaranth William Jaynes Academic Computer Services Intelli.gent Systems Laboratory Oakland University and Department of Computer Science Rochester, MI 48063 ABSTRACT By exploiting the r...	1982	36
130	SPATIALANDTEMPORAL REASONING IN GEOLOGIC MAP INTERPRETATION Reid G. Simmons l’hc Artificial lntclligcncc Laboratory Massachusetts Institute of’I’cchnology Cambridge, MA 02139 A BS’I’RACT 11 MAP IN’l‘l’lil’liE1‘A’I‘ION In this paper. WC dcscribc a way of extending and c...	1982	37
131	PANDORA - A Program for Doing Commonsense Planning m Complex Situations* Joseph Faletti Computer Science Division Department of EECS University of California, Berkeley Berkeley, California 94720 Abstract A planning program named PANDORA (Plan ANalyzer with Dynamic Organiz...	1982	38
132	A FRAMEWORK FOR DISTRIBUTED PROBLEM SOLVING Dave McArthur, Randy Steeb and Stephanie Cammarata The Rand Corporation 1700 Main St. Santa Monica, CA, 90406. ABSTRACT Situations in which several agents must interact to achieve goals present difficulties of coordination and cooperation ...	1982	39
133	RABBIT: An Xntelligent Database Assistant Frederich N. Tou Michael D. Williams Richard Fikes Austin Henderson Thomas Malone Cognitive and Instructional Sciences Group Xerox Palo Alto Research Center Abstract We have designed and implemented an intelligent database assistant to aid the u...	1982	4
134	SCENARIOS AS AN AID TO PLANNING Rajendra S. Wall Edwina L. Rissland Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 ABSTRACT In many complex domains full scale detailed solutions to problems -- plans and ways to implement them -- are not poss...	1982	40
135	ERROR DETECTION AND RECOVERY IN A DYNAMIC PLANNING EZNVIRONMENT In this paper a set of techniques for error detection and recovery is proposed. These techniques augment a plan- Blake Ward and Gordon McCalla Dept. of Computational Science University of Saskatchewan Saskatoon, Sa...	1982	41
136	Experiential Learning in Anafcgical Problem Solving Jaime G. Carbonell Carnegie-Mellon University Pittsburgh, PA 15213 Abstract A computational model of skill acquisition is analyzed based on extensions to an analogical problem solving method and previous Al work on concept acquisiti...	1982	42
137	A PROGRAM THAT LEARNS TO SOLVE RUBIK’S CUBE Richard E. Korf Dcpartmcnt of Computer Science Carncgic-Mellon University Pittsburgh, Pa. 15213 Abstract This paper dcscribcs a program which learns efficient strategies for solving problems such as Rubik’s cube and the eight puzzle. It use...	1982	43
138	1HEURETTCS: ‘Il_iE~RE’T’lCAL AND EXPERPM ENTAL STUDY OF HEURISTIC RULES Douglas B. Lenat Heuristic Programming Project Stan ford University Builders of expert rule-based systems [Barr 811 [Feigenbaum 771 [Hayes-Roth et al. 8’21 attribute the impressive ...	1982	44
139	Job-Shop Scheduling: An Investigation in Constraint-Directed Reasoning Mark S. Fox, Brad Allen, Gary Strohm Intelligent Systems Laboratory The Robotics Institute Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 1. Introduction I___-- -- This paper des...	1982	45
140	KNOWLEDGE INTEGRATION IN TEXT RECOGNITION Sargur N. Srihari and Jonathan J. Hull Department of Computer Science State University of New York at Buffalo Amherst, New York 14226 ABSTRACT The paper describes an algorithm based on AI techniques for recognizing words of printed or hand-written tex...	1982	46
141	A General Paradigm for A.I. Search Procedures* Dana S. Nau, Vipin Kumar, and Laveen Kanal Computer Science Laboratory Department, ABSTRACT This paper summarizes work on a General Branch and Bound formulation which includes previous formulations as special cases and provides a unified ap...	1982	47
142	UNIFYING DATA-DIRECTED AND GOAL-DIRECTED CONTROL: An Example And Experiments Daniel D. Corkill, Victor R. Lesser, and Eva Hudlicka Computer and Information Science Department University of Massachusetts Amherst, Massachusetts, 01003 ABSTRACT Effective control in a multi-level cooperating know...	1982	48
143	DIAGNOSIS BASED ON DESCRIPTION OF STRUCTURE AND FUNCTION Randall Davis, Howard Shrobe, Walter Hamscher* Ksren Wieckert * , Mark Shirley, Steve Polit * * The Artificial Intelligence Laboratory Massachusetts Institute of Technology Abstract While expert systems have traditionally bee...	1982	49
144	EXPERT SYSTEMS A USER'S PERSPECTIVE OF SOME CURRENT TOOLS ABSTRACT Susan P. Ennis Amoco Production Company, Research Center 4502 East 41st Street, P.O. Box 591 Tulsa, OK 74102 This task is a good system: candidate for an expert Mineralogists handle the analysis well, S...	1982	5
145	REVEREND BAYES ON INFERENCE ENGINES: A DISTRIBUTED HIERARCHICAL APPROACH()(*) Judea Pearl Cognitive Systems Laboratory School of Engineering and Applied Science University of California, Los Angeles 90024 ABSTRACT This paper presents generalizations of Bayes likeliho...	1982	50
146	CONSISTENT-LABELING PROBLEMS and their ALGORITHMS Bernard Nude1 Dept. Computer Science, Rutgers University. New Brunswick, New Jersey 08903. ABSTRACT Two new classes of theories have been developed giving the expected complexities of three Consistent- La...	1982	51
147	EVALUATING SEARCH METHODS ANALYTICALLY* Paul W. Purdom, Jr. and Cynthia A. Brown Computer Science Department, Indiana University, Bloomington, Indiana 47405 ABSTRACT A unified approach to analyzing search algorithms is presented. Each algorit...	1982	52
148	Synchronization of Multi-Agent Plans Jeffrey S. Rosenschein Computer Science Department Stanford University Stanford, California 94305 Abstract -_~ Consider an intelligent agent constructing a plan to be executed by several other agents; correct plan execution will often requir...	1982	53
149	A SEARCH PROCEDURE FOR PERFECT INFORMATION GAMES OF CHANCE: ITS FORMULATION AND ANALYSIS Bruce W. Ballard Dept. of Computer Science Duke Universitv Durham, N.C. 27306 ABSTRACT An algorithm i s developed for searching the trees of "perfect information" games ...	1982	54
150	USING TEMPORAL ABSTRACTION TO UNDERSTAND RECURSIVE PROGRAMS INVOLVING SIDE EFFECTS Joachim Laubsch Universitaet Stuttgart Stuttgart W. GERMANY ABSTRACT This paper develops the notion of temporal abstraction, used originally for the automatic understanding of looping constructs, to account for...	1982	55
151	GIST English Generator Bill Swartout USC/information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90291 Abstract This paper describes a prototype English generator which can produce English descriptions of program specifications written in Gist, a program specification...	1982	56
152	ARGUMENT MOLECULES: A FUNCTIONAL REPRESENTATION OF ARGUMENT STRUCTURE Lawrence Birnbaum Yale University Department of Computer Science New Haven, Connecticut Understanding an utterance in an argument crucially requires determining the evidential relation...	1982	57
153	ARGOT: The Rochester Dialogue System James 1:. Allen, Alan M. Frisch, and Diane J. 1 ,&man Computer Science Department The University of Rochester Kochester, NY 14627 Abstract We are engaged in a long-term research project that has the ultimate aim of describing a mechanism that can partak...	1982	58
154	Dividing Up The Question Answering Process* Marc Luti Division of Computer Science Department of EECS University of California, Berkeley Berkeley, Ca. 94720 Abstract This paper describes a question answer- ing program which divides question answer- ing into two separate processes:...	1982	59
155	BUILDING EXPERT SYSTEMS FOR CONTROLLING COMPLEX PROGRAMS Sholom Weiss, Casimir Kulikowski, Chidanand Apt& Michael Uschold Department of Computer Science, Rutgers University Jay Patchett, Robert Brigham, Belynda Spitzer Amoco Production Research Abstra...	1982	6
156	SALIENCE AS A SIMPLIFYING METAPHOR FOR NATURAL LANGUAGE GENERATION David D. McDonald and E. Jeffery Conklin Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01002 USA1 Abstract We have de...	1982	60
157	COKEPTLJAL DEPENDENCY AND MONTAGUE GRAMMAR: A STEP TOWARD CONCILIATICN Mark A. Jones David S. Warren" State University of New York at Stony Brook Long Island, New York 11794 ABSTRACT In attempting to establish a common basis from which the approaches and results can be compared, we have taken a ...	1982	61
158	EVENT SHAPE DIAGRAMS D. L. Waltz Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL ABSTRACT "Event shape diagrams" are proposed as a representation for capturing the nuances of mean- ing of verbs that describe similar events. These diagrams represent timi...	1982	62
159	AN EXPLANATION FOR MINIMAL ATTACHMENT AND RIGHT ASSOCIATION Robert IV. Milne Air Force Institute of Technology AFIT,'ENG Wright-Patterson AFB, OH 45433 ABSTRACT This paper describes the principles of Right- Association and Minimal Attachment and explains how the Sausage Mach...	1982	63
160	A SYNTHETIC APPROACH TO TEMPORAL INFORMATION PROCESSING* Mark D. Grover TRW Defense Systems One Space Park Redondo Beach, Calif. 90278 ABSTRACT A representation and processing scheme for temporal (time-based) information is presented. Previous computer science approaches ...	1982	64
161	Word Sense and Case Slot Disambiguation Abstract The tasks of disambiguating words and determining Graeme Hirst and Eugene Charniak Department of Computer Science Brown University Providence, RI 02912 case are similar and can usefully be combined. We present two cooperating mechanisms t...	1982	65
162	WORD LEARNING WITH HIERARCHY-GUIDED INFERENCE* David M. Keirsey** Department of Information and Computer Science University of California, Irvine Irvine, California ABSTRACT A technique for learning new words is discussed. The technique uses expectations generated by the context and an ISA hiera...	1982	66
163	Taking to UNIX in English: An Overview of UC* Robert W~Lemky Division of Computer Science Department of EECS University of California, Berkeley Berkeley, Ca. 94720 1. Introduction UC (UNIX Consultant) is an intelligent natural language interface that ...	1982	67
164	An Expert System for Interpreting Speech Patterns Renato De Mario, Attilio GiordanaO,Pietro Lafaces, and Lorenza SaittaO 0 Istituto di Scienze dell'Informazione Universita di Torino torso Massimo d'Azeglio 42 10142 -TORINO Italy ABSTRACT Efficient syllabic hypothesi...	1982	68
165	PLANNING NATURAL-LANGUAGEUTTERANCES Douglas E. Appelt SRI International Menlo Park, Calijornia ABSTRACT This paper describes recent research on a natural-lan- guage-generation system that is based on planning. A sys- tem named KAMP is described that is capable ...	1982	69
166	FRAME-BASED COMPUTER NETWORK MONITORING Lawrence A. Stabile Prime Computer, Inc. l 500 Old Connecticut Path Framingham, Massachusetts 01701 Abstract This paper describes an application of FRL to the monitoring of a large computer network. The design utilizes frame models for the network do...	1982	7
167	Competence in Knowledge Representation Ronald J. Brachman Hector J. Levesque Fairchild Laboratory for Artificial Intelligence Research Palo Alt,o, CA 5 1 Introduction The range of domains and tasks for “knowledge- based systems” has been expanding at a furious pa...	1982	70
168	Knowlcdgc Ileprcscntation Languages and Predicate Calculus: I low to I-law Your Clrkc and Kat It Too Charles Kich ‘I’hc hrtifici;d lntclligcrlcc I Amatory RlilSS~ChUSCtlS luslitutc Of ‘I’cchnology .\hstract This paper attempts to rcsolvc some of the controversy bcrwccn advocates of prcdicatc cal...	1982	71
169	AlWRET* A SYSTEM FOR REASONING ABOUT TIME Marc B. Vilain Bolt Beranek and Newman Cambridge MA 02238 A ILGIC CF TIME In this paper we describe the salient features of a new system for reasoning about time. The system represents ...	1982	72
170	CIRCUMSCRIPTIVE IGNORANCE Kurt Konolige Artificial Intelligence Center SRI International ABSTRACT In formal systems that reason about knowledge, inferring that an agent actually does not know a particular fact can be problematic. Collins [l] has shown that ...	1982	73
171	Modeling Motion Hith Qualitative Process Theory Kenneth II. Forbus ‘I’hc Artificial I ntclligcncc I .aboratory Massachusetts Institute of ‘I’cshnology 545 ‘I’cchnology Square Cambridge, Mass. 02139 USA Ahstrilct Rcprcsenting motion is an important part of Naive Physics. Previous qualitative mode...	1982	74
172	GETTING THE ENVISIONMENT RIGHT Benjamin Kuipers Tufts University Medford, Massachusetts 02155. ABSTRACT The central component of commonsense reasoning about causdity is the envisionment: a description of the behavior of a phvsical system that is derived from its structura...	1982	75
173	The QEKG System: Generating Explanations from a Non-Discrete Knowledge Representation1 Hans J. Rcrhcr David H. Ackley Lkparinmt qf Computer Science C’arrqie-Mellon University Pittsburgh. PA 1.5213 Abstract The QI3KG system produces critical analyses of possible mo\ es fiir a...	1982	76
174	PLANT/DS REVISITED : NON-HOMOGENEOUS EVALUATION SCHEMA IN EXPERT SYSTEMS Carl T. Uhrik Department of Computer Science University of Illinois at Urbana-Champaign ABSTRACT This paper describes several deficiencies of PLANT/ds, an expert system for the diagnosis of soybean diseases. This production sy...	1982	77
175	Inheritance of Statistical Properties Neil C. Rowe Department of Computer Science Stanford IJniversity Stanford, CA 94305 Abstract Statistical aggregate properties (e.g. mean, maximum, mode) have not previously been thought to “inherit” between sets. ...	1982	78
176	A NONCLAUSAL CONNECTION-GRAPH RESOLUTION THEOREM-PROVING PROGRAM Mark E. Stickel Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT A new theorem-proving program, combining the use of non- clausal resolution and connection gr...	1982	79
177	Plan Recognition Strategies in Student Modeling: Prediction and Description Bob London and William J. Clancey Heuristic Programming hoject. Computer Science Department Stanfkd University, Stmford CA 94305 Abstract This paper describes the student modeler of the GUlDON2 tutor, which unde...	1982	8
178	PROOF METHODS IN AN AGENDA-BASED, NATURAL-DEDUCTION THEOREM PROVER Mabry Tyson Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT This note describes several methods of finding proofs used in APRVR, an agenda-based, natural-d...	1982	80
179	Multiple Inheritance in Smalltalk- Alan H. Borning Computer Science Department, FR-35 University of Washington Seattle, WA 98195 Daniel H. H. lngalls Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304 Abstract Smalltalk classes may be arranged in hierarchies...	1982	81
180	GLISP: A High-Level Language for A.I. Programming Gordon S. Novak Jr. Heuristic Programming Project Computer Scicncc Department Stanford University ABSTRACT GLISP is a high-level LISP-based language which is compiled into LISP using a knowledge base of object descriptions. l.isp objects...	1982	82
181	DADO: ATREE-STRUCXUREDMACRINE ARCRITECTURE FoRERODUcTIONSYSTEMS* Salvatore J. Stolfo and David Elliot Shaw Coltiia University ABs!rRAcT DAD3 is a parallel tree-structured machine designed to provide highly significant performance improvements in the execution of large Production systems. T...	1982	83
182	Toward Connectionist Parsing Steven Small, Gary Cottrell, and I,okendra Shastri Department of Computer Science The University of Rochester Rochester, New York- 14627 Abstract The parsing of natural language is the product of dense interactions among various comprehension processes. We beli...	1982	84
183	Why Do Children Misunderstand Reversible Passives? The CHILD Program Learns to Understand Passive Sentences Mallory Selfridge Dept. of EE and CS University of Connecticut Storrs, Ct. 06268 ABSTRACT As children learn language they initially misunderstand reversible passive sentences as if they...	1982	85
184	LEARNING BY Cl-KINKING SUMMARY OF A TASK AND A MODEL Paul S. Rosenbloom and Allen Newell Department of Computer Science Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 Abstract‘ The power law of practice states that performance on a task improves as a p...	1982	86
185	Route Finding in Street Maps by Computers and People R. J. Elliott M. E. Lesk Bell Laboratories Murray Hill, New Jersey 07974 Abstract We wrote a computer program which gives driving directions in northern New Jersey. Its data base combines a street map and a tele- phone book, ...	1982	87
186	PLAN UNDERSTANDING, NARRATIVE COMPREHENSION, AND STORY SCHEMAS" William F. Brewer Department of Psychology University of Illinois 603 East Daniel Street Champaign, IL 61820 ABSTRACT This paper proposes that a comprehensive theo- ry of stories must include components ...	1982	88
187	AFFECT PROCl&SING FOR NARRATIVES ’ Michael G. Dyer Computer Science Department Yale University New Haven, CT 06520 ABSTRACT This paper presents a theory of AFFECT processing in the context of BORIS [Dyer, 19821 [Dyer, 1981a], a computer ...	1982	89
188	AN EXPERT SYSTEM THAT VOLUNTEERS ADVICE Jeff Shrager Carnegie-Mellon University Department of Psychology Tim Finin University of Pennsylvania Department of Computer Science I. Motivation and Svstem Overview This paper describes the design and expert system that provide...	1982	9
189	On Being Contradictory Margot Flowers Yale University Department of Computer Science PO Box 2158 (YS) New Haven, CT 06520 Abstract This paper discusses recognizing and producing contradic- tions. After illustrating the phenomena of contradiction, the ...	1982	90
190	THE ROLE OF EXPERIENCE IN DEVELOPNENT OF EXPERTISE Janet L. Kolodner School of Information and Computer Science Georgia Institute of Technology Atlanta, GA 30332 INTRODUCTION Perhaps the most distinguishing feature of an expert is that when given a novel problem to solve in his or her domain of ...	1982	91
191	THE CMU ROVER Hans P. Moravec Robotics Institute Carnegie- Mellon University Pittsburgh, PA 15213 Abstract An advanced camera-equipped mobile robot is being built at the ChlU Robotics Institute to support research in control. perception, planning and related issues. It will bc used initially to ...	1982	92
192	SOLVING TIIE FIND-PATI I I’ROBLEIM BY GOOD REI’RESENThTION OF FREE SPACE Rodney A. Rrooks Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, Ma. 02139 ABSTRACT Free space is rcprcscnted as a union of (possibly overlapping) generalized ...	1982	93
193	FINAL POSITION CONTROL IN PLANAR I IORIZONTAL ARM RlOVEhIENTS Jonathan Delatizky Artificial intelligence Laboratory Massachusetts Institute of Technology, Cambridge, MA 02139 ABSTRACT Simplified control strategies based on the concept of “Final Position Con...	1982	94
194	DEVELOPMENT OF AN OVERALL DIRECTION-OF-ACTION SENSOR FOR ROBOTS Tokuji Okada Electrotechnical Laboratory l-l-4, Umezono, Sakura-mura, Niihari-gun, Ibaraki, 305 Japan ABSTRACT Development of an optical sensor for measuring overall direction-of-action is treated...	1982	95
195	AN EFFICIENT COLLISION WARNING ALGORITHM FOR ROBOT ARMS E. Gordon Powell Naval Surface Weapons Center White Oak, Silver Spring, Maryland 20910 ABSTRACT A hashing technique is used as an arm collision warning algorithm for two armed robots which can be expected to be a factor 103 more efficient i...	1982	96
196	STABILITY OF AUTOMATIC GUIDANCE FOR A MOBILE ROBOT L. Y. Shih Division of Electrical Engineering, National Research Council, Ottawa, Canada ABSTRACT A control law for the automatic guidance is proposed in this paper as if each obstacle exerts upon the mobile robot a repulsion, which varies inver...	1982	97
197	Automatic Schema Acquisition in a Natural Language Environment Gerald DeJong Coordinated Science Laboratory University of Illinois Urbana, IL 61820 ABSTRACT This paper outlines an approach to schema acquisition. The approach, called ~ schema acauisition is applicable in problems solv- i...	1982	98
198	ACQUISITION OF APPROPRIATE BIAS FOR INDUCTIVE CONCEPT LEARNING * Paul E. Utgoff Tom M. Mitchell Department of Computer Science Rutgers University New Brunswick, New Jersey 08903 Abstract Current approaches to inductive concept learning suffer from a fundamenta...	1982	99
199	A COMPARATIVE STUDY OF COi>JTROL STRATEGIES FOR EXPERT SYSTEMS: AGE IMPLEMENTATION OF THREE VARIATIONS OF PUFF Nelleke Aiello Heuristic Programming Project Department of Computer Science Stanford University Stanford, California 94305 Abstract This paper presents the results of compar...	1983	1

Subsets and Splits

SQL Console for Seed42Lab/AI-paper-crawl

Finds papers discussing interpretability and explainability in machine learning from after 2010, offering insight into emerging areas of research focus.

Interpretability Papers Since 2011

Reveals papers from the AAAI dataset after 2010 that discuss interpretability or explainability, highlighting key research in these areas.

SQL Console for Seed42Lab/AI-paper-crawl

Searches for papers related to interpretability and explainability in NIPS proceedings after 2010, providing a filtered dataset for further analysis of research trends.

AI Papers on Interpretability

Finds papers discussing interpretability or explainability published after 2010, providing insight into recent trends in research focus.

ICML Papers on Interpretability

Retrieves papers from the ICML dataset after 2010 that mention interpretability or explainability, offering insights into trends in model transparency research.

ICLR Papers on Interpretability

Retrieves papers from the ICLR dataset that discuss interpretability or explainability, focusing on those published after 2010, providing insights into evolving research trends in these areas.

ICCV Papers on Interpretability

Finds papers from the ICCV dataset published after 2010 that discuss interpretability or explainability, providing insight into trends in research focus.

EMNLP Papers on Interpretability

Retrieves papers related to interpretability and explainability published after 2010, providing a focused look at research trends in these areas.

ECCV Papers on Interpretability

The query retrieves papers from the ECCV dataset related to interpretability and explainability published after 2010, providing insights into recent trends in these research areas.

CVPR Papers on Interpretability

Retrieves papers from the CVPR dataset published after 2010 that mention 'interpretability' or 'explainability', providing insights into the focus on these topics over time.

AI Papers on Interpretability

Retrieves papers from the ACL dataset that discuss interpretability or explainability, providing insights into research focus in these areas.