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
0	QUESTION ORDERING IN MIXED INITIATIVE PROGRAM SPECIFICATION DIALOGUE Louis Steinberg Department of Computer Science Rutgers University New Brunswick, N. J. 08903 ABSTRACT It would be nice if a computer system could accept a program specification in the form of a mixed initiative dialogue. One ca...	1980	1
1	AUTOMATIC GENERATION OF SEMANTIC ATTACHMENTS IN FOL Luigia Aiello Computer Science Department Stanford University Stanford, California 94305 ABSTRACT Semantic attachment is provided by FOL as a means for associating model values (i.e. LISP code) to symbols of a firs...	1980	10
2	ABSTRACT HCPRVR: AN INTERPRETER FOR LOGIC PROGRAMS Daniel Chester Department of Computer Sciences University of Texas at Austin An overview of a logic program interpreter written in Lisp is presented. The interpreter is a Horn clause-based theorem prover augmented by L...	1980	11
3	FIRST EXPERIMENTS WITH RUE AUTOMATED DEDUCTION Vincent J. Digricoli The Courant Institute and Hofstra University 251 Mercer Street, New York, N.Y. 10012 ABSTRACT RUE resolution represents a reformulation of binary resolution so that the basic rules of inference (RUE and NRF) incorporate the axioms ...	1980	12
4	WHAT’S WRONG WITH NON-MONOTONIC LOGIC? David J . Israel Bolt Beranek and Newman Inc. 50 Moulton St. Cambridge, Mass. 02238 ABSTRACT In this paper ’ I ask, and attempt to answer, the following question : What’s Wrong with Non-Monotonic Logic? ...	1980	13
5	PATHOLOGY ON GAME TREES: A SUMMARY OF RESULTS* Dana S. Nau Department of Computer Science University of Maryland College Park, MD 20742 ABSTRACT Game trees are widely used as models of various decision-making situations. Empirical results with game-playing ...	1980	14
6	ISEOC9PFREE S. W. Ng and Adrian Walker Work performed at Rutgers University* ABSTRACT If a system uses assertions of the general form x causes y , (e.g. MYCIN rules) then loop situations in which X, causes X2, X2 causes X3, . . . . , X, causes X,, ...	1980	15
7	Applying General Induction Methods to the Card Game Eleusis Thomas G. Dietterich Department of Computer Science Stanford University Stanford, CA 94305 Abstract Research was undertaken with the goal of applying general universally-applicable induction methods to complex real-...	1980	16
8	MODELLING STUDENT ACQUISITION OF PROBLEM-SOLVING SKILLS Robert Smith Department of Computer Science Rutgers University New Brunswick, N. J. 08903 ABSTRACT This paper describes the design of a system that simulates a human student learning to prove tneorems in logic by interacting with a curricul...	1980	17
9	A Computer Model of Child Language Learning Mallory Selfridge Yale University Abstract A computer program modelling a child between the ages of 1 and 2 years is described. This program is based on observations of the knowledge this child had at age 1, the comprehension...	1980	18
10	APPROACHES TO KNOWLEDGE ACQUISITION: THE INSTRUCTABLE PROQUCTION SYSTEM PROJECT Michael D. Rychener Carnegie-Mellon University Department of Computer Science Schenley Park Pittsburgh, PA 15213 Abstract Progress in building systems that acquire knowledge from a va...	1980	19
11	SOME ALGORITHM DESIGN METHODS Steve Tappel Systems Control, Inc., 1801 Page Mill Road Palo Alto, California 94304 and Computer Science Department, Stanford University Abstract Algorithm design may be defined as the task of finding an efficient data and control structure that implements ...	1980	2
12	USING A MATCHER TO MAKE AN EXPERT CONSULTATION SYSTEM BEHAVE INTELLIGENTLY* Rene' Reboh Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT This paper describes how even a simple matcher, if it can detect simple relation...	1980	20
13	AN APPROACH TO ACQUIRING AND APPLYING KNOWLEDGE Norman Haas and Gary G. Hendrix SRI International 333 Ravenswood Avenue Menlo Park, California 94025 ABSTRACT The problem addressed in this paper is how to enable a computer system to acquire facts about new domains from tutors who are experts in t...	1980	21
14	SELF-CORRECTING GENERALIZATION Stephell B. Wilitehill Deyartment of Irlformation and Computer Science University of California at Irvine Irvine, Ca 92717 ABSTRACT A system is described which creates and generalizes rules from examples. The system can recove...	1980	22
15	intelligent Retrieval Planning Jonathan J. King Computer Science Department Stanford University A. introduction artificial intelligent retrieval planning is the application of intelligence techniques to the task of efficient retrieval of information from very large databases. ...	1980	23
16	A THEORY OF METRIC SPATIAL INFERENCE Drew McDermott Yale University Department of Computer Science New Haven, Connecticut ABSTRACT* Efficient and robust spatial reasoning requires that the properties of real space be taken seriously. One approach to doing this is to assimilate ...	1980	24
17	DESIGN SKETCH FOR A MILLION-ELEMENT NETL MACHINE Scott E. Fahlman Carnegie-Mellon University Department of Computer Science Pittsburgh, Pennsylvania 152 13 Abstract This paper describes (very briefly) a parallel hardware implementation for NETL-type semanti...	1980	25
18	PERCEPTUAL REASONING IN A HOSTILE ENVIRONMENT Thomas D. Garvey and Martin A. Fischler Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT The thesis of this paper is that perception requires reasoning mechanisms beyond those typically employed in deductive systems. We ...	1980	26
19	OVERVIEW OF AN EXAMPLE GENERATION SYSTE?l Edwina L. Rissland Elliot M. Soloway Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 ABSTRACT This paper addresses the process of generating examples which meet specified criteria: we call this activity CON...	1980	27
20	STRUCTURE COMPARISON AND SEMANTIC INTERPRETATION OF DIFFERENCES* Wellington Yu Chiu USC Information Sciences Institute 4676 Admiralty Way Marina de1 Roy, California 90291 ABSTRACT Frequently situations are encountered where the ability to differentiate between objects ...	1980	28
21	Performing Inferences over Recursive Data Bases Shamim A. Naqvi and Lawrence J. Henschen Dept. of Electrical Engineering and Computer Science Northwestern University Evanston, Illinois 60201 Abstract The research reported in this paper presents a solution to an open problem which arises in sy...	1980	29
22	Automatic Goal-Directed Progrem ‘bvnsformetion Stephen Fickas USC/Information Sciences Institute* Marina del Rey, CA 90291 1. INTRODUCTION This paper focuses on a major problem faced by the user of a semi-automatic, transformation-based program-developme...	1980	3
23	PIAGET AND ARTIFICIAL INTELLIGENCE Jarrett K. Rosenberg Department of Psychology University of California, Bcrkelcy 94720 ASSTRACT Piaget’s Genetic Epistemology and Artl$cial Intelligence can be of great use to each other, since the strengths of each approach complement the weaknesses of t...	1980	30
24	RI: an Expert in the Computer Systems Domain’ John McDermott Department of Computer Science Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 INTRODUCTION. Rl* is a rule-based system that has much in common with other domain-specific systems that have been developed over the ...	1980	31
25	RULE-BASED MODELS OF LEGAL EXPERTISE D. A. Waterman and Mark Peterson The Rand Corporation 1700 Main Street Santa Monica, California ABSTRACT This paper describes a rule-based legal de- cisonmaking system (LDS) that embodies the skills and knowledge of an expert in produc...	1980	32
26	EXPLOITING A DOMAIN MODEL IN AN EXPERT SPECTRAL ANALYSIS PROGRAM David R. Barstow Schlumberger-Doll Research, Ridgefield, Connecticut 06877 ABSTRACT Gamma ray activation spectra are used by nuclear physicists to identify the elemental composition of unknown subst...	1980	33
27	Project EPISTLE: A system for the Automatic Analysis of Business Correspondence Lance A. Miller IBM Thomas J. Watson Research Center Yorktown Heights, New York 1 0598 ABSTRACT: The developing system described here is plan- ned to provide the business execut...	1980	34
28	A KNOWLEDGE BASED DESIGN SYSTEM FOR DIGITAL ELECTRONICS* Milton R. Grinberg Department of Computer Science University of Maryland College Park, Maryland 20742 1. Overview and Goals of the SADD System v----p the goal of a human ex e;ia;; such as "build a digits P display interface into a Th...	1980	35
29	THEORY DIRECTED READING DIAGNOSIS RESEARCH USING COMPUTER SIMULATION Christian C. Wagner John F. Vinsonhaler The Institute for Research on Teaching Michigan State University East Lansing, Michigan 48823 Abstract A five year project studying the diagnosis and remediation of children with reading ...	1980	36
30	A WORD-FINDING ALGORITHM WITH A DYNAMIC LEXICAL- SEMANTIC MEMORY FOR PATIENTS WITH ANOMIA USING A SPEECH PROSTHESIS Kenneth Mark Colby, Daniel Christinaz, Santiago Graham, Roger C. Parkison The Neuropsychiatric Institute/UCLA 760 Westwood Plaza Los Angeles, California 90024 ABSTRACT Wor...	1980	37
31	TROUBLE-SHOOTING BY PLAUSIBLE INFERENCE * Leonard Friedman Jet Propulsion Laboratory, California Institute of Technology Pasadena, CA 91103 ABSTRACT The PI system has been implemented with the ability to reason in both directions. This is combined with ...	1980	38
32	AN APPLICATION OF THE PROSPECTOR SYSTEM TO DOE’S NATIONAL URANIUM RESOURCE EVALUATION* John Gaschnig Artificial Intelligence Center SRI International Menlo Park, CA 94025 Abstract A practical criterion for the success of a know...	1980	39
33	INCREMENTAL, INFORMAL PROGRAM ACQUISITION’ Brian P. McCune Advanced Information & Decision Systems 201 San Antonio Circle, Suite 286 Mountain View, California 94040 AbJrract. Program acquisition is the transformation of a program specification into an executable, but not necessarily efficient...	1980	4
34	SOME REQUIREMENTS FOR A COMPUTER-BASED LEGAL CONSULTANT L. Thorne McCarty Faculty of Law, SUNY at Buffalo Laboratory for Computer Science Research, Rutgers Although the literature on computer-based consultation systems has often suggested the po...	1980	40
35	A FRAME-BASEDPRODUCTION SYSTEM ARCHITECTURE David E. Smith and Jan E. Clayton Heuristic Programming Project* Department of Computer Science Stanford University ABSTRACT We propose a flexible frame-structured representation and agenda-based control mechanism for the construction...	1980	41
36	ABSTRACT Knowledge Embedding in the Description System Omega Carl Mewitt, 6iuseppe Attardi, and Maria Simi M.I.T. 545 Technology Square Cambridge, Mass 02139 Omega is a description system for knowledge embedding which combines mechanisms of the predicate calculus, ...	1980	42
37	A Representation Language Language Russell Greiner and Douglas B. Lenat Computer Science Deptartment Stanford University ABSTRACT The field of AI is strewn with knowledge representation languages. The language designer typically has one particular application domain in mind: as subsequent ...	1980	43
38	SPATIAL AND QUALITATIVE ASPECTS OF REASONING ABOUT MOTION Kenneth D. Forbus MIT Artificial Intclligcncc Laboratory 545 Technology Square Cambridge, Mass. 02139 ABSTRACT Reasoning about motion is an important part of common sense knowledge. The spatial and qualitative aspects of reasoning about m...	1980	44
39	COMPUTER INTERPRETATION OF HUMAN STICK FIGURES Martin Herman Department of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 ABSTRACT A computer program which generates context-sensitive descriptions of human stick figures is described. Three...	1980	45
40	RESEARCH ON EXPERT PROBLEM SOLVING IN PHYSICS Gordon S. Novak Jr. and Agustin A. Araya Computer Science Department University of Texas at Austin Austin, Texas 78712 ABSTRACT Physics problems cannot in general be solved by methods of deductive search in which the laws of physics are s...	1980	46
41	KNOWLEDGE-BASED SIMULATION Philip Klahr and William S. Faught The Rand Corporation Santa Monica, California 90406 ABSTRACT Knowledge engineering has been successfully applied in many domains to create knowledge-based "expert" systems. We have applied this technology to ...	1980	47
42	I NTERACTI VE FRAME I NSTANTIATION Carl Engelman Ethan A. Scar1 Charles H. Berg* ABSTRACT This paper discusses the requirements that interactive frame instantiation imposes on constraint Verification. The representations and algorithms of an implemented software solution ...	1980	48
43	DESCRIPTIONS FOR A PROGRAMMING ENVIRONMENT Ira P. Goldstein and Daniel G. Bobrow Xerox Palo Alto Research Center Palo Alto, California 94304, U.S.A Abstract PIE is an experimental personal information environment implemented in Smalltalk that uses a ...	1980	49
44	A BASIS FOR A THEORY OF PROGRAM SYNTHESIS’ P.A.Subrahmanyam USC/Information Sciences Institute and Cepartment of Computer Science University of Utah, Salt Lake City, Utah 84112 1. Introduction and Summary In order to obtain a quantum jump in the quality and reliability...	1980	5
45	ABSTRACT Rule-Based Inference In Large Knowledge Bases * William Mark USC/Information Sciences Institute Having galned some experience with knowledge-based systems (e.g., [a), [9], [ 1 l]), our aspirations are growing. Future systems (for VLSI design, office automat...	1980	50
46	N PROCESS FOR EVALUATING TREE-CONSISTENCY John L. Goodson Departments of Psychology and Computer Science Rutgers University, New Brunswick, N.J. 08903 ABSTRACT General knowledge about conceptual classes represented in a concept hierarchy can provide a basis for various types of inferences about an ...	1980	51
47	Reasoning About Change in Knowledgeable Office Systems Gerald R. Barber Room 800b Massachusem Ittslitute of Techtlologv 54.5 Techttologv Square Cambridge, Mass. 02139 (617) 253-5857 ABSTRACT Managing of and reasoning about dynamic processes is a central ...	1980	52
48	On Supporting the Use of Procedures in Office Work Richard E. Fikes and D. Austin Henderson, Jr. Systems Sciences Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, California 94302 Abstract In this paper, we discuss the utility of AI techniques in the construction of...	1980	53
49	Metaphors and Models Michael R. Gcnesereih Computer Science Department Stanford University Stanford, California 94305 1. Introduction Much of one’s knowledge of a task domain is in the form of simple facts and procedures. While these facts and procedures may vary from dom...	1980	54
50	EVERYTHING YOU ALWAYS WANTED TO KNOW ABOUT AUTHORITY STRUCTURES BUT WERE UNABLE TO REPRESENT James R. Meehan uept. of Information and Computer Science university of California lrvine CA 92717 If we're ever to get programs to reason intelligently about activities that ...	1980	55
51	REAL TIME CAUSAL MONITORS FOR COMPLEX PHYSICAL SITES* Chuck Rieger and Craig Stanfill Department of Computer Science University of Maryland College Park, MD 20742 ABSTRACT Some general and specific ideas are advanced. about the design and implementation of cau;llmn;ltorlng s P ...	1980	56
52	GENERATING RELEKWC FXPLANATICNS: NATURAL LANGUAGERESPCNSES 'I0QJESTIONSAl3OUl?DATAHASE STRUCIWB* Kathleen R. McKeown Department of Ccmputer and Information Science The Moore School University of Pennsylvania Philadelphia, Pa. 19104 ABSTRACTT The research described here is ai...	1980	57
53	THE SEMANTIC INTERPRETATION OF NOMINAL COMPOUNDS * Timothy Wilking Finin Coordinated Science Laboratory University of Illinois Urbana IL 61801 ABSTRACT This paper briefly introduces an approach to the problem of building semantic interpretations of nominal ComDounds, i.e. sequences of two ...	1980	58
54	TOWARDS AN AI MODEL OF ARGUMENTATIGA. Lawrence Birnbaum, Margot Flowers, and Rod McGuire Yale University Department of Computer Science New Haven, Connecticut Abstract This paper describes a process model of human argumentation, and provides examples of its operation as impl...	1980	59
55	A PROGRAM MODEL AND KNOWLEDGE BASE FOR COMPUTER AIDED PROGRAM SYNTHESIS' Richard J. Wood Department of Computer Science University of Maryland College Park, Maryland 20742 1 Utroductaon Program synthesis is a complex task comprising many interacting subactivities and requiring access to a var...	1980	6
56	Knowledge Representation for Syntactic/Semantic Processing Robert J. Bobrow Bolt Beranek and Newman Inc. 50 Moulton St. Cambridge, Mass. 02238 Bonnie L. Webber Department of Computer Science The Moore School of Elelectrical Engineering D2 University of Pennsylvania Philad...	1980	60
57	LANGUAGE AND MEMORY: GENERALIZATION AS A PART OF UNDERSTANDING Michael Lebowitz Department of Computer Science Yale University, P.O. Box 2158 New Haven, Connecticut 06520 ABSTRACT process. Here I will present the program's ability to remember Integrated Partial events and make generalizations...	1980	61
58	FAILURES IN NATURAL LANGUACE SYSTEIG : APPLICATIONS ?o DATA BASE WERY SYSTEMS Eric Mays Department of Canputer and Information Science University of Pennsylvania Philadelphia, PA 19104 ABSTRACT A significant class of failures in interactions with data base query systems a...	1980	62
59	WHEN EXPECTATION FAILS: -- Towards a self-correcting inference system Richard H. Granger, Jr. Artificial Intelligence Project Department of Information and Computer Science University of California Irvine, California 92717 ABSTRACT Contextual understanding depends on a ...	1980	63
60	ORGANIZING MEMORY AND KEEPING IT ORGANIZED Janet L. Kolodner Dept. of Computer Science Yale University, P. 0. BOX 2158 New Haven, CT 06520 ABSTRACT Maintaining good memory organization is important in large memory systems. This paper presents a scheme for automatically reorganizing ...	1980	64
61	Meta-planning Robert Wilensky Computer Science Division De artment of EECS University o F California, Berkeley Berkeley, California 94720 1.0 INTRODUCTION This paper is concerned with the problems of planning related and understanding. because These problems are natural unde...	1980	65
62	NARRATIVE TEXT SUMMARIZATION Wendy Lehnert Yale University Department of Computer Science New Haven, Connecticut ABSTRACT In order to summarize a story it is necessary to access a high level analysis that highlights the story's central concepts. A technique of memory representation based on a...	1980	66
63	HEARSAY-III: A Domain-Independent Framework for Ex Robert Balzer Lee Ermzrn Philip London Chuck Williams USC/Information Sciences Institute* Marina del Rey, CA 90291 Abstract Hearsay-Ill is a conceptually simple extenslon of the basic ideas in the Hearsay-II speech-und...	1980	67
64	QUANTIFYING AND SIMULATING THE BEHAVIOR OF KNOWLEDGE-BASED INTERPRETATION SYSTEMS* V.R. Lesser, S. Reed and J. Pavlin Computer and Information Science Department University of Massachusetts Amherst, Mass. 01003 ABSTRACT The beginnings of a methodology ...	1980	68
65	Representation of Task-Specific Knowledge in a Gracefully Interacting User Interface Eugene Ball and Phil Hayes Computer Science Department, Carnegie-Mellon University Pittsburgh, PA 15213, USA Abstract Command interfaces to current interactive systems often appear inf...	1980	69
66	AN EFFICIENT RELEVANCE CRITERION FOR MECHANICAL THEOREM PROVING* David A. Plaisted Department of Computer Science University of Illinois Urbana, Illinois 61801 ABSTRACT To solve problems in the presence of large knowledge bases, it is important to be able to de- cide which knowledge ...	1980	7
67	This paper presents the results of research done on the representation of control knowledge in rule-based expert systems.’ It discusses the problems of representing co&o1 knowledge implicitly in object-level inference rules and presents specific examples from a MYCIN-like co...	1980	70
68	DELTA-MIN: A Search-Control Method for Information-Gathering Problems Jaime G. Carbonell Computer Science Department Carnegie-Mellon University Abstract The A-MIN method consists of a best-first backtracking algorithm applicable to a large class of information-gathering prob...	1980	71
69	ON WAITING Arthur M. Farley Dept. of Computer and Information Science University of Oregon Eugene, Oregon ABSTRACT Waiting is the activity of maintaining selected aspects of a current situation over some period of time in order that certain goal-related actions can be performed ...	1980	72
70	DOU&S E. &pelt Slar@rd University, Stanford, California SRI International, Menlo Park, California ABSTRACT This paper reports recent results of research on planning systems that have the ability to deal with multiple agents and to reason about their knowledge ...	1980	73
71	Making Judgments Hans J. Berliner Computer Science Department Carnegie-Mellon University Pittsburgh, Pa. 15213 Abstract Reasoning-based problem solving deals with discrete entities and manipulates these to derive new entities or produce branching behavior in order to discover a solution. T...	1980	74
72	ABSTRACT MULTIPLE-AGENT PLANNING SYSTEMS Kurt Konolige Nils J. Nilsson SRI International, Menlo Park, California We analyze problems confronted by computer agents that synthesize plans that take into account (and employ) the plans of other, similar, cooperative agents. From the po...	1980	75
73	SCOUT: A SIMPLE GAME-SEARCHING ALGORITHM WITH PROVEN OPTIMAL PROPERTIES Judea Pearl Cognitive Systems Laboratory School of Engineering and Applied Science University of California Los Angeles, California 90024 ABSTRACT This paper describes a new algorithm for searching games which...	1980	76
74	Problem Solving in Frame-Structured Systems Using Interactive Dialog Harry C. Reinstein IBM Palo Alto Scientific Center 1530 Page Mill Road Palo Alto, Ca. 94304 ABSTRACT This paper provides an overview of the process by which problem solving in a particular frame-like knowledge-ba...	1980	77
75	REPRESENTING KNOWLEDGE IN AN INTERACTIVE PLANNER Ann E. Robinson and David E. Wilkins Artificial Intelligence Center SRI International Menlo Park, California 94025 ABSTRACT This note discusses the representation for actions and plans being developed as part of...	1980	78
76	INFEHENCEWITHRECURSIVERULES Stuart C. Shapiro and Donald P. McKay Department of Computar Science State University of New York at Buffalo Amherst, New York 14226 ABSTRACT Recursive rules, such as "Your parents' ances- tors are your ancestors", although very useful for theorem proving,...	1980	79
77	ON PF0VING LAWS OF TBE ALGEBRA OF FP-SYSTE2% INEDINB~LCF Jacek Leszczykcwski Polish Acadeq of Sciences Institute of Computer Science P.O.BOX 22, 00-901 Warszawa PKiN, PQLMD I INTFODUCX'ION J.Backus, in CACM 21/8, defined a class of ap- plicative prograrrunin g systems called FP /functio...	1980	8
78	Mapping Image Properties into Shape Constraints: Skewed Symmetry, Affine-Transformable Patterns, and the Shape-from-Texture Paradigm John R. Kender and Takeo Kanade Computer Science Department Carnegie-Mellon University Pittsburgh, Pa. 15213 1. Introduction ...	1980	80
79	WHAT SHOULD BE COMPUTED IN LOW LEVEL VISION SYSTEMS William B. Thompson Albert Yonas University of Minnesota Minneapolis, Minnesota 55455 ABSTRACT Recently, there has been a trend towards developing low level vision models based on an analysis of the ...	1980	81
80	INTERPRETING LINE DRAWINGS AS THREE-DIMENSIONAL SURFACES Harry G. Barrow and Jay M. Tenenbaum Artificiai Inteiiigence Center SRI Internationai, Menio Park, CA 94025 ABSTRACT We propose a computationai modei for interpreting iine drawings as three-dimensionai surfaces, based on constraints on iocai ...	1980	82
81	SHAPE ENCODING AND SUBJECTIVE CONTOURS’ Mike Brady, W. E. L. Grimson Artificial Intelligence Laboratory, MIT. and D. J. Langridge Division of Computing Research, CSIRO, Canberra, ACT, Australia. 1. Int reduction Ullman [15] has investigated the shape of subjective contours (see for example...	1980	83
82	A STATISTICAL TECHNIQUE FOR RECOVERING SURFACE ORIENTATION FROM TEXTURE IN NATURAL IMAGERY Andrew P. Witkin Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT A statistical method is reported for inferring the shape and orientation of irregula...	1980	84
83	INFORMATION NEEDED TO LABEL A SCENE Eugene C. Freuder Dept. of Mathematics and Computer Science University of New Hampshire Durham, NH 03824 ABSTRACT I analyze the information content of scene labels and provide a measure for the complexity of line drawings. The Huffman-Clow...	1980	85
84	INTERPRETIVE VISION AND RESTRICTION GRAPHS Rodney A. Brooks and Thomas 0. Binford Artificial Intelligence Laboratory, Computer Science Department Stanford University, Stanford, California 94305 ABSTRACT We describe an approach to image interpretation which uses a dynamically determined ...	1980	86
85	Sticks, Plates, and Blobs: A Three-Dimensional Object Representation for Scene Analysis Linda G. Shapiro John D. Moriarty Prasanna G. Mulgaonkar Robert M. Haralick Virginia Polytechnic Institute and State University Department of Computer Science ABSTRACT In this paper , we des...	1980	87
86	CONSTRAINT-BASED INFERENCE FROM IMAGE MOTION Daryl T. Lawton Computer and Information Science Department University of Massachusetts Amherst, Massachusetts 01003 ABSTRACT We deal with the inference of environmental information (position and velocity) from a sequence of images formed dur...	1980	88
87	STATIC ANALYSIS OF MOVING JOINTED OBJECTS Jon A. Webb Department of Computer Science University of Texas at Austin ABSTRACT The problem of interpreting images of moving jointed objects is considered. Assuming the existence of a connectedness model, an algorithn is presented for calculat...	1980	89
88	A TECWIQUE FOR ESTABLISHING COMPLETENESS RESULTS IN THEOREM PROVING WITH EQUALITY Gerald E. Peterson Department of Mathematical Sciences University of Missouri at St. Louis St. Louis, MO 63121 ABSTRACT This is a summary of the methods and results of a longer paper of the same name which will app...	1980	9
89	BOOTSTRAP STEREO Marsha Jo Hannah Lockheed Palo Alto Research Laboratory Department 52-53, Building 204 3251 Hanover Street, Palo Alto, CA 94304 ABSTRACT Lockheed has been working on techniques for navigation of an autonomous aerial vehicle using passively sensed images. One technique which s...	1980	90
90	LOCATING PARTIALLY VISIBLE OBJECTS: THE LOCAL FEATURE FOCUS METHOD SRI Internati onal, Menlo Park, California 94 025 ABSTRACT Robert C. process is robust, because it bases its decisions on grou s of mutual1 is rela P- ively fast, % consistent features, and it ecause it concentrates on k...	1980	91
91	INTERFERENCE DETECTION AND COLLISION AVOIDANCE AMONG THREE DIMENSIONAL OBJECTS* N. Ahuja, R. T. Chien, R. Yen, and N. Bridwell Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, Illinois 61801 ABSTRACT Two methods for detecting intersections among ...	1980	92
92	AUTOMATED INSPECTION USING GRAY-SCALE STATISTICS Stephen T. Barnard SRI International, Menlo Park, California ABSTRACT A method for using gray-scale statistics for the inspection of assemblies is described. A test image of an assembly under inspection is registered with a model image of a nondefect...	1980	93
93	HUMAN MOVEMENT UNDERSTANDING: A VARIETY OF PERSPECTIVES Norman I. Badler Joseph O'Rourke Stephen Platt Mary Ann Morris Department of Computer and Information Science Moore School D2 University of Pennsylvania Philadelphia, PA 19104 ABSTRACT Our laboratory is examining ...	1980	94
94	AN OPTIMIZATION APPROACH FOR USING CONTEXTUAL INFORMATION IN COMPUTER VISION Olivier D. Faugeras Image Processing Institute University of Southern California Los Angeles, California 90007, U.S.A. ABSTRACT Local parallel processes are a very efficient way of using contextual information in a very ...	1980	95
95	SWIRL: AN OBJECT-ORIENTED AIR BATTLE SIMULATOR Philip Klahr, David McArthur and Sanjai Narain;: The Rand Corporation 1700 Main Street Santa Monica, California 90406 ABSTRACT ROSS, an object-oriented language that has evolved over the last two years as part of the...	1982	1
96	SPEX: A Second-Gcncration Espcrimcnt Iksifg System Yumi Iwasaki and Pctcr Friedland IIcuristic Programming Project, Computer Science Department Stanford University, Stanford, Ca. 94305 Abstract ‘I’hc design of laboratory cxperimcnts is a complex and important scientific task. The MOI,GEN p...	1982	10
97	CIRCUMSCRIPTION IMPLIES PREDICATE COMPLETION (SOMETIMES) Raymond Reiter Department of Computer Science Rutgers University New Brunswick, N. J. 08903 ABSTRACT Predicate completion is an approach to closed world reasoning which assumes that the given sufficient conditions o...	1982	100
98	Monitors as Responses to Questions: Determining Competence Eric Mays Department of Computer and Information Science Moore School of Electrical Engineering/D2 University of Pennsylvania Philadelphia, Pa. 19104 ABSTRACT This paper discusses the application of a pro...	1982	101
99	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	102

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.