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
700	Specialized Strategies: An Alternative to First Principles in Problem Solving* Nancy E. Reed, Elizabeth R. Stuck and James B. Moen Computer Science Department University of Minnesota Minneapolis, Minnesota 55455 Abstract We introduce specialized strategies,...	1988	101
701	Robust Operative Diagnosis as Problem Solving in a sthesis Space Kathy W. Abbott NASA Langley Research Center Hampton, Virginia 23665-5225 Abstract The lack of robustness in current diagnostic sys- tems is an important research issue because it has two major consequences: in...	1988	102
702	From: AAAI-88 Proceedings. Copyright ©1988, AAAI (www.aaai.org). All rights reserved. the command line, step 4b, which tells it to use a particular macro package for deciphering certain macro commands present in the text. The output of ‘troff’ is a ‘troff’ file, where the text has been completely replaced b...	1988	103
703	epresenting Genetic Information with ormal rammars David B. Searls Unisys Paoli Research Center P.O. Box 517, Paoli, PA 19301 Abstract Genetic information, as expressed in the four- letter code of the DNA of living organisms, represe...	1988	104
704	Overview of an pproach 4x3 Jeffrey Van Baalen and Randall Davis Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139 jvb@ht .ai.mit .edu Abstract It has long been acknowledged that having a good representation is key in ...	1988	105
705	Mechanisms for Reasoning about Sets Michael P. Wellman’ MIT Lab for Computer Science 545 Technology Square Cambridge, MA 02139 mpwQZermatt.LCS.MIT.EDU Abstract The SEt Reasoning Facility (SERF) integrates mechanisms for propagating membership propo- s...	1988	106
706	From: AAAI-88 Proceedings. Copyright ©1988, AAAI (www.aaai.org). All rights reserved. 2 The Circumscription of Existent ial Formulae Let 4(P) be a first-order or a second-order formula with equality, involving the sequence P = (Pi, . . . , Ph) of predi- cate symbols and p...	1988	107
707	A Circumscriptive Theorem Prover: Preliminary Report* Matthew L. Ginsberg Computer Science Department Stanford University Stanford, California 94305 Abstract We discuss the application of an assumption- based truth maintenance system to the construc- tio...	1988	108
708	Kurt Konolige Artificial Intelligence Center Center for the Study of Language and Information Abstract Nonmonotonic logics are meant to ization of nonmonotonic reasoning. the most part they fail to capture SRI International Ravenswood, Menlo Park, Ca. 94025 be a formal- However...	1988	109
709	REASONING ABOUT ACTION USING A POSSIBLE MODELS APPROACH Marianne Winslett Computer Science Department University of Illinois Urbana, IL 61801 Abstract. Ginsberg and Smith [6, 71 propose a new method for reasoning about action, which they term a possible worlds approach (P...	1988	11
710	On the Relationship Between Logic Programming and Non-monotonic Reasonin TeOdOP 6. Rsymll8inshi Department of Mathematics University of Texas El Paso, TX 79968 < ftOO0utepbitnet > Abstract In spite of the existence of a close relationship between logic programming and non-monotonic reas...	1988	110
711	On the Logic of Defaults Hector Geffner Cog;nit.iYe Systeills Lab. Dept. of Coil~I>~~t,er Science, UCLA L-4, CA 900% Abstract We present an alternative int’erpretation of de- faults which draws on probability theory and no- tions of relevance. The res...	1988	111
712	Compiling Circumscriptive Theories into Logic Programs: Preliminary Report* Michael Gelfond Department of Computer Science University of Texas at El Paso El Paso, TX 79968 Abstract We study the possibility of reducing some special cases of circumscription to logic ...	1988	112
713	On Reducing Parallel Circumscription Li Yan Yuan and Cheng Hui Wang The Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette, LA 70504 Abstract Three levels of circumscription have been pro- posed by McCathy to formalize common sense ...	1988	113
714	The Persistence of Derived Information Karen L. Myers David E. Smith Department of Computer Science St anford University Stanford, California 94305 Abstract Work on the problem of reasoning about change has focussed on the persistence of nonderived in- formation, ...	1988	114
715	.-_ Representing and Computing Temporally Scoped Beliefs * Steve Hanks Department of Computer Science,Yale University Box 2158 Yale Station New Haven, CT 06520 Abstract Planning effective courses of action requires mak- ing predictions about what the world may be li...	1988	115
716	Stable Closures, Defeasible Logic and Contradiction Tolerant Reasoning* Paul Morris IntelliCorp 1975 El Camino Real West Mountain View, CA 94040 Abstract A solution to the Yale shooting problem has been previously proposed that uses so-called non-normal def...	1988	116
717	Satisfying First-Order Constraints About Time Intervals Peter B. Ladkin Kestrel Institute 1801 Page Mill Road Palo Alto, Ca 94304-1216 Abstract James Allen defined a calculus of time intervals in [A1183], as a representation of temporal knowledge that could be used in AI. We shall call thi...	1988	117
718	Why Things Go Wrong: A Formal Theory of Causal Reasoning Leora Morgenstern and Lynn Andrea Stein Department of Computer Science Brown University Box 1910, Providence, RI 02912 Abstract This paper presents a theory of generalized tem- poral reasoning. We focus on the...	1988	118
719	Probabilistic Tern Thomas Dean* and Keiji Kanazawa Department of Computer Science Brown University Box 1910, Providence, RI 02912 Abstract Reasoning about change requires predicting how long a proposition, having become true, will con- tinue to be so. Lacking perfect know...	1988	119
720	A Theory of Debugging Plans and Interpretations Reid G. Simmons MIT Artificial Intelligence Laboratory 545 Technology Square Cambridge, MA 02139 REID@OZ.AI.MIT.EDU Abstract We present a theory of debugging applicable for planning and interpretation problems. ...	1988	12
721	The Utility of Difference-Based Reasoning Brian Falkenhainer Qualitative Reasoning Group Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue, Urbana, Illinois 61801 Abstract The traditional approach to proble...	1988	120
722	Learning from Opportunities: Storing and Re-using Execution-Time Bptimizations* Kristian Hammond, Tim Converse and Mitchell Marks Department of Computer Science University of Chicago 1100 East 58th Street Chicago, IL 60637 Abstract In earlier work (Hammond 1986), we...	1988	121
723	Subratx3 oy and Jack ostow Rutgers University Computer Science Department New Brunswick, NJ 08903, USA ARPAnet address: suroy@paul.rutgers.edu, Mostow@aramis.rutgers.edu Abstract The grain size of rules acquired by explanation- based learning may vary widel...	1988	122
724	Simulation-Assisted Inductive Learning* Bruce G. Buchanan, John Sullivan, and Tze-Pin Cheng Knowledge Systems Laboratory Stanford University Stanford, California 94305 Abstract Learning by induction can require a large number of training examples. We show the pow...	1988	123
725	The Automatic Acquisition of Proof Methods* Kurt Ammon Fibigerstr. 163, D-2000 Hamburg 62 Federal Republic of Germany Abstract The SHUNYATA program constructs proof methods by analyzing proofs of simple theorems in mathemati- cal theories such as grou...	1988	124
726	Explanation-Based Indexing of Cases Ralph Barletta and William Mark Lockheed AI Center 2710 Sand Hill Rd. Menlo Park, CA 94025 (415) 354-5226 Mark@VAXA.ISI.EDU Abstract Proper indexing of cases is critically important to the functioning of a case-based r...	1988	125
727	Knowledge- eduction: A New A oath to Checking Knowledge Bases for Inconsistency Redundancy Allen Ginsberg Knowledge Systems Research Department AT&T Bell Laboratories Holmdel, NJ 07733 Abstract This paper presents a new approach, called knowledge-base reduction, to ...	1988	126
728	Theory Revision via Prior Operationalization Allen Ginsberg Knowledge Systems Research Department AT&T Bell Laboratories Holmdel, NJ 07733 Abstract Research in machine learning often focuses either on inductive learning - learning from experience with minimal ...	1988	127
729	Quantitative Results Concerning the Utility of Explanation-Based Learning Steven Minton Computer Science Department1 Carnegie-Mellon University Pittsburgh, PA 15213 Abstract Although P revious research has demonstrated that EBL is a viab e approach for acquiring ...	1988	128
730	Thomas Ellman Department of Computer Science Columbia University New York, New York 10027 ellman@cs.columbia.edu Abstract1 Existing machine learning techniques have only limited capabilities of handling computationally intractable domains. This research extends e...	1988	129
731	Plan Abstraction Based on Operator Generalization John S. Anderson Arthur M. Farley Department of Computer and Information Science University of Oregon Eugene, OR 97403 Abstract We describe a planning system which automatically creates abstract operators while organizing a give...	1988	13
732	vercoming Hntr ctability in Err ased Learning* Michael S. Braverman Stuart J. Russell 573 Evans Hall Computer Science Division University of California at Berkeley Berkeley, CA 94720 Abstract Compiled knowledge, which allows macro inference steps through an explanation space, can ...	1988	130
733	al Learning Theory Jonathan Amsterdam* MIT Laboratory for Artificial Intelligence Cambridge, MA 02139 Abstract Recent work in formal learning theory has at- tempted to capture the essentials of the concept- learning task in a formal framework. This...	1988	131
734	Creiit Assignment in Genetic Learning Syste John J. Grefenstette Navy Center for Applied Research in Artificial Intelligence Naval Research Laboratory Washington, DC 203755000, U.S.A. Abstract Credit assignment problems arise when long sequences of rules fire between succ...	1988	132
735	Perceptron Trees: A Case Study in ybrid Concept epresentations Paul E. Utgoff Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 Abstract The paper presents a case study in examining the bias of two particular forma...	1988	133
736	ayesian Classification* Peter Cheeseman Matthew Self, Jim Kelly, John Stutz RIACS Will Taylor, Don Freeman NASA Sterling Software NASA Ames Research Center Mail Stop 244-17 Moffett Field, CA 94035 Abstract This paper describes a Bayesian technique for un- supervised classifi...	1988	134
737	CARLO BERZUINI Dipartimento di Informatica e Sistemistica. Universita di Pavia. Via Abbiategrasso 209. 27100 PAVIA (ITALY) Abstract This paper discusses relationships between sta- tistical modelin ing from exam K f techniques and symbolic ...	1988	135
738	Recovery from Incorrect Knowledge in Soar* John Laid Artificial Intelligence Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor, MI 48109-2122 Abstract Incorrect knowledge can be a problem for any in- telligent system....	1988	136
739	Inferring Probabilistic Theories from Edwin P.D. Peduault Knowledge Systems Research Department AT&T Bell Laboratories Holmdel, NJ 07733 ABSTRACT When formulating a theory based on observations influenced by noise or other sources of uncertainty, it becomes necessar...	1988	137
740	Functionality in Neurd Nets* L.G. Valiant Aiken Computation Laboratory Harvard University Cambridge, MA 02138 Abstract We investigate the functional capabilities of sparse networks of computing elements in accu- mulating knowledge through successive learning experiences ....	1988	138
741	Learning Complicated Concepts eliably and Usefully (Extended Abst Ronalld L. ivest* and Robert Sl[sant MIT Lab. for Computer Science Cambridge, Mass. 02139 USA Abstract We show how to learn from examples (Valiant style) any concept representable as a boolean function or c...	1988	139
742	Geometric easoning an rganized timizatisn for Automated Process Planning Yasuyuki Maeda and Katsuya Shiuohara C&C Systems Research Laboratories NEC Corporation l-1, Miyazaki &chome, Miyamae-ku, Kawasaki, Kanagawa 213, JAPAN Abstract In order to ...	1988	14
743	Tree-Structured Stuart J. RusscAl Computer Science Division University of California Berkeley, CA 94720 Abstract This paper reports on recent progress in the study of autonomous concept learning systems. In such systems, the initial space of hypotheses is cons...	1988	140
744	Knowledge Base Refinement Using Apprenticeship Learning Techniques David C. Wilkins Department of Computer Science University of Illinois Urbana, IL 61801 Abstract This paper describes how apprenticeship learning tech- niques can be used to refine the knowledge base of an ex- p...	1988	141
745	epresenting Pronouns in Logical Form: Computational Constraints and Linguistic Evidence Abstract In this paper, we discuss the representation of pronouns in logical form for the purpose of han- dling verb phrase ellipsis. In particular, we dis- cuss t...	1988	142
746	Principle-based interpretation of natural language quantifiers Samuel S. Epstein Bell Communications Research 445 South Street, 2Q-350 Morristown, NJ 07960-1910 Abstract This paper describes a working prototype that determines possible relative quantifier s...	1988	143
747	Center for Machine Translation Carnegie Mellon University Pittsburgh, PA 15213 Abstract Real-time understanding of speech input is diffi- cult especially because the input is often noisy and elliptic. Multiple morphophonemic and lex- ical hypotheses generated for a single input sen- ...	1988	144
748	Using Dialog-Level owledge Sources to I ecognith Alexander G. Hauptmann, Sheryl W. Young and Wayne I-I. Ward Computer Science Department, Carnegie Mellon University Pittsburgh, PA 15213 Abstract We motivate and describe an implementation of the MINDS* speech recognition s...	1988	145
749	Renato DE MORI, Yoshua BENGIO and R6gis CARDIN Centre de Recherche en Hnformatique de Mont&al (CRIMJ School of Computer Science, McGill University 805 Sherbrooke Street West, MONT&AL, QUl%EC, CANADA H3A 2K6 A set of Multi-Layered Networks (MLN) for Automatic Speech Recognition (ASR) is ...	1988	146
750	Acquiring Lexical Knowledge from Text: A Case Study Paull Jacobs and Uri Zernik Artificial Intelligence Program GE Research and Development Center Schenectady, NY 12301 USA Abstract Language acquisition addresses two important text processing issues. The immediate problem is understa...	1988	147
751	The Interpretation of Temporal Rdations in Narrative Fei Song and Robin Cohen Logic Programming and Artificial Intelligence Group Dept. of Computer Science, Univ. of Waterloo Waterloo, Ontario, Canada, N2L 3Gl Abstract This paper describes an algorithm ...	1988	148
752	Beyond Semantic Ambiguity1 Galina Datskovsky Moerdler and Kathleen R. McMeown Columbia University Department of Computer Science New York, N.Y. lQO27. Abstract: An advice giving system, such as an expert system gathers information from a user in order to provide advice. In this type of dialog...	1988	149
753	Prevention Techniques for a Temporal Planner* Abstract Research in domain independent John C. Mogge Artificial Intelligence Laboratory Texas Instruments P.O. Box 655474 MS 238 Dallas, Texas 75265 planning has Table 1: Seven Possible Values of Interval Re...	1988	15
754	Exploiting User Expertise in Answer Expression* David N. Chin Department of Information and Computer Sciences University of Hawaii at Manoa 2565 The Mall Honolulu, HI 96822 Abstract Previous natural language help systems have not taken into account the user’s knowledge when formulating ...	1988	150
755	An Analysis of Time-Dependent Planning Thomas Dean* and Mark Boddy Department of Computer Science Brown University Box 1910, Providence, RI 02912 Abstract This paper presents a framework for exploring issues in time-dependent planning: planning in whi...	1988	16
756	Extending Conventional Planning Techniques to le Actions wit cts Edwin P.D. Pednault Knowledge Systems Research Department AT&T Bell Laboratories Wolmdel, NJ 07733 ABSTRACT This paper presents a method of solving plan- ning problems that involve actions who...	1988	17
757	Goals as Parallel Program Specifications* Leslie Pack Kaelbling Artificial Intelligence Center SRI International and Center for the Study of Language and Information St anford University Abstract Classical planning is inappropriate for generating actions in a dynamic world. Thi...	1988	18
758	Predictability Versus Responsiveness: Coordinating roblem Solvers in ynamic omains Edmund H. Durfee and Victor R. Lesser Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts, 01003 Abstract Coordination ...	1988	19
759	Goal-Directed Equation Solving” Nachum Dershowita and G. Sivakumar Department of Computer Science University of Illinois at Urbana-Champaign 1304, W. Springfield Ave. Urbana, Illinois 61801, . U.S.A. Abstract Solving equations in equational Horn-clause theories is a progr...	1988	2
760	Intelligent Real-Time Monitoring* T. Laffey, S. Weitzenkamp, J. Read, S. Kao, J. Schmidt Lockheed Artificial Intelligence Center 2710 Sand Hill Road Menlo Park, CA 94025 (4X)-354-5208 Abstract This paper describes a multi-tasking architecture for performing re...	1988	20
761	eaetive Plan Peng Si Ow, Stephen F. Smith, Alfred Thiriez versity 213 Ah3 tract In this paper, we describe a methodology for reactively revising schedules in response to unexpected events. The approach is based on recognition of constraint conflicts in the existing schedule. Alternative ...	1988	21
762	Integsat ing Planning, Execution and Monitoring* Jo& A, Ambros-Engerson Dept. of Info. and Computer Science University of California Irvine, CA 92717 jambros@ics.uci.edu Abstract IPEM, for Integrated Planning, Execution and Monitoring, provides a simple, clear and well defined ...	1988	22
763	easoning Under Varying and U esource Constraints* Eric J. Horvitz Medical Computer Science Group Knowledge Systems Laboratory Stanford University Stanford, California 94305 Abstract We describe the use of decision-theory to opti- mize the value of computation ...	1988	23
764	From: AAAI-88 Proceedings. Copyright ©1988, AAAI (www.aaai.org). All rights reserved. FMUFL also provides a mechanism, called a semantic relationship, which can be used to ease the burden ofdefin- ing fuzzy sets. If a fuzzy set, be it an I-type set or a finite set, has been explicitly defined to...	1988	24
765	A Rearrangement Search Strategy for Determining Propositional Satisfiability Ramin Zabih Computer Science Department Stanford University Abstract We present a simple algorithm for determining the satisfiability of propositional formulas in Con- junctive ...	1988	25
766	Parallel Best-First Search of State-Space Graphs: A Summary of Results * Vi+ I$umari K. Ramesh, and V. Nageshwara Rae Artificial Intelligence Laboratory Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 Abstract This pa...	1988	26
767	Distributed Tree Searc and its Application to Alpha-Beta Pruning* Chris Ferguson and Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract We propose a parallel tree search algorithm based on the idea of tree-...	1988	27
768	Some Experiments With Case-based Search”’ Steven Bradtke and Wendy G. Lehnert Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 Abstract and multiple solutions are typically generated with an as- sessment of the...	1988	28
769	Real-Time Heuristic Search: New Results* Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract We present new results from applying the as- sumptions of two-player game searches, namely limited search horizon and commi...	1988	29
770	A General Proof Method for Modal Predicate Logic without the Barcan Formula.* Peter Jackson McDonnell Douglas Research Laboratories Dept. 225, P.Q. Box 516, St Louis, MO 63166, USA. Abstract. We present a general proof method for normal systems of modal predicate logic with identical inference r...	1988	3
771	ADstract : The constrained Rectangular Guillotine Knapsack Problem (CRGKP) is a variant of the two-dimensional cutting stock problem. In the CRGKP, a stock rec- tangle of dimensions (L,W) is given. There are n different ty es of demanded rectangles, with the i eh ...	1988	30
772	Rina Dechter Judea Pearl T-PROCESSING * Cognitive System Labcbratory, Computer Science Department University of California, Los Angeles, CA 90024 Net address: dechter@csmla.edu Net address: judea@cs.ucla.edu ABSTRACT The paper offers a systematic way of regrouping con- straints into hierar...	1988	31
773	An Efficient ATMS for Equivalence Relations* Caroline N. Koff Nicholas S. Flann and Thomas G. Dietterich Software Development Environments Hewlett-Packard 3404 East Harmony Road Fort Collins, CO 80525 Abstract We introduce a specialized ATMS for efficiently computing e...	1988	32
774	A GENERAL LA M FOR ASSUM ENANCE Johan de Kleer Xerox Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto CA 94304 Abstract Assumption-based truth maintenance svstems have become a powerful and widely used to”ol in Artifi- cial Intelliaence Droblem solvers. The basi...	1988	33
775	Focusing the ATMS Kenneth II. Forbus Qualitative Reasoning Group, University of Illinois 1304 W. Springfield Avenue, Urbana, Illinois, 61801 Johan de Kleer Xerox Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto CA 94304 Abstract Many problems h...	1988	34
776	assively ss as Michael Dixon* Johan de IUeer Xerox PARC Computer Science Dept. Xerox PARC 3333 Coyote Hill Rd. Stanford University Palo Alto, CA 94304 3333 Coyote Hill Rd. Palo Alto, CA 94305 Palo Alto, CA 94304 Abstract De Kleer’s Assumption-based Truth Maintenance ...	1988	35
777	BELIEF MAINTENANCE: AN I TAPNTY MANAGEMENT Kathryn B. Laskey and Decision Science Consortium, Inc. 1895 Preston White Drive Reston, Virginia 22091 Abstract Belief maintenance represents a unified approach to assumption-based and numerical uncertainty management. A formal ...	1988	36
778	A Note on Probabilistic Logic by Dr. Mary McLeish Departments of Computing Science and Mathematics University of Guelph Guelph, Ontario, Canada NlG 2Wl Abstract This paper answers a question posed by Nils Nilsson in his paper [9] on Probabilistic Logic: When is the max- imum...	1988	37
779	Debra Zarley, Yen-T& Msia and Glenn Shafer School of Business, University of Kansas Lawrence, Kansas The Dempster-Shafer theory of belief functions [Shafer 19761 is an intuitively appealing formalism for reasoning under uncertainty. Several AI implementations have been undertak...	1988	38
780	The Challenge of Real-time Process Control for Productio Franz Barachini, Norbert Theuretzbacher ALCATEL Austria - ELIN Research Center Floridusgasse 50 A- 12 10 Vienna, Austria Abstract Although the technology of expert systems has been developed substantially during the pa...	1988	39
781	Tableau-Based Theorem Proving in Normal Conditional Logics Chris Groeneboer James P. Delgrande School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A lS6 ABSTRACT This paper presents an extension of the semantic tableaux approach to theorem proving for the class...	1988	4
782	Suitability of Message Passing Computers for Implementing rsductiord Systems Anoop Gupta Dept. of Computer Science Stanford University Stanford, CA 94305 Abstract Two important parallel architecture types are the shared-memory architectures and the message-passing architectures. In t...	1988	40
783	Comparison of the Rete an Matchers for Soar (A Summary)* Pandurang Nayak Anoop Gupta Knowledge Systems Lab. Computer Systems Lab. Stanford Univ. Stanford Univ. Stanford, CA 94305 Stanford, CA 94305 au1 Information Sciences Inst. Univ. of Southern California Marina de1 ...	1988	41
784	timizing Rules in Production System Programs Toru Ishida NTT Communications and Information Processing Laboratories l-2356, Take, Yokosuka-shi, 238-03, Japan Abstract Recently developed production systems enable users to specify an appropriate ordering ...	1988	42
785	Learning a Second Language* Steven L. Lytinen and Carol E. Moon Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor, MI 48109 Abstract We present a system, called IMMIGRANT, which learns rules about the grammar of a second lan- guage from instruct...	1988	43
786	thieal nderstandin ief Conflict in John F. Reeves* Artificial Intelligence Laboratory Computer Science Department University of California, Los Angeles, CA 90024 Abstract Belief conflict patterns (BCPs) are knowledge structures representing the understander’s moral ...	1988	44
787	A Computational Account of Basic Level and Typicality Effects Douglas H. Fisher Department of Computer Science Box 67, Station B Vanderbilt University Nashville, I’N 37235 Abstract Cognitive psychology has uncovered two effects that have altered traditional views of human classification...	1988	45
788	Resolving Goal Conflicts via Negotiation1 Katia Sycara The Robotics Institute, Carnegie Mellon University Pittsburgh, PA 15213 Abstract In non-cooperative multi-agent planning, resolution of multiple conflicting goals is the result of finding compromise solutions. Previous research has ...	1988	46
789	Evaluating Explanations* David B. Leake Department of Computer Science, Yale University P.O. Box 2158 Yale Station, New Haven, CT 06520 Abstract Explanation-based learning (EBL) is a powerful method for category formation. However, EBL systems are only effective if they start with good exp...	1988	47
790	Reasoning about E-vi ence in Causal Expllanations Abstract Phyllis Koton* MIT Lab for Computer Science 545 Technology Square Cambridge, MA 02139 elanQOZ.AI.MIT.EDU Causal models can provide richly-detailed knowl- edge bases for producing explanations about be- ...	1988	48
791	Waiting on Weighting: olic Least Commitment Approach’ Kevin D. Ashley and Edwina L. Rissland Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 Abstract In this paper we describe an approach to the ...	1988	49
792	Integrating Multiple Sources of Knowledge into Designer-Soar, an Automatic Algorithm Desi David Steier and Allen Newell Department of Computer Science Carnegie Mellon University Pittsburgh, PA 15213-3890 Abstract 2. The Need for Knowledge Integration in Algorithm Designing algorithms requi...	1988	5
793	Facilitating Self-Education by Questioning Assumptive Reasoning Robert Farrell Yale University Department of Computer Science Box 2158 Yale Station New Haven, CT 06520-2158 Abstract Making assumptions limits the depth of inference chains and reduces the potential for complex in...	1988	50
794	Towards A Virtual Parakll Inference Engine Howard E. Shrobe, John G. Aspinall and Neil L. Mayle Symbolics Cambridge Research Center 11 Cambridge Center, Cambridge, MA 02142 Howard Shrobe is also a Principal Research Scientist at the MIT Artificial Intelligence Laboratory....	1988	51
795	versus Specificity: an Experience with AI and Pascal Van Hentenryck ECRC Arabellastr. 17, 8000 Muenchen (F.R.G) Abstract This paper contains an in-depth study of a par- ticular problem in order to evaluate several ap- proaches to the solving of dis...	1988	52
796	Knowledge43ased Real-Time ContrOll: A Parallel Processing Perspective D. D. Sharma and N. S. Sridharan FMC Corporation Artificial Intelligence Center 1205 Coleman Avenue, Box 580, Santa Clara, CA 95052 Abstract Knowledge-based real-time control problems can be usefully viewed a...	1988	53
797	Daniel Il. CorkilP and Kevin $. Gdlagher Department of Computer and Information Science University of Massachusetts Abstract The run-time performance of a blackboard-based application can be significantly improved by se- lecting an appropriate blackboard da...	1988	54
798	sentatisn for ving L.V. Kal& Department of Computer Science, University of Illinois 1304 W. Springfield Ave., Urbana, IL-fil$Ol Abstract A tree-representation for problem-solving suit- ed for parallel processing is proposed. We give a formal definition of REDUCE-OR trees and il...	1988	55
799	Parallel Hardware for Constraint Satisfaction Michael J. Swain & Paul R. Cooper Department of Computer Science University of Rochester Rochester, NY 14627 Abstract A parallel implementation of constraint satisfac- tion by arc consistency is presented. The im- plementation is co...	1988	56

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.