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
200	AN INTELLIGENT AID FOR CIRCUIT REDESIGN Tom M. Mitchell, Louis I. Steinberg, Smadar Kedar-Cabelli Van E. Kelly, Jeffrey Shulman, Timothy Weinrich Department of Computer Science Rutgers University New Brunswick, NJ 08903 Abstract Digital circuit ...	1983	10
201	A NEW INFERENCE METEIOD FOR FRAME-BASED EXPERT James A. Reggia, Dana S. Nau, and Pearl Y. Department of Computer Science University of Maryland College Park, MD 20742 SYSTEMS Wang ABSTRACT This paper introduces a new frame-based model of diagnostic reasoning which i...	1983	11
202	Expert System Consultation Control Strategy James Slagle and Mdur.el lhynm * Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory Washington, D. C. 20375 Abstract User interfaces to expert systems represent a bottleneck since consultation time i...	1983	12
203	A RULE-BASED APPROACH TO INFORMATION SONE RESULTS AND COMMENTS BETBIEVAL: ABSTRACT Richard M. Tong, Daniel G. Shapiro, Brian P. McCune and Jeffrey S. Dean Advanced Information & Decision Systems 201 San Antonio Circle, Suite 286 Mountain View, CA 9404...	1983	13
204	IMPULSE: A Display Oriented Editor for STROBE Eric Schoen Reid G. Smith Schlumberger-Doll Research Old Quarry Road Ridgefield, Connecticut 06877 ABSTRACT In this paper, we discuss a display-oriented editor to aid in the construction of knowledge-based systems....	1983	14
205	I YAPS : A PRODUCTION RULE SYSTEM MEETS OBJECTS* ABSTRACT Elizabeth Allen University of Maryland This paper describes an antecedent-driven pro- duction system, YAPS (Yet Another Production Sys- tem) which encodes the left hand sides of produc- tion rules into a discrimination net in a manner ...	1983	15
206	SPECIFICATION-BASED COMPUTING ENVIRONMENTS Robert Baker, David Dye Matthew Morgenstern, Robert r7 Neches USC/Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90291 Abstract This paper considers the improvements that could result from basing fu...	1983	16
207	MASSIVELY PARALLEL ARCHITECTURES FOR Al: METL, THISTLE, AND BOLTZMANN MACHINES Scott E. Fahlman & Geoffrey E. Hinton Computer Science Department, Carnegie-Mellon University Pittsburgh PA 15213 Terrence J. Sejnowski Biophysics Department, The Johns Hopkins University Baltimor...	1983	17
208	An Object-Oriented Simulator For The ADiarv Henry Lieberman Artificial Intelligence Laboratory Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, Mass. 02139 USA Arpa Network Address: HENRY@MIT-AI Abstract This paper describes a simulator for the proposed Apia...	1983	18
209	Knowledge-based Programming Using Abstract Qata Types’ Gordon S. Novak Jr.2 Heuristic Programming Project Computer Science Department Stanford University Stanford, CA 94305 1. Abstract Features of the GLISP programming system that support knowledge-based programming ...	1983	19
210	THE ADVANTAGES OF ABSTRACT COEJTROL KNOWLEDGE IN EXPERT SYSTEM DESlGN William J. Clancey Heuristic Programming Project Computer Science Department Stanford University Stanford, CA 94305 ABSTRACT A poorly dcsigncd knowledge base can be as cryptic...	1983	2
211	AN OVERVIEW OF THE PENMAS TEXT GENERATION SYSTEM William C. Mann USC Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90291 ABSTRACT The problem of programming computers to produce natural language explanations and other texts on demand is an active research area ...	1983	20
212	RECURSION IN TEXT AND ITS USE IN LANGUAGE GENERATION1 Kathleen R. McKeown Department of Computer Science Columbia University New York, NY 10027 ABSTRACT In this paper, I show how textual structure is recursive in nature; that is, the same rhetor...	1983	21
213	REASONS FOR BELIEFS IN UNDERSTANDING: APPLICATIONS OF NON-MONOTONIC DEPENDENCIES TO STORY PROCESSING Paul O'Rorke Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL 61801 ABSTRACT Many of the inferences and decisions which contribute to understanding invol...	1983	22
214	The formalization of the domain is essential for solv- ing the following basic problems which are associated with the semantic processing of text. (1) (2) (3) (4) (5) establishing referents for the noun phrases; finding appropriate mappings from th...	1983	23
215	INTERACTWE SCRIPT INSTANTIATION Michael J. Pazzani The MITRE Corporation Bedford, MA 01730 ABSTRACT The KNOBS [ENGELMAN 801 planning system is an experimental expert system which assists a user by instantiating a stereotypical solution to his problem. sm, the natura...	1983	24
216	DETERMINISTIC AND BOTTOM-UP PARSING IN PROLOG Edward P. Stabler, Jr. University of Western Ontario London, ranada It is well kncwn that top-dcwn backtracking context free parsers are easy towrite in Prolog, and that these parsers can be extended to give them the per of ATN's. This repor...	1983	25
217	MCHART: A FLEXIBLE, MODULAR CHART PARSING SYSTEM HENRY THOMPSON Department of Artificial Intelligence University of Edinburgh Hope Park Square, Meadow Lane Edinburgh EH8 9NW ABSTRACT One of the most attractive properties of the active chart parsing methodology...	1983	26
218	MAPPING BETWEEN SEMANTIC REPRESENTATIONS USING HORN CLAUSES’ Ralph M. Weischedel Computer & Information Sciences University of Delaware Newark, DE 197 11 ABSTRACT Even after an unambiguous semantic interpretation has been computed for a sentence in context, th...	1983	27
219	J. Bczdwnko, D. k?kdi8, and E. F’itzpatrick Computer Science and Systems Branch Information Technology Division Naval Research Laboratory Washington, D.C. 20375 ABSTRACT At the Naval Research Laboratory, we are build- ing a deterministic parser, based on principles pro- posed by Marcus, that ...	1983	28
220	ABSTRACT TRACKING USER GOALS IN AN INFOEMATION-SEEKING ENVIRONMENT Sandra Carberry Department of Computer Science University of Delaware Newark, Delaware 19711 This paper presents a model for hypothesizing and tracking the changing task-level goals of a speaker during the course of an informa...	1983	29
221	DIAGNOSIS VIA CAUSAL REASONING: PATHS OF INTERACTION AND THE LOCALITY PRINCIPLE’ RANDALL DAVIS The Artificial Intelligence Laboratory Massachusetts Institute of Technology 545 Technology Square Cambridge, MA 02139 Abstract interest has grown recently in developing expert ...	1983	3
222	QE-III: A FORMAL APPROACH TO NATURAL LANGUAGE QUERYING James Clifford Graduate School of Business Administration New York University ABSTRACT -- believe that some such formal theory of a query language is an important first step towards the development of provably ...	1983	30
223	REPAIRING MISCOMMUNICATION: RELAXATION IN REFERENCE* Bradley A. Goodman Bolt Beranek and Newman Inc. 10 Moulton Street Cambridge, MA. 02238 ABSTRACT In natural language interactions listener a speaker and cannot be assured to have beliefs, the same contexts, back rounds or goals. ...	1983	31
224	PHONOTACTIC AND LEXICAL CONSTRAINTS IN SPEECIi RECOGNITION Daniel P. Huttenlocher and Victor W. Zue Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge, Massachusetts 02139 ABSTRACT We demonstrate a method for partitioning ...	1983	32
225	RESEARCHER: AN OVERVIEW1 Michael Lebowitz Department of Computer Science Computer Science Building, Columbia University New York, NY 10027 Abstract Described in this paper is a computer system, RESEARCHER, beine: develoDed at Columbia that reads ...	1983	33
226	THEORY RESOLUTION: BUILDING IN NONEQUATIONAL TH-EOR~S Mark E. Stickel Artificial Intelligence Center SRI International, Menlo Park, CA 94025 ABSTRACT Theory resolution constitutes a set of complete proce- dures for building nonequational theories into a resolution ...	1983	34
227	Analyzing tlic Roles of Descriptions and Actions in Open Systems Carl Hewitt Peter de Jong The Artificial Intelligence Laboratory Massachusetts l[nstitute of Technology Cambridge, Massachusetts 02139 Abstract This paper analyzes relationships between the roles of descriptions a...	1983	35
228	THE DECOMPOSITION OF A LARGE DOMAIN: REASONING ABOUT MACHINES Craig Staafill Department of Computer Science University of Maryland College Park, Maryland 20742 ABSTRACT Pneumatics The world of machines is divided into a hierarchy of seven sub-worlds, ranging from algebra to causality. Sepa...	1983	36
229	Finding Ali of the Sczlertions to a Problem David E. Smith Computer Scicncc Department Stanford University Stanford. California 94305 This paper dcsctibcs a method of cuttq off reasoning when all of the MWC~S to a problem hnvc been found Briefly the method involbcs keeping and mai...	1983	37
230	THE USE OF QUALITATIVE AND QUANTITATIVE SIMULATIONS Reid G. Simmons The Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139 ABSTRACT We describe a technique called imagining which uses a combination of qualitative and quantitati...	1983	38
231	DEFAULT REASONING AS LIKELIHOOD REASONING Elaine Rich Department of Computer Sciences The University of Texas at Austin Abstract Several attempts to define formal logic5 for some type of default reasoning have been made. All of these logics share the pro...	1983	39
232	Anne v.d.1,. Gardner Dcpartmcnt of Computer Science Stanford University Stanford. California 94305 The analysis of legal problems is a relatively new domain for AI. This paper outlines a model of legal reasoning, giving special attention to the unique characteristics of the domain, a...	1983	4
233	DEFAULT REASONING USING MONOTONIC LOGIC: A Modest Proposal Jane Terry Nutter Department of Computer Science, Tulane University This first order paper presents, a simple extension of to include a.default operator. P rodicatEflog+c iules inference s ecified, overning the opera...	1983	40
234	DATA DEPENDENCIES ON INEQUALITIES Drew McDermott Department of Computer Science Yale University A6stract: Numerical inequalities present new challenges to data-base systems that keep track of “dependencies,” or reasons for beliefs. Care must be taken ...	1983	41
235	by William J. Long* Clinical Decision Making Group. Laboratory for Computer Science Massachusetts Institute of Technology, Cambridge, Massachusetts Abstract The reasoning needed for diagnosis and patient management in a medical domain requires the ability to determine bot...	1983	42
236	THE DENOTATIONAL SEMANTICS OF HORN CLAUSES AS A PRODUCTION SYSTEM J-L. Lassez and M. Maher Dept. of Computer Science University of Melbourne Parkville, Victoria, 3052 Australia. ABSTRACT We show how one of Nilsson's tenets on rule-based production systems, ...	1983	43
237	AN AUTOl’ARTIC ALGORlTklM DES IGNER: AN Ir”dlTIAL I~fL~~~?E~~3TAT10N1 Elaine Kant and Allien IdeweiI Department of Computer Science Carneyle~Mcllon University Pittsburgh, Pennsylvania 15213 ABSTRACT This paper outlines a specification for an algorithm-design s...	1983	44
238	Abstract Proving the Correctness of Digital Hardware Designs Harry G. Barrow Fairchild Laboratory for Artificial Intelligence Research 4961 Miranda Ave., Palo Alto, CA 94304 VERIFY is a PROLOG program that attempts to prove the correct- ness of a digital design. It ...	1983	45
239	COMMUNICATION AND INTE ULTI-AGENT PLANNING* Michael George ff Artificial Intelligence Center, SRI International, 3% Ravenswood Ave., Menlo Park, CA., 94025. *This research was supported in part by ONR contract N000014- 80-C-0296 and in part by AFOSR contract ...	1983	46
240	An Overview of Meta-Level Architecture Michael R. Genesereth Stanford University Computer Science Department Stanford, California 94305 Abstract: One of the biggest problems in AT programming is the difficulty of specifying control. Meta-level architecture is a knowledge engine...	1983	47
241	On Inheritance Hierarchies With Exceptions David W. Etherington’ University of British Columbia Raymond Reiter2 University of British Columbia Rutgers University Abstract Using default logic, we formalize NETL-like inheritance hierar- chies with exceptions. Th...	1983	48
242	IMPROVING THE EXPRFSSIWJVESS OF MAN-Y SORTED LOGIC Anthony G Cohn Department of Computer Science University of Warwick Coventry CV4 7AL England Abstract Many sorted logics can allow an increase in deductive efficiency by eliminating useless branche...	1983	49
243	The GIST Behavior Explainer Bill Swat-tout USC/Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90291 Abstract One difficulty in understanding formal specifications is that there are often interactions between pieces of the specification, never explici...	1983	5
244	The Bayesian Basis of Common Sense Medical Diagnosis* Eugene Charniak Department of Computer Science Brown University Providence, Rhode Island 029 12 I Introduction While the mathematics of conditional probabilities in general, and Bayesian statistics in particular, wo...	1983	50
245	Jairne G. Cat bonell Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA 15213 A bst ract Derivational analogy, a method of solving problems based upon the transfer of past experience to new problem situations, is discussed in the context of other general appro...	1983	51
246	Abstract CJIL’NKER I$ a chcn program that uscq chunked knoulcdgc to ~&IL\ c success. Its domain is a subset of kii;g and pawn endings in chess th,lt has been studied for 01 er 300 years. CI JUN i<I:R has a large library of chunk inst;lnies where cnch chunk type has a p...	1983	52
247	KRYPTON: Integrating Terminology and Assertion Ronald J. Brachman Fairchild Laboratory for Artificial Intelligence Research Richard E. Fikes Xerox Palo Alto Research Center Hector J. Levesque Fairchild Laboratory for Artificial Intelligence Research Abstrac...	1983	53
248	A THEOREM-PROVER FOR A DECIDABLE SUBSET OF DEFAULT LOGIC Philippe BESNARD - Rene QUINIOU - Patrice QUINTON IRISA - INRIA Rennes Campus de Beaulieu 35042 RENNES Cedex FRANCE Abstract II DEFAULT LOGIC Non-monotonic logic is an attempt ...	1983	54
249	A P3ODUCTIOIJ SYST’El; FOR LEt”R!JI:IG PLA;JS F’XOir AiI I:::l-‘ZRT [S ] D Paul Denjal,iin and ;lalcol~ C !Iarrizo:k Courant Institute of i:athe;;atical Sciences IJew York Uiliversi ty 251 Liercer Street IJ e II Y 0 r k , IJY 10012 This ...	1983	55
250	LEARNING BY RE-EXPRESSING CONCEPTS FOR EFFICIENT RECOGNITION * Richard M. Keller Department of Computer Science Rutgers University New Brunswick, NJ 08903 Abstract Much attention in the field of machine learning has been directed at ...	1983	56
251	Episodic Learning Dennis Kibler Bruce Porter Information and Computer Science Department University of California alt Irvine Irvine, California Abstract A system is described which learns to compose sequences of operators into episodes for problem solving. The system incrementally...	1983	57
252	OPERATOR DECOMPOSABILITY: A NEW TYPE OF PROBLEM STRUCTURE I)cparrmcnt of Computer Scicncc Carncgic-Mellon University Pittsburgh, Pa. 1.5213’ Abstract ‘This paper dcscribcs a structural property of problems that allows an efficient strategy for solving a large number ...	1983	58
253	Why AM and Eurisko Appear to Work Douglas B. Lenat Heuristic Programming Project Stanford University Stanford, Ca. ABSTRACT Seven years ago, the AM program was constructed as an experiment in learning by discovery. Its source of power was a large body of heuristics, rules which guide...	1983	59
254	USING STRUCTURAL AND FUNCTIONAL INFORMATION IN DIAGNOSTIC DESIGN Walter Hamscher The Artificial Intelligence Laboratory Massachusetts Institute of Technology Abstract We wish to design a diagnostic for a device from knowledge of its structure and function. ...	1983	6
255	A Problem-Solver for Ma ing Advice Operational Jack Mostow USC lnformatlon Sciences Institute 4676 Admiralty Way. Marina del Rey, CA. 90291’ Abstract’ One problem with taking advice arises when the advice is expressed in terms of data ...	1983	60
256	AN ANALYSIS OF GENETIC-BASED PATTERN TRACKING AND COGNITIVE-BASED COMPONENT TRACKING MODELS OF ADAPTATION Elaine Pettit and Dr. Kathleen M. Swigger North Texas State University ABSTRACT The objective of this study was a comparison of the effectiveness in adapting to an environment of populati...	1983	61
257	A DOUBLY LAYERED, GENETIC PENETRANCE LEARNING SYSTEM Larry A. Rendell Department of Computing and Information Science University of Guelph Guelph, Ontario, Canada. NlG 2Wl ABSTRACT The author’s original state-space learning system (based on a pr...	1983	62
258	Generating Hypotheses to Explain Steven Salzberg Yale University Department of Computer Science New Haven, Connecticut Abstract Learning from prediction failures is one of the most important types of human learning from experience. In part...	1983	63
259	LEARNING : THE CONSTRUCTION OF A POSTERIOR1 KNOWLEDGE STRUCTURES Department of Computer and Paul D. Scott, Commun i ca Michigan Abstract This paper is a critical examination of both the nature of learning and its value in artificial ...	1983	64
260	SCHEMA SELECTION AND STOCHASTIC INFERENCE IN MODULAR ENVIRONMENTS Paul Smolensky Institute f or Cognitive Science University of California. San Diego C-015 La Jolla. CA 92093 AB!3TRAtX Given a set of stimuli presenting views of some environment, how can one characterize the natural ...	1983	65
261	HUMAN PROCEDURAL SKILL ACQUISITION: THEORY, MODEL AND PSYCHOLOGICAL VALIDATION” Kurt VanLehn Xerox Part 3333 Coyote Hill Rd. Palo Alto, CA 94304 Abstract It is widely held that ordinary natural language conversations are governed by tacit conventio...	1983	66
262	LEARNING PHYSICAL DESCRIPTIONS FROM FUNCTIONALDEFINITIONS, EXAMPLES,AND PRECEDENTS by Patrick H. Winston+ Thomas 0. BinfordS Boris Katz+ and Michael Lowrys Abstract It is too hard to tell vision systems what things look like. It is easier to talk about purpose and w...	1983	67
263	TWO RESULTS CONCERNING AMBIGUITY IN SIlAPE FROM SHADING Michael J. Brooks The School of Mathematical Sciences, Flinders University of South Australia, Adelaide, S.A. 5042, Australia. ABSTRACT Two shape from shading problems are con- sidered, one involving an image of a plane and the other an ima...	1983	68
264	FIND-PATH FOR A PLJM&CLASS ROtIOT Rodney A. Brooks MIT Artificial Intelligence Laboratory 545 Technology Square Cambridge, Massachusetts, 02139, U.S.A. Collision free motions for a manipulator with revolut,e joints (e.g. a PUMA) are planned thro...	1983	69
265	ABSTRACT DIAGN EXPLANATIONS OF STRATEGY OSTIC CONSULTATION SYSTEM Diane Warner Hasling Heuristic Programming Project Cornputer Science Department Stanford University Stanford, CA 94305 ABSTRACT This paper presents the explanation system for NEOMYCIN* , a medical con...	1983	7
266	A YARIATIONAL APPROACH TO EDGE DETECTION John Canny 998, MIT Artificial Intelligence Laboratory, 545 Technology Square, Cambridge, MA 02199 l’tlt: probIc:rn of dztc~ctin~ iri:,c:il::ity c!~arlges in images is canonical in \ isIon. lXi;e del,ectlou opc.1 :ltc,rs arc typ]Lally...	1983	70
267	A DESIGN METHOD FOR RELAXATION LABELING APPLICATIONS Robert A. Hummel Courant Institute, New York University ABSTRACT specified by a set of weighted preEerences, given by support functions si(R;p), which are functions of the labeling assignment 5. A separate function is given f...	1983	71
268	John R. Kender Department of Computer Science, Columbia University New York, NY 10027 Abstract This pa.per demonstrates how image features of linear extent (lengths and spacings) image-independent constraints on un erlying surface cf encrate ...	1983	72
269	MODEL-BASED INTERPRETATION OF RANGE IMAGERY Darwin T. Kuan Robert J. Drazovich Advanced Information 6 Decision Systems 201 San Antonio Circle, Suite 286 Mountain View, CA 94040 ABSTRACT This paper describes a model-based approach to interpreting ...	1983	73
270	An Iterative Method for Reconstructin Convex Polyhedra from Extended Gaussian f mages James J. I, ittle* De artment of Corn up uter Science niversity of Britis R Columbia ABSTRACT In computing a scene description from an image, a useful intermediate representatio...	1983	74
271	PERCEPTUAL ORGANIZATION AS A BASIS FOR VISUAL RECOGNITION David G. Lowe and Thomas 0. Rinford Computer Science Department Stanford TJniversity, Stanford, California 94305 Abstract Evidence is prescnled showiug that bottom-up grouping of im&ge fe...	1983	75
272	From: AAAI-83 Proceedings. Copyright ©1983, AAAI (www.aaai.org). All rights reserved.	1983	76
273	T. E. Weymouth, J. S. Grifftth, A. R. Hanson and E. M. Rtseman Department of Computer and hformatbn Z%kme, htversity of Massachusetts at Amkfstl We present an interpretation system which utilizes world knowledge in the form of simple object hypothesis rules...	1983	77
274	LEARNING OPERATOR SEMANTICS BY ANALOGY Sarah A. Douglas Stanford University and Xerox Palo Alto Research Center* Abstract This paper proposes a cognitive model for human procedural skill acquisition based on problem sol\ing in problem spaces and the use or’ an&)g! for buildmg the reprcscnrati...	1983	78
275	Three Dimensions of Design Development Neil M. Goldman USC/information Sciences institute 4676 Admiralty Way Marina del Rey, CA 90291 Abstract Formal specifications are difficult to understand for a number of reasons. When the developer of a large specification explains it to another ...	1983	79
276	TALIB: An 16 Layout Design Assistant Jin Kim and John McDermott Departments of Electrical Engineering and Computer Science Carnegie-Mellon University Pittsburgh, Pa. 15213 Abstract This paper describes a knowledge-based system for automatically synthe...	1983	8
277	STRATEGIST: A Program that Models Strategy-Driven and Content-Driven Inference Behavior ABSTRACT Richard H. Granger Kurt P. Eiselt Jennifer K. Holbrook Artificial Intelligence Project Computer Science Department University of California Irvine, California 92717 1.0 Introduction Artifici...	1983	80
278	Planning and Goal Interaction: The use of past solutions in present situations Kristian J. Hammond Department of Computer Science Yale University New Haven, Connecticut 06520 Abstract This payer presents WOK, a cased-based planner that makes use of memory structures based on go...	1983	81
279	MODELING HIJMAN KNOWLEDGE OF ROIJTES: PARTIAL KNOWLEDGE AND INDIVIDUAL VARIATION Benjamin Kuipers Department of Mathematics Tufts University Medford, Massachusetts 02155 Abstract Commonsense knowledge of large-scale space (the cognitive map) includes sev...	1983	82
280	Six Problems for Story Understanders Peter Norvig Division of Computer Science Department of EECS University of California, Berkeley Berkeley, CA 94720 ABSTRACT Story understanding programs have been classified as script-based processors, goal-based ...	1983	83
281	An Analysis of a Welfare Eligibility Determination Interview: A Planning Approach Eswaran Subrahmanian School of Urban and Public Affairs Carnegie-Mellon University Abstract The purpose of this research is to identify strategies and plans used by welfare caseworkers in order to build...	1983	84
282	A Model of Learning by Incrernenfal Analogical Reasoning and Mark H. Burstein Department of Computer Science Yale University New Haven, Connecticut 08520 Abstract This paper presents a mode! of analogical reasoning for learning. The mode! ...	1983	85
283	THEOPTI TYOFA'RMSITED' Rina Dechter and Judea Pearl C%%%F ~~~D$brat~%, University 0 P California, Los r eles, CA 90024 A..BsmAcT This paper examines the optimality of A*, in the sense of expanding the least number of distinct nodes, over three classes of ...	1983	86
284	ABSTRACT This paper describes how integrity con- straints, whether user supplied or automatically generated during the search, and analysis of failures can be used to improve the execution of function free logic programs. Integrity con- straints are used to guide both the forward and ...	1983	87
285	THE COMPOSITE DECISION PROCESS: A UNIFYING FORMULATION FOR HEURISTIC SEARCH, DYNAMIC PROGRAMMING AN'D BRANCH & BOUND PROCEDURES+ Vipin Kumar* Laveen Kanal'k* Department of Computer Science, University of Texas at Austin, Austin, TX "Department of Computer Science, University of Mar...	1983	88
286	SOLVING the GENERAL CONSISTENT LABELING (or CONSTRAINT SATISFACTION) PROBLEM: TWO ALGORITHMS and their EXPECTED COMPLEXlTlES Bernard Nude1 Dept Computer Science, Rutgers University, New Brunswick, N.J. 08903 ABSTRACT The Consistent Labeling Problem is of consider...	1983	89
287	John C. Kunz* Heuristic Proyr.amming Project Sta~lford University, Stanford CA 94305 II KNOWLEDGE REPRESENTATION l’hc objcctivc of this rcscnrch is to dcmonstratc a methodology for the design and use of a physiological model in a computer program tli,rt suggests medicA de...	1983	9
288	Basmina Pavlin Computer and Infcumation Science Department University of Mtssacbusetts Amherst, Massachusetts, 01003 A model of a distributed knowledge-based system is presented. The model captures the features specific to those systems, s...	1983	90
289	NON-MINTMAX SEARCH SI’RAmGIES FOR USE AGAINST FALLIBIX OPPOmS Andrew I,. Reibman Bruce W. BaIlard Computer Science Dept. Duke University Durham, NC 27706 ABSTRACT Most previous research on the use of search for minimax game playing has focused on improving search ef...	1983	91
290	A THEORY OF GAME TREE$ Chun-Hung Tzeng and Paul W. Purdom, Jr. Computer Science Department Indiana University Bloomington, IN 47405 ABSTRACT A theory of heuristic game tree search and evalua- tion functions for estimating minimax values is de...	1983	92
291	Diagnosing Circuits with State: An Inherently Underconstrained Problem Walter Hamscher Randall Davis Artificial Intelligence Laboratory Massachusetts lnstltute of Technology 545 Technology Square Cambridge, Mass 02139 “Hard problems” can be hard because the...	1984	1
292	NON-MONOTONIC REASONING USING DEMPSTER’S RULE Matthew L. Ginsberg Department of Computer Science St,anford University Stanford, California 94305 ABSTRACT Rich’s suggestion that the arcs of semantic nets be lahelletl so as to reflect confidence in t...	1984	10
293	A Theory of Action for MultiAgent Planning Michael Georgeff Artificial Intelligence Center SRI International 333 Ravenswood Ave. Menlo Park, California 94025. Abstract A theory of action suitable for reasoning about events in multiagent or dynamically chang...	1984	11
294	QUALITATIVE REASONING WITH HIGHER-ORDER DERIVATIYES Johan dc Klccr and IIanicl G. IIobrow lntclligcnt Systems I.aboratory XJ’ROX Palo Alto Rcscarch Center 3333 Coycjtc I Iill I<oild Pal0 Al to, Cillif0l~llia 94304 Considcriiblc progress has been made ...	1984	12
295	TOWARDS A BETTER UNDERSTANDING OF BIDIRECTIONAL SEARCH Henry W. Davis Randy B. Pollack Thomas Sudkamp Wright State University ABSTRACT Three admissible bidirectional search algorithms have been described in the literature: A Cartesian product approach due to Doran, Pohl's BHPA, and Cham...	1984	13
296	A Forward Inference Engine to Aid in Understanding Specifications* Donald Cohen USC Information Sciences Institute 4676 Admiralty Way Marina del Rey, CA 90292 Abstract: An important part of understanding a specification is recognizing the consequences of what is stated. ...	1984	14
297	FOCUSING IN PLAN RECOGNITION Norman F. Carver, Victor R. Lesser, Daniel L. McCue* Department of Computer and Information Science The University of Massachusetts Amherst, Massachusetts, 01003 ABSTRACT A plan recognition architecture is presented which exploi...	1984	15
298	A SELF-MODIFYING THEOREM PROVER Cynthia A. Brown GTE LABORATORIES INCORPORATED 40 Sylvan Road Waltham, Massachusetts 02254 Abstract: Theorem provers can be viewed as containing declarative knowledge (in the form of axioms and lemmas) and procedural knowledge (in the form of an algorithm for p...	1984	16
299	Generalization Hearistics for Theorems Related to Recarsivcly Defined Fanctions S. Kamal Abdali Computer Research Lab Tektronix, Inc. P.O. Box so0 Beaverton, Oregon 97077 ABSTRACT This paper is concerned with the problem of general- izing theorems about recursively defined functions,...	1984	17

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.