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
300	CHOICES WITHOUT BACKTRACKING John11 dc Klccr Intcllipcnt Systems I.aboratory XEROX Palo Al to I<cscarch Ccn tcr 3333 Coyote IHill Road Palo Alto, California 94304 ‘I’l~c rCSlill:i of this paper arc h0r11 out of frustration. Qualitative rc;lsoning and con\traint Ii~l~LJ...	1984	18
301	Maintaining Diversity in Genetic Search Michael L. Mauldin Department of Computer Science Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 Abstract Genetic adaptive algorithms provide an efficient way to search large function spaces, and ...	1984	19
302	The Use of Continuity in a Qualitative Physics Brian C. Williams hrtificinl Inlclli~encc 1 .aboratc,ry Massachusetts Instltutc of ‘I’cchnology ‘I’hc ttbility to reason about a scrics of complex ckcnts over time is cstcntial in analyzing physical systems. This paper ...	1984	2
303	Constraint-based Generalization Learning Game-Playing Plans from Single Examples Steven Minton Computer Science Department Carnegie-Mellon University Pittsburgh, PA 15213 Abstract Constraint-based Generalization is a technique for deducing generalizations from...	1984	20
304	Generalization for Explanation-based Schema Acquisition Paul O'Rorke Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, Illinois 61801 ABSTRACT This paper is about explanation-based learn- ing for heuristic problem solvers which "build" solutions using schemata (fr...	1984	21
305	Learning Operator Transformations Bruce W. Ported, Dennis F. Kibler Information and Computer Science Department University of California at Irvine Irvine, Ca 92717*+ Abstract A relational model representation of the effect of op- erators is learned and u...	1984	22
306	Constraint Limited Generalization: Acquiring Procedures From Examples Peter M. Andreae M.I.T. Artificial Intelligence Laboratory 545 Technology Sq., Cambridge, MA 02139 Abstract Generallzatlon IS an essential part of any system that can acquire knowledge from exanIp...	1984	23
307	LEARNING PROBLEM CLASSES BY MEANS OF EXPERIMENTATION AND GENERALIZATION Agustln A. Araya Departamento de Ciencia de la Computacibn P. Universidad Catolica de Chile Casilla 114-D, Santiago , Chile ABSTRACT We discuss a method of learning by practice based on the idea of determining classes ...	1984	24
308	Learning About Systems That Contain State Variables Thomas G. Dietterich Department of Computer Science Stanford University Stanford. CA 94305 A bst ract It is difficult to learn about systems that contain state variables when those variables are not directly observable. ...	1984	25
309	Towards Chunking as a General Learning Mechanism John E. Laird, Paul S. Rosenbloom and Allen Newell Computer Science Department Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 ABSTRACT Chunks have long been proposed as a basic organizational unit for human memory. ...	1984	26
310	Task Frames in Robot Manipulation Dana H. Ballard Department of Computer Science University of Rochester Rochester, NY 14627 Abstract Most robotics computations refer to a single world- based frame of reference; however, several advantages accrue with the introduction ...	1984	27
311	Path Relaxation: Path Planning for a Mobile Robot Charles E. Thorpe Computer Science Department, Carnegie-Mellon University Abstract. Path Relaxation is a method of planning safe paths around obstacles for mobile robots. It works in two steps: a global grid starch that fi...	1984	28
312	‘l‘hrer findpath problcrns are considered. First, ihe probkrn of finding a collision frrc trajectory for a tentacle niariipulator is examirlcd. Sec- Abstract Three Findpath Problems Richard S. Wallace Department of Computer Science Carnegie-Mellon Univer...	1984	29
313	A MECHANICAL SOLUTION OF SCHUBERT'S STEAMROLLER BY MANY-SORTED RESOLUTION Christoph Walther Institut fiir Informatik I UNIVERSITET KARLSRUHE Postfach 6380 D-7500 Karlsruhe 1 Abstract We demonstrate the advantage of using a many-sorted resolution calculus by a mechanical solution o...	1984	3
314	RECONSTRUCTING A VISIBLE SURFACE A. Blake Computer Science Department, University of Edinburgh, King's Buildings, Mayfield Rd, Edinburgh, Scotland. ABSTRACT We address the problem of reconstructing the visible surface in stereoscopic vision. We point out the need for viewpoint invarianc...	1984	30
315	A SYSTEM OF PLANS FOR CONNECTED SPEECH RECOGNITION Renato DE MO& Yu F. MONG Ooncordia Univeruity, Department of Computer Science, 1466, de MAsonneuve Blvd. Montreal, Quebec. H3G lM8, Canada Abrt?tLCt A planning system for recognising connected letters...	1984	31
316	A significant problem in image understanding (IU) is to represent objects as models stored in a DOHAIN INDEPENDENT OBJECT DESCRIPTION AND DECOKPOSITION Tad S. Levitt Advanced Information L Decision Systems 201 San Antonio Circle, Suite 286 Mountain View, C4 94040 AB...	1984	32
317	A REPRESENTATION FOR IMAGE CURVES Pnvid H. Ivl,larirnont Artificial Intc~lligcuc*c L&oratory Stanford TJnivcrsit,y Stanford, California 04305 ABSTRACT A rcpresmltation for image curves and an algorithm for its complltntion arc introducrd. The representation is de...	1984	33
318	SHADING INTO TEXTURE Alex P. Pentland Artificial Intelligence Center, SRI International 333 Ravenswood Ave., Menlo Park, California 94025 ABSTRACT Shape-from-shading and shape-from-texture methods have the serious drawback that they are applicable only to smooth ...	1984	34
319	EFFICIENT MULTIRESOLUTION ALGORITHMS FOR COMPUTING LIGHTNESS, SHAPE-FROM-SHADING, AND OPTICAL FLOW Dcructri l’cr~opoulos M/T Artficial lrrrclligcnce Laboratory 545 Tccl1110logy Square Canlbrrdge, hlA 02139 Abstract 1. INTRODUCTION A ni~mbcr of ccmputAionn1 Lhks in ...	1984	35
320	Jon A. Wcbbt and Edward Pervint +Dfy2rtmc~ut of Computer Scicuce Carnegie-Mellon University, Pittsburgh, PA 15217 tPerq Systems Corporation Pittsburgh, PA 15217 ABSTRACT We develop a theoretical framework for interpolating vi- sual contours and apply ...	1984	36
321	FINGERPRINTS THEOREMS A.L. Yuille and T. Poggio Artificial Intelligence Laboratory*Massachusetts institute of Technologymcambridge, Mass. Abstract. We prove that the scale map of the .zero-crossings of almost all signals filtered by a gaussian of variable size deter- mines the signal...	1984	37
322	PERSONAL CONSTRUCT THEORY AND THE TRANSFER OF HUMAN EXPERTISE John H. Boose Boeing Computer Services, 7A-03, PO Box 24346, Seattle, Washington, 98124 Abstract. The bottleneck in the process of building exnert svstems is retrieving the appropriate problem- solving knowledge from tKe hum-in expert. -Met...	1984	38
323	CLASSIFICATION PROBLEM SOLVING William J. Clancey Heuristic Programming Project Computer Science Department Stanford University Stanford. CA 94305 ABSTRACT A broad range of heuristic programs-embracing forms of diagnosis, catalog selection, and skeletal planning-acc...	1984	39
324	Knowledge Inversion Yoav Shoham Drew V. McDermott Department of Computer Science Yale University Box 2158 Yale Station, New Haven, CT. 00520 Abstract We define the direction of knowledge, and what it means to extend that direction. A special case is func...	1984	4
325	YEWMVS: A Continuous Real Time Expert System J.H. Griesmer, S.J. Hong, M. Karnaugh, J.K. Kastner, M.I. Schor Expert Systems Group, Mathematical Science Department R.L. Ennis, D.A. Klein, K.R. Milliken, H.M. VanWoerkom Installation Management Group, Computer Science Department IBM T. J. Wat...	1984	40
326	SELF-EXPLANATORY FINANCIAL PLANNING MODELS Donald W. Kosy and Ben P. Wise The Robotics Institute, Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 The purpose of computing is insight, not numbers. -- R. W. Hamming ABSTRACT A financial model is a representation of the a...	1984	41
327	SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 ABSTRACT The need for presenting useful descriptions of problem solving activitie...	1984	42
328	CONTINUOUS BELIEF FUNCTIONS FOR EVIDENTIAL REASONING Thomas M. Strat SRI International 333 Ravenswood Ave. Menlo Park, CA 94025 ABSTRACT Some recently developed expert systems have used the Shafer- Dempster theory for reasoning from multiple bodies of...	1984	43
329	The Tractability of Subsumption in Frame-Based Description Languages Ronald J. Brachman Hector J. Levesque Fairchild Laboratory for Artificial Intelligence Research 4001 Miranda Avenue Palo Alto, California 94304 ABSTRACT A knowledge representation system prov...	1984	44
330	LIKELIHOOD, PROBABILITY, AND KNOWLEDGE Joseph Y. Halpern IBM Research Laboratory San Jose, California 95193 David A. McAllester MIT Artificial Intelligence Laboratory Cambridge, Massachusetts 02 139 Abstract: The modal logic LL was introduced by Halpern and Rabin...	1984	45
331	A Logic of Implicit and Explicit Belief Hector J. Levesque Fairchild Laboratory for Artificial Intelligence Research 4001 Miranda Avenue Palo Alto, California 94304 ABSTRACT As part of an on-going project to understand the found* tions of Knowledge Representation, we are attempting to ...	1984	46
332	A SELF-ORGANZING RETRIEVAL SYSTEM FOR GRAPHS Robert Levinson Department of Computer Sciences University of Texas at Austin Austin 9 TX 7871“ Y ABSTRACT* The design of a general knowledge base for labeled graphs is presented. The design inv...	1984	47
333	A~-T~ORETICFRCWlEWORKFOR~IET'~OCESSINGOF UNCEHTAINKNOWLEDGE S. Y Lu and H. E. St ephmmu Long Range Research Division Exxon Production Research Co. P. 0. Box 2189 Houston, Texas 77001 ABSTRACT In this paper, a knowledge base is represented by an input space, an outpUt spac...	1984	48
334	Expressiveness of Languages1 Jock Mackinlay Michael R. Genesereth Computer Science Department St anford University Stanford, California 94305 Abstract Specialized languages are often a good choice for expressing a set of facts. However, many specialized languages are limited in their ex...	1984	49
335	QUALITATIVEHODELIMG IN THE TURBChJETENGIHEDOFlAIN Raman Rajagopalan" Coordinated Science Laboratory University of Illinois at Urbana-Champaign 1101 W. Springfield Ave. Urbana, Illinois 61801 ABSTRACT This paper addresses some of the issues involved in modeling the domain of turbojet engine ...	1984	5
336	Proce;;i; % Evtailments and Accessing Facts nrform Frame System* ArLthony S. Maida Institute of Cognitive Studies University of California, Berkeley Berkeley, California 94720 Computer Science Dept. Penn State University University Park, PA 1680...	1984	50
337	Constraint Equations: A Concise Compilable Representation for Quantified Constraints in Semantic Networks Matthew Morgenstern Information Sciences Institute’ University of Southern California 4676 Admiralty Way, Marina del Rey, CA 90292 Abstract Constraint Equations...	1984	51
338	Implicit Ordering of Defaults in Inheritance Systems David S. Touretzky Computer Science Department Carnegie-Mellon University Pittsburgh, PA 15213 Abstract There is a natural partial ordering of defaults in inheritance systems that resolves ambiguities in an intuit...	1984	52
339	VERY-HIGH-LEVEL PROGRAM-MING OF KNOWLEDGE REPRESENTATION SCHEMES Stephen J. Westfold Stanford University and Kestrel Institute, Palo Alto, CA 94304 ABSTRACT This paper proposes building knowledge-based systems using a programming system based ...	1984	53
340	A MODEL OF LEXICAL ACCESS OF AMBIGUOUS WORDS Garrison W. Cottrell Dept. of Computer Science University of Rochester Rochester, N.Y. 14627 ABSTRACT Recent psycholinguistic work in the study of lexical access has supported a modular view of the process. That is, lexical access proceeds indepedentl...	1984	54
341	AUTOMATED COGNITIVE MODELING* Pat LangIcy Stcllan Ohlsson ‘I’hc Robotics lnstitutc Carncgic-Mellon University Pittsburgh, Pennsylvania 15213 USA Abstract In this paper WC dcscribc an approach to automating the construction of cognitive process models. WC make two psychological ...	1984	55
342	EXPLAINING AND ARGUING WlTH EXAMPLES ’ Edwina L. Rissland Eduardo M. Valcarce Kevin D. Ashley Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 AlShCt In this paper, we discuss two tasks - on-line help and ...	1984	56
343	PHENOMENOLOGICALLY PLAUSIBLE PARSIBJG David L. Waltz and Jordan B. Pollack Coordinated Science Laboratory University of Illinois at Urbana-Champaign 1101 W. Springfield Ave. Urbana, Illinois 61801 ABSTRACT This is a description of research in develop- ing a natural language processing system wit...	1984	57
344	Hardware and Software Architectures for Efficient AI Michael F. Doming Fairchild Laboratory for Artificial Intelligence Research Fairchild Camera and Instrument Corporation 4001 Miranda Avenue Palo Alto, California 94304 Abstract With recent advances in AI technolog...	1984	58
345	SYNTAX PROGRAMMING Stefan Feyock Department of Computer Science College of William and Mary Williamsburg, Virginia 23185 ABSTRACT This paper describes a new programming tech- nology that is to syntax analysis as formal logic is to logic programming, and which we have accord- ...	1984	59
346	D-NODE RETARGETING IN BIDIRECTIONAL HEURlSTIC SEARCH George Politowski and Ire Fohl Computer and Information Sciences Uaivoruity of California, Santa Crux, CA 95064 ABSTRACT AIthough it is generally agreed that bidirectional heuristic search is potentially more ...	1984	6
347	Initial Assessment of Architectures for Production Systems Charles Forgy’ Anoop Guptal Allen Newell’ Robert Wedig’ Carncgic-Mellon University Pittsburgh, Pennsylvania 15213 Abstract Although production systems are appropriate for many applications in the artificial intelligence an...	1984	60
348	FIVE PARALLEL ALGORITHMS FOR PRODUCTION SYSTEM EXECUTION ON THE DAD0 MACHINE* Salvatore J. Stolfo Computer Science Department Columbia University New York City, N.Y. 10027 Abstract In this paper we specify five abstract algorithms ...	1984	61
349	Referential Determinism and Computational Efficiency: Posting Constraintsfrom DeepStructure* Gavan Duffy and John C. Mallet-y Department of Political Science Massachusetts Institute of Technology Cambridge MA 02139 Arpanet: Gavan at MIT-MC, JCMa at MIT-MC Abstract ...	1984	62
350	A SEMANTIC PROCESS FOR SYNTACTIC DISAMBIGUATION Graeme Hirst Department of Computer Science University of Toronto Toronto, Canada M5S lA4 ABSTRACT Structural ambiguity in a sentence cannot be resolved without semantic help. We present a process for struc- tural disambiguation that us...	1984	63
351	** AravindJoshi and Ronniekbber Departmnt of muter and Information Science More School/D2 University of Pennsylvania Philadelphia PA 19104 Ralph M. Weischedel Departmnt of Gmputer & Infomation Sciences University of Delaware Kemrk DE 19716 AlssIRAcr In cooperative rmmrachine interact...	1984	64
352	FRAME SELECTION IN PARSING* Steven L. Lytinen Dept. of Computer Science, Yale University New Haven CT 06520 ABSTRACT The problem of frame selection in parsing is discussed, with the focus on the selection of a frame for texts which contain ...	1984	65
353	A PRODUCTION RULE SYSTEM FOR MESSAGE SUMMARIZATION Elaine Marsh and Henry Hamburger* Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory - Code 7510 Washington, D.C. 20375 *Also at George Mason University ABSTRACT ...	1984	66
354	An Interactive Computer-based Tutor for LISP* Robert G. Farrell John R. Anderson Brian J. Reiser Advanced Computer Tutoring Project Department of Psychology, CMU Pittsburgh, PA 15273 USA recursion, and iteration. of this instruction. We have currently implemented...	1984	67
355	Intention-Based Diagnosis of Programming Errors W. Lewis Johnson - Elliot Soloway Yale University Computer Science Department New Haven, Ct. 06520 Abstract PROUST is a system which identifies the non-syntactic bugs in novices’ programs and provides ...	1984	68
356	CONTEXT-DEPENDENT TRANSH’IONS IN TUTORING DISCOURSE Beverly Woolf David D. McDonald Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 ABSTRACX Successful machine tutoring, like other forms of ~~mamnachine ...	1984	69
357	HOW TO COPE W-ITH ANOMALIES IN PARALLEL APPROXIMATE BRANCH-AND-BOUND ALGORITHMS Guo-jie Li and Benjamin W. Woh School of Electrical Engineering Purdue University West Lafayette, Indiana 47907 Abstract: A genera! technique for solving a wide variety of se...	1984	7
358	A General Bottom-up Procedure for Searching And/Or Graphs Vipin Kumar Department of Computer Sciences University of Texas at Austin Austin, TX 78712 ABSTRACT This paper summarizes work on a general bottom- up procedure for searching AND/OR gr...	1984	8
359	META-LEVEL CONTROL THROUGH FAULT DETECTION AND DIAGNOSIS Eva Hudlicka and Victor R. Lesser Department of Computer and Information science university of Ma!BachuMts Amherst, Massachusetts, 01003 ABSlTtACT Control strategies in most compla p&lem-s0lving systems,...	1984	9
360	TEACHING A COMPLEX INDUSTRIAL PROCBSS Beverly Woolf Computer and Information Science University of Massachusetts Amherst, Massachusetts, 01003 Darrell Blegen Johan H. Jansen Arie Verloop J. H. Jansen Co., Inc. Steam and Power Engineers 18016 140 Ave. NE. Woodinville (Seattle), ...	1986	1
361	INTEGRATION OF MULTIPLE KNOWLEDGE SOURCES IN ALADIN, AN ALLOY DESIGN SYSTEM M. D. Rychener,’ M. L. Farinacci,2 I. Hulthage,’ and M. S. Fox1 1 Intelligent Systems Laboratory, Robotics Institute, Carnegie-Mellon University, Pittsburgh, PA 15213 2ALCOA Laboratories, ALCOA Center, PA 15069 ABSTRA...	1986	10
362	PHYSICS FOR ROBOTS James G. Schmolze BBN Laboratories Inc. 10 Moulton Street Cambridge, MA 02238 ABSTRACT Robots that plan to perform everyday tasks need knowledge of everyday physics. Physics For Robots (PFR) is a representation of part of e...	1986	100
363	COOPERATION WITHOUT COMMUNICATION Michael R. Genesereth, Matthew L. Ginsberg, and Jeffrey S. Rosen&&n* Logic Group, Knowledge Systems Laboratory, Computer Science Department, Stanford University, Stanford, California 94305 ABSTRACT Intelligent agents ...	1986	101
364	INCREMENTAL PLANNING TO CONTROL A BLACKBOARD-BASED PROBLEM SOLVER Edmund H. Durfee and Victor R. Lesser Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 ABSTRACT To control problem solving activity, a planner must res...	1986	102
365	An Adaptive Planner Richard Alterman Computer Science Division University of California, Berkeley Berkeley, California 94720 ABSTRACT This paper is about an approach to the flexi- ble utilization of old plans called adaptive plan- ning. An adaptive ...	1986	103
366	THE REPRESENTATION OF EmNTS IN MULTIAGENT DOMAINS Michael I’. Georgeff * Artificial Intelligence Center SRI International Menlo Park, California Abstract The purpose of this paper is to construct a mode! of actions ar,d events suited to reasoning about ...	1986	104
367	PLANNING WITH ABSTRACTION Josh Tenen berg Department of Computer Science University of Rochester Rochester, NY 14620 josh@rochester objects of type v are also objects of type w, and inherit all properties provable of type w. We will call w an abstraction of v, and v a specializati...	1986	105
368	GENERATING PERCEPTION REQUESTS AND EXPECTATIONS TO VERIFY THE EXECUTION OF PLANS Richard J. Doyle David J. Atkinson Rajkumar S. Doshi Jet Propulsion Laboratory 4800 Oak Grove Drive, Pasadena, CA 91109 ABSTRACT This paper addresses the problem of verifying plan execution. An ...	1986	106
369	A Representation of AC tion Structures Erik Sandewall and Ralph Rgnnquist Department of Computer and Information Science Linkiiping University Linkiiping, Sweden Abstract: We consider structures of actions which are partially ordered for time, whic...	1986	107
370	ORDER OF MAGNITUDE REASONING Olivier Raiman A.I. Research Department C.F. Picard lab. IBM Paris Scientific Center University P.M. Curie 36 Ave. R. Poincare Paris 75 116 France. ABSTRACT This paper presents a methodology for extending representation and reasoning in Qualitative Physics. ...	1986	108
371	MULTIPLE FuAULTS Johan de Klcer Intelligent Systems Laboratory XEROX Palo Alto R.esenrch Center 3333 Coyote Hill Road Palo Alto, California 94304 and Brian C. Williams M.I.T. Artilicial Intelligence Laboratory 545 Technology Squar...	1986	109
372	ARTIFICIAL INTELLIGENCE AND DESIGN: A MECHANICAL ENGINEERING VIEW John R. Dixon Department of Mechanical Engineering University of Massachusetts Amherst, MA., 01003 ABSTRACT Most AI research into design has been based on or directed to the electrical ...	1986	11
373	PLAUSIBILITY OF DIAGNOSTIC HYPOTHESES: The Nature of Simplicity Yun Peng and James A. Reggia Department of Computer Science University of Maryland College Park, MD. 20742 Abstract In general diagnostic problems multiple disorders can occur simultan...	1986	110
374	Doing Time: Putting Qualitative Reasoning on Firmer Ground Brian C. Williams MIT Artificial Intelligence Laboratory 545 Technology Square Gambradge, MA 02139 (wzlliams%mit-ozQmit-mc.arpa) Abstract (e.g., digital, quantitative, qualitative or symbolic abstrac- ...	1986	111
375	Interpreting measurements of physical systems Kenneth D. Forbus Qualitative Reasoning Group Department of Computer Science University of Illinois 1304 W. Springfield Avenue Urbana, Illinois, 61801 Abstract An unsolved problem in qualitative physics is generating ...	1986	112
376	“COMMONSENSE” ARITHMETIC REASONING Reid Simmons The Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139 Abstract “Arithmetic reasoning” can range in complexity from simple integer arithmetic to powerful symboli...	1986	113
377	A REASONING MODEL BASED ON AN EXTENDED DEMPSTER-SHAFER THEORY * John Yen Computer Science Division Department of Electrical Engineering and Computer Sciences University of California Berkeley, CA 94720 ABSTRACT The Dempster-Shafer (D-S) theory of evidence s...	1986	114
378	An Integration of Resolution and Natural Deduction Theorem Proving Dale Miller and Amy Felty Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 Abstract: We present a high-level approach to the integra- tion of such different...	1986	115
379	Multi-valued logics Matthew T,. Ginsberg* THE LOGIC GROUP KNOWLEDGE SYSTEMS LABORATORY Department of Computer Science Stanford University Stanford, California 94305 ABSTRACT A great deal of recent theoretical work in inference has in- volved ext...	1986	116
380	IMPLEMENTATION OF AND EXPERIMENTS WITH A VARIABLE PRECISION LOGIC INFERENCE SYSTEM* Peter Haddawy Intelligent Systems Group Department of Computer Science University of Illinois Urbana, Illinois 61801 ABSTRACT A system capable of performing ...	1986	117
381	BAYESIAN INFERENCE WITHOUT POINT ESTIMATES Paul Snow Hawthorne College 59 Maple Ave #107 Keene, NH 03431 ABSTRACT It is conventional to apply Bayes' formula only to point estimates of the prior probabilities. This convention is unnecessarily restrictive. The analyst ma...	1986	118
382	ADVANCES IN RETE PATTERN MATCHING Marshall 1. Schor, Timothy P. Daly, Ho Soo Lee, Beth R. Tibbitts IBM T. J. Watson Research Center P.O. Box 218, Yorktown Heights, NY 10598 USA Abstract A central algorithm in production systems is the pattern match among rule predic...	1986	119
383	Knowledge Engineering Issues in VLSI Synthesis w. H. wolf T. J. Kowalski hf. C. McFarland, S.J. AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT This paper explores VLSI synthesis and the role that traditional AI methods can play in solving this problem. VLSI synthesis is ...	1986	12
384	Causal and Plausible Reasoning in Expert Systems Gerald Shao-Hung Liuf Advanced Products, VHSIC Test Systems, SentryBchlumberger 1725 Technology Dr., San Jose, CA 95 115 ABSTRACT This study sets out to establish a unified framework for causal and plausible reasoning. We identify a primitive set of cau...	1986	120
385	Using Decision Theory to Justify Heuristics Curtis P. Langlotz, Edward H. Shortliffe, Lawrence M. Fagan Medical Computer Science Group Knowledge Systems Laboratory Medical School Office Building Stanford University Medical Center Stanford, California 94305 ABSTRACT We present a me...	1986	121
386	A Framework for Comparing Alternative Formalisms for Plausible Reasoning Eric J. Horvitz, David E. Heckerman, Curtis P. Langlotz Medical Computer Science Group Knowledge Systems Laboratory Departments of Medicine and Computer Science Stanford University Stanford, California 94305 ...	1986	122
387	Parallel Logical Inference and Energy Minimization Dana H. Ballard Computer Science Department The University of Rochester Rochester, NY 14627 Abstract The inference capabilities of humans suggest that they might be using algorithms with high degrees of parallelism. This ...	1986	123
388	A Unified Theory of Heuristic Evaluation Functions and its Application to Learning Jcns Christensen Computer Science Department, Stanford University, Stanford, Ca. 94305 Richard E. Korf Computer Science Department, University of California, Los Angclcs, Ca. 90024 ...	1986	124
389	INDEFINITE AND GCWA INFERENCE IN INDEFINITE DEDUCTIVE DATABASES Lawrence J. Henschen and Hyung-Sik Park Northwestern University Department of EECS Evanston, Illinois 60201 ABSTRACT This paper presents several basic results on compiling indefinite a...	1986	125
390	QUERY ANSUERING IN CIRCUBSCRIPTIVE AND CLOSED-YORLD TBEORIES Teodor C. Przymusinski Department of Mathematical Sciences University of Texas, El Paso, TX 79968 <ftOO@utep.bitnet> ABSTRACT. Among various approaches to hand1 ing incomplete and negative informa...	1986	126
391	LEARNING WHILE SEARCHING IN CONSTRAINT-SATISFACTION-PROBLEMS* Rina Dechter Artificial Intelligence Center Hughes Aircraft Company, Calabasas, CA 91302 and Cognitive Systems Laboratory, Computer Science Department University of California, Los Angeles, CA 90024 ABSTRACT The popular use of backtra...	1986	127
392	Joint and LPA * : COMBINATION OF APPROXIMATION AND SEARCH Daniel Ratner and Ira Pohl Computer & Information Sciences University of California Santa Cruz Santa Cruz, CA 95064 ABSTRACT This paper describes two new algorithms, Joint and LPA*, which can be used to...	1986	128
393	FINDING A SHORTEST SOLUTION FOR THE N xN EXTENSION OF THE H-PUZZLE IS INTRACTABLE Daniel Ratner and Manfred Warrnuth Computer & Information Sciences University of California Santa Cruz Santa Cruz, CA 95064 ABSTRACT The g-puzzle and the 15puzzle have been used for many years as a doma...	1986	129
394	A Knowledge-Based Framework for Design Sanjay Mittal and Agustin Araya Knowledge Systems Area Intelligent Systems Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Rd. Palo Alto, CA. 94304 Abstract: Many design problems can be formulated as a process of searching a “w...	1986	13
395	MAKING BEST USE OF AVAILABLE MEMORY WHEN SEARCHING GAME TREES Subir Bhattacharya and Amitava Bagchi Indian Institute of Management Calcutta P.O. Box.16757, Calcutta-700027, INDIA ABSTRACT When searching game trees, Algorithm SSS* examines fewer terminal nodes than the alphabiata procedure, but has ...	1986	130
396	AN ALGORITHMIC SOLUTION OF N-PERSON GAMES Carol A. Luckhardt and Keki B. Irani Electrical Engineering and Computer Science University of Michigan Ann Arbor, Michigan 48104 ABSTRACT function is a function which estimates what resulting value Two-per...	1986	131
397	CHOOSING DIRECTIONS FOR RULES Richard Treitel and Michael R. Genesereth* Logic Group, Knowledge Sytems Laboratory, Computer Science Dept., Stanford University ABSTRACT In “expert systems” and other applications of logic pro- gramming, the issue arises of whether to use rules for for- ...	1986	132
398	EDITORIAL COMPREHENSION IN QpEd THROUGH ARGUMENT UNITS* Sergio J. Alvarado Michael G. Dyer Margot Flowers Artificial Intelligence Laboratory Computer Science Department 353 1 Boelter Hall University of California Los Angeles, CA 90024 ABSTRACT This paper presents a theory of...	1986	133
399	Uniform Parsing and Inferencing for Learning* Charles E. Martin and Christopher I<. Riesbeck Yale University New Haven, CT 06520 Abstract In previous papers we have argued for the complete in- tegration of natural language understanding with the rest of the cognitive system. Gi...	1986	134

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.