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
600	TEST: A MODEL-DRIVEN APPLICATION SHELL Gary S. Kahn, Al Kepner, and Jeff Pepper Carnegie Group Inc. Pittsburgh, Pa. 15219 Abstract TEST (Troubleshooting Expert System. Tool) is an application shell that provides a domain-Independent diagnostic problem solver to ether with a library o...	1987	146
601	Scripf-Based easoning For Situatio Sharon J. Laskowski and Emily J. Hofmann The MITRE Corporation C31 Artificial Intelligence Center 7525 Colshire Drive McLean, Virginia 22102-3481 Abstract An expert system that monitors complex activity requires knowledge tha...	1987	147
602	Assessing the Maintainability of XCQN-in-RIME: Coping with the Problems of a VERY Large Rule-Base Elliot Sollow ay Department of Computer Science Yale University New Haven, Connecticut 06520 Abstract XCON is a rule-based expert system that configures computer ...	1987	148
603	huis I. stein AI/VLSI Project Computer Science Department Rutgers University New Brunswick, NJ 08903 Abstract Underlying any system that does design is a model of the design process and a division of labor between the system and the user. We are just beginning to un- derstand what th...	1987	149
604	David Servan-Schreiber Robotics Institute Carnegie Mellon University and Western Psychiatric Institute and Clinic Pittsburgh, PA 15213 Abstract Building on the successes and shortcomings of previous experiences with computerized psychotherapy, we have attempted to extend the paradigm of in...	1987	15
605	rehminary Raymond Reiterl Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S-lA4 Johan de Kleer Intelligent Systems Laboratory XEROX Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, California 94304 ABSTR...	1987	16
606	RECIGGNING IN THE PRESENCE OF INCONSISTENCY Fangzhen tin Department of Computer Science Hua Chiaa University, Fujing, P-R-China ABSTRCaCT In this paper, we propose a logic which is nontrivial in the presence of inconsistency. The logic is based on the resolution princi...	1987	17
607	V. Nageshwara Rao, Vipin Kumar and K. Ramesh Artiticial Intelligence Laboratory Computer Science Department University of Texas at Austin Austin, Texas 787 12. ABSTRACT This paper presents a parallel version of the Iterative-Deepening-A* (IDA*) algorithm. Iterative-...	1987	18
608	Mathematical Institute, Oxford University Oxford, England OX1 3LB s&ract Multiple possible solutions can arise in many domains, such as scene interpretation and speech recognition. This paper examines the eficiency of multiple- context TM%, such as the ATMS, i...	1987	19
609	CCLISPm on the IPSC” Concurrent Computer David Billstrom and Joseph Brandenburg Intel Scientific Computers Beaverton, Oregon, 97006 USA Abstract Concurrent Common LISPTM (CCLISP) is the LISP environment for the iPSCm system, the Intel Personal SuperComputer. CCLISP adds m...	1987	2
610	Revised D ected Backtracking Charles J. Petrie, Jr. Microelectronics and Computer Technology Corporation 3500 West Balcones Center Drive Austin, TX 78759 Abstract Default reasoning is a useful inference technique which involves choosing a single context in whi...	1987	20
611	Path Dissolution: A Strongly Complete Neil V. Murray Dept. of Computer Science State Univ. of N.Y. at Albany Albany, NY 12222 1. Introduction We introduce path dissolution, a rule of inference that operates on quantifier-free predicate calculus formulas in negati...	1987	21
612	The Deductive Synthesis of Imperative LISP Programs Zohar Manna Stanford University Stanford, California Abstract A framework is described for the automatic synthesis of imperative programs, which may alter data structures and produce destructive side effects as part of their in- ten...	1987	22
613	Robert D. McCartney Department of Computer Science Brown University Providence, Rhode Island 02912 Abstract This paper describes MEDUSA, an experimental al- gorithm synthesizer. MEDUSA is characterized by its top-down approach, its use of cost-constraints, and its restric...	1987	23
614	A New Structural Induction Scheme for Proving Properties of Mutually Recursive Concepts Peiya Liu Siemens Research and Technology Laboratories 105 College Road East Princeton, NJ 08640 Te1:609-7343349 ABSTRACT Structural induction schemes have been used ...	1987	24
615	A Model of Two-Player Evaluation Functions1 Bruce Abramson and Richard E. Kor@ Abstract We present a model of heuristic evaluation functions for two-player games. The basis of the proposal is that an estimate of the expected-outcome of a game situation, assuming random play from t...	1987	25
616	Real-Time Heuristic Search: First Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract Existing heuristic search algorithms are not ap- plicable to real-time applications because they can- not commit to a move before an ...	1987	26
617	Van E. Kelly Uwe Nonnenmann AT & ‘I’ Bell Laboratories 600 Mountain Ave. 3D-418 Murray Hill, New Jersey 07974 ABSTRACT The WATSON automatic programming system computes formal behavior specifications for process- control software from informal “scenarios”: traces ...	1987	27
618	On the Expressiveness of Rule-based Systems for Reasoning with Uncertainty David E. Heckerman and Eric J. Horvitz Medical Computer Science Group Knowledge Systems Laboratory Stanford University Stanford, California 94305 Abstract We demonstrate that classes ...	1987	28
619	Filming a Terrain under Uncertainty Using Temporal and Probabilistic easoning Raymond D. Gumb Department of Computer Science University of Lowell Lowell, Massachusetts Abstract We address the problem of interpreting sensor data under uncertainty...	1987	29
620	A Parallel Resolution Procedure Based on Connection Graph P. Daniel Cheng J. Y. Juang Advanced Information Services Inc. 1512 Candletree Dr. Peoria, IL 61614 Dept. of Electrical Engineering & Computer Science Northwestern University Evanston, IL 60...	1987	3
621	Computational Costs versus enefit s of Control Reasoning1 Alan Garvey, Craig Cornelius, and Barbara Hayes-Roth Knowledge Systems Laboratory Stanford University ‘This research was supported by the following grants: NIH Grant RR-00785; NIH Grant RR-00711; Boeing Grant W266875; NA...	1987	30
622	edundancies i s’ Avi Dechter Department of Management Science California State University, Northridge, CA 9 1330 and Cognitive Systems Laboratory Computer Science Department University of California, Los Angeles, CA 90024 The removal of inconsistencies from the problem’s representation, ...	1987	31
623	Comparing Minimax and Product in a Variety of Ping-Ching @hi1 and Dana S. NaU2 University of Maryland Collge Park, Md 20742 Abstract This paper describes comparisons of the minimax back- up rule and the product back-up rule on a wide variety of games, inclu...	1987	32
624	LIFIA, BP 68, 38402 St Martin d’Hbres Cedex, France Telex: USMG 980 134F Abstract A method is presented to express and use syn- tactic analogies between proofs in interactive thee- rem proving and proof checking. Up to now, very few papers have addressed instances of this pro- blem. The paradigm of...	1987	33
625	easoning About Exce Carol A. &overman and W. Bruce Croft Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 Abstract In a cooperative problem-solving environment; such as an office, a hierarchical p...	1987	34
626	Incremental Causal Thomas Dean and Mark Boddyl Department of Computer Science Brown University Providence, RI 02912 Abstract Causal reasoning comprises a large portion of the in- ference performed by automatic planners. In this pa- per, we consider a class of inference syste...	1987	35
627	An Investigation into Reactive Planning in Complex Domains R. James Firby Department of Computer Science P.O. Box 2158 Yale Station, New Haven CT 06520 Abstract A model of purely reactive planning is proposed based on the concept of reactive action packa...	1987	36
628	ON STRATIFIED AUTOEPISTEMIC THEORIES Michael Gelfond Computer Science Department The University of Texas at El Paso El Paso, TX 79968 Abstract In this paper we investigate some properties of "autoepistemic logic" approach to the formalization of common sense reasoning suggested by R. Moore...	1987	37
629	cation Probkm Matthew L. Ginsberg and Davidl E. Smith1 The Logic Group Computer Science Department St anford University Stanford, California 94305 Abstract In this paper, we propose a solution to McCarthy’s qualification problem [lo] based on the notion of pos- sible worlds [3,...	1987	38
630	Simple Causal Minimizations for Temporal Persistence and Projection Brian A. Haugh Martin Marietta Laboratories 1450 South Rolling Road Baltimore, Maryland 21227 Abstract Formalizing temporal persistence and solving the temporal projection problem within traditional non-monoton...	1987	39
631	Achieving Flexibility, Efficiency, and Generality in Blackboard Architectures Daniel D. Corkill, Kevin Q. Gallagher, and Philip M. Johnson Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003 Abstract Achie...	1987	4
632	Caroline Hayes Robotics Institute, Carnegie Mellon University Pittsburgh, Pa. Abstract producing the part. The Machinisf program extends domain dependent planning technology. It is modeled after the behavior of human machinists, and makes plans *for fabricating metal parts using m...	1987	40
633	Compiling Plan Operators from Domains Expressed in Qualitative recess Theory John C. Mogge Qualitative Reasoning Group Department of Computer Science University of Illinois at Urbana-Champaign Abstract The study of Qualitative Physics has concentrated on ex...	1987	41
634	Models of Axioms for Time Intervals Peter Ladkin Kestrel Institute 1801 Page Mill Road Palo Alto, Ca 94304-1216 Abstract James Allen and Pat Hayes have considered axioms ex- pressed in first-order logic for relations between time in- tervals [AllHay85, AllHay87.1, AllHay87.2...	1987	42
635	Localized epresent at ion and Planni g Methods for Parallel Domains Amy L. Lansky* David S. Fogelsong** Abstract The primary goal of this paper is to examine the role that locality plays in domain representation and reasoning. In par- ticular, we focus on three uses of...	1987	43
636	A Model for Concurrent Actions having Temporal Extent Richard N. Pelavin Philips Laboratories North American Phili s Cor oration Briarcliff Manor, RLY. 18510 James F. Allen Corn 8 uter Science De K artment niversity of Rot ester Rochester, N.Y. 14607 ...	1987	44
637	THE CONSISTENT LABELING PROBLEM IN TEMp0RA.L REASONING Edward P K TSANG Department of Computer Science University of Essex Colchester CG4 3SQ. U K ABSTRACT Temporal reasoning can be perfn-med by maintaining a temporal relation n&work, a complete network in which the nodes are time inter...	1987	45
638	Ratil E. Valdks-Pkrez Computer Science Department Carnegie-Mellon University Pittsburgh PA 15213 Abstract A popular representation of events and their relative alignment in time is James Allen’s intervals and algebra. Networks of disjunctive interval constraints have served bot...	1987	46
639	Validating Generalized Hans in the Presence of Incomplete Information Marianne Winslett* Computer Science Dept., Stanford University Stanford, CA 94305 Abstract. Let Robbie be an agent possessing a gen- eralized plan for accomplishing a goal. Can Robbie use his plan to accom...	1987	47
640	Rules for the Implicit Acquisition of Knowledge About the User Robert Kass and Tim Finin Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 191046389 Abstract A major problem with incorporating a user model into an application has been the difficulty of acqui...	1987	48
641	Case-Based Problem Solving wit Knowledge ase of Learned Cases Wendy G. Lehnert Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 Abstract Recent experiments indicate that a case-based approach to the problem of word pron...	1987	49
642	aining Logic Progra the ATMS1 Nicholas S. Flam, Thsrnas 6. iettdch and Department of Computer Science Oregon State University Corvallis, Oregon 97331 Abstract Two powerful reasoning tools have recently appeared, logic programming and assumption-based truth main- tenance syst...	1987	5
643	MATERIAL I-IANDEING: A CONSERVATIVE N FOR NEURAL CONNECTIVITY AND PROIFPAGATION H. Van Dyke I?arunalc, James Kindrick, Bruce Irish Industrial Technology Institute P.O. Box 1485 Ann Arbor, MI 48106 (313) 769-4800 Abstract: Two important components of connectionist mo...	1987	50
644	AQUA: Asking uestisns and Understan nswers Ashwin Ram Yale University Department of Computer Science New Haven, CT 06520-2158 Abstract Story understanding programs are often designed to answer questions to demonstrate that they have ad- equately understood a story (e.g., [Le...	1987	51
645	I Infcwmation Lisa F. Rau Artificial Intelligence Branch GE Company, Corporate R&D Schenectady, NY 12301 USA Abstract The System for Conceptual Information Summariza- tion, Organization, and Retrieval (SCISOR) is a re- search system that consists of a set of programs ...	1987	52
646	Analogical Processing: A Simulation ad Empirical Corroboration’ Janice Skorstad Brian Falkenhainer Qualitative Reasoning Group Qualitative Reasoning Group Department of Computer Science Department of Computer Science Dedre Gentner Department of ...	1987	53
647	Ingrid Zukerman Computer Science Department, Monash University, Clayton, Victoria 3 168 9 AUSTRALIA Abstract In a tutorial setting, we often hear expressions such as “The method we are about to discuss will help you solve . . . ” or “Let us consider a subject which demands some mo...	1987	54
648	Pengi: lementation of a Theory of Activity Philip E. Agre and David Chapman MIT Artificial Intelligence Laboratory 545 Technology Square Cambridge, MA 02139 Abstract AI has generally interpreted the organized nature of everyday activity in terms of plan-following. ...	1987	55
649	Compare and Contrast, A Test of Ex Kevin II. Ashley and Edwina L. Rissland2 Department of Computer and Information Science University of Massachusetts Amherst, MA 01003 Abstract In this paper we present three key elements of case-based reasoning (“CBR”) and describe how t...	1987	56
650	Dana H. Ballard Department of Computer Science University of Rochester, Rochester, New York 14627 Abstract In the development of large-scale knowledge networks, much recent progress has been inspired by connections to neurobiology. An important component of any “‘neural” network is an accompanyi...	1987	57
651	Reducing Indeterminism in Consultation: A Cognitive Model of User/librarian Interactions Hsinchun Chen and Vasant Dhar Department of Information Systems New York University Abstract In information facilities such as libraries, finding documents that are relevant to a user...	1987	58
652	A Mechanism for Early iagetian Learning Gary L. Drescher Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, Ma 02139 Abstract I propose a mechanism to model aspects of Piage- tian development, in infants. The mechanism com- bines a powerful e...	1987	59
653	Integrating Diverse Reasoning ethods in the BBP Blackboard Control Architecture1 M. Vaughan Johnson Jr. and Barbara Hayes-Roth Knowledge Systems Laboratory * Stanford University Abstract The BBl blackboard control architecture has been proposed to enable systems to integrate diverse ...	1987	6
654	Incrementa Getting Multiple Agents to Gary C. Borchardt Jet Propulsion Laboratory California Institute of Technology Pasadena, CA 91109 Abstract This paper presents a symbolic reasoning algorithm for use in the construction of mixed-initiative inter&aces; that is, interfaces allowing several ...	1987	60
655	An Approach to Default Reasoning Based on a First-Order Conditional Logic James P. Delgrande School of Computing Science, Simon Fraser University, Burnaby. B.C.. Canada V5A lS6 Abstract This paper presents an approach to default reasoning based on an extension to...	1987	61
656	Department of Computer Science Carnegie-Mellon University Abstract Most of the effort AI has put into common sense reasoning has involved inference by sequential rule application. This approach is most effective in well characterized domains where any valid chain of inference from a set of observa- ...	1987	62
657	More On Inheritance Hierarchies with Exceptions Default Theories and Inferential Distance David W. Etheringtonl Artificial Intelligence Principles Research Department AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974-2070 ether%allegra@btl.csnet r Abstract ...	1987	63
658	John F, Horty Richmond I% Thornason David S. Touretzky r Philosophy Department Linguistics Department Computer Science Department University of Maryland University of Pittsburgh Carnegie Mellon University College Park, MD 20742 Pittsburgh, PA 15260 Pi...	1987	64
659	Circumscriptive Theories: A Logic-Based Framework for Knowledge Representation (Preliminary Report) Vladimir Lifschitz Computer Science Department Stanford University Stanford, CA 94305 Abstract The use of circumscription for formalizing commonsense knowledge ...	1987	65
660	bracing Causality in al Reasoning* t Judea Pearl Cognitive Systems Laboratory, UCLA Computer Science Department, Los Angeles, CA. 90024 Abstract The purpose of this note is to draw attention to certain aspects of causal reasoning which are pervasive in ordinary disconrse yet, based on the author...	1987	66
661	ties Judea Pearl & Thomas Verma Cognitive Systems Laboratory UCLA Computer Science Department, Los Angeles, CA 90024-1600 Abstract Data-dependencies of the type “x can tell us more about y given that we already know z ” can be represented in various formal- isms: Probabilistic Dependencies...	1987	67
662	ision Clrern H. Se& Information Techno ute National Computer 71 Science Pa& Drive Singapore 0511 Abstract The thesis of this paper is that default wasouing can be accomplished rather naturally if au appro- priate strategy of belief revision is employed. The ideaisb on the premise tha...	1987	68
663	Y W#odek W. .Zadro~ng, IBM T.J.Watson Research Center PAX Box 704 Yorktown Heights, NY 10598 We propose a theory of default reasoning satisfying a list of natural postulates. These postulates imply that know- ledge bases containing defaults should be understood not as sets of formula...	1987	69
664	A Multiprocessor Architecture for Production System Matching Michael A. Kelly, Rudolph E. Seviora Department of Electrical Engineering University of Waterloo Waterloo, Ontario, Canada ABSTRACT This paper presents a new, highly parallel algorithm for OPS5 production system match- ing,...	1987	7
665	Intention = Choice + Commitment1 Philip. 33.. Cohen Artificial Intelligence Center and CSL12 SRI International Menlo Park, CA 94025 Abstract This paper provides a logical analysis of the concept of intention as composed of two more basic concepts, choice (or goal) and commitment. ...	1987	70
666	Thomas Y. Galloway USC-Information Sciences Institute1 4676 Admiralty Way Marina de1 Key, CA 90292-6695 Telephone: 213-822-1511 GALLC WAY @ VAXA.ISI.EDU Abstract The task of constructing knowledge bases is a dif- ficult one due to their size and complexity. A use- ful aid for this task wou...	1987	71
667	Complexity in Classificatory Reasoning Ashok Gael, N. Soundararajan, and B. Chandrasekaran Department of Computer and Information Science The Ohio State University Columbus. Ohio 43210 Abstract Classificatory reasoning involves the tasks of c...	1987	72
668	All I Know: An Abridged Report1 Hector J. Levesque2 Dept. of Computer Science University of Toronto Toronto, Canada M5S lA4 Abstract Current approaches to formalizing non-monotonic reasoning using logics of belief require new metalog- ical properties over sets of...	1987	73
669	Algorithm Synthesis through Michael IL Lowry Stanford Artificial Intelligence Laboratory Box 3350, Stanford CA 94305 And Kestrel Institute 1801 Page Mill Road, Palo Alto CA 94304 Abstract AI has been successful in producing expert systems for diagnosis, qualitative simulatio...	1987	74
670	Curing Anomalous Extensions Paul Morris IntelliCorp 1975 El Camino Real West Mountain View, CA 94040 Abstract In a recent paper, Hanks and McDermott presented a simple problem in temporal reasoning which showed that a seemingly natural representation of a frame a...	1987	75
671	Semantically Sound Inheritance Its ::I$ Nado and Richard Fikes IntelliCorp 197,s El Camino Real West Mountain View, California 94040-2216 Abstract Most frame languages either are glaringly deficient in their treatment of default information or d...	1987	76
672	A Strategy for Impleme Jane Terry Nutter Department of Computer Science Virginia Polytechnic Institute and State University Blacksburg, Virginia 24060 ases Abstract Assimilation is a process by which a knowledge base restructures itself to improve the organization o...	1987	77
673	Allard and William F. Kaemmerer Artificial Intelligence Department Honeywell Corporate Systems Development Division 1000 Boone Avenue North Golden Valley, Minnesota 55427 Abstract We have developed and implemented a plan representation system which has been used as the knowledge repr...	1987	78
674	Partial Compilation of Strategic Knowledge1 Russ B. Altman and Bruce 6. Buchanan Knowledge Systems Laboratory Stanford University Abstract Many system building efforts in artificial intelligence intentionally begin with expressively rich and flex- ible declarative structures fo...	1987	79
675	T’REAT’: A Better Mate lgorith for AI Production Systems Daniel I?. Miranker Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 Abstract This paper presents the TREAT match algorithm for AI production systems. The TREAT algorithm intro- duce...	1987	8
676	Representing Databases in ames Ey-Chih Chow Hewlet t-Packard Laboratories 1501 Page Mill Road, Palo Alto, California 94304 Abstract Three methods for representing data in a relational storage system with an in-core frame-based system are experimented with and reported upon. Tradeo...	1987	80
677	Optimizing the Predictive Value of Sholom M. Weiss, Robert S. Galen, and Prasad V. Tadepalli *Dzgartment of Computer Science, Rutgers University, New Brunswick, NJ 08904 Department of Biochemistry, Cleveland Clinic Foundation, Cleveland, Ohio Abstract An approach to finding an optim...	1987	81
678	Learning to Control a Dynamic Physical System Margaret E. Connell Paul E. Utgoff Department of Computer and Information Science University of Massachusetts, Amherst, MA 01003 Abstract This paper presents an approach to learning to control a dynamic physical ...	1987	82
679	Improving Inference Throu Clustering Douglas Fisher Department of Information and Computer Science University of California Irvine, California 92717 abstract Conceptual clustering is an important way to summarize data in an understandable manner. However, the recency o...	1987	83
680	David Haussler Department of Computer Science, University of California, Santa Cruz, CA 95064 USA ’ We study the problem of learning conjunctive concepts from examples on structural domains like the blocks world. This class of concepts is formally defined and it is shown that even for samples...	1987	84
681	enrion, cision Science, and Engineering and Public Policy, Carnegie Mellon University, Pittsburgh, Pa 15213. straea provides a set of techniques for structuring and encoding expert knowledge, comparable with knowledge engineering techniques for rule-based expert systems. In ...	1987	85
682	Smadar T. Kedar-Cabelli Department of Computer Science Rutgers University New Brunswick, NJ 08903 ARPAnet: kedar-cabelli@rutgers.arpa Abstract Explanation-Based Generalization (EBG) has been recently a much-explored method of generalization. By utilizing domain knowledge,...	1987	86
683	perationality for Ex Richard M. Keller ,Rutgers University Department of Computer Science New Brunswick, New Jersey 08903 Internet: Keller@Rutgers.Edu Abstrdct Operationality is the key property that distinguishes the final description lecarned in an explanation-based sys...	1987	87
684	for u kit i Georg Klinker, Casey Boyd, Serge Genetet, and John McDermott Department of Computer Science Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 KNACK is a knowledge acquisition tool that generates expert systems for evaluating designs of electromechanical syst...	1987	88
685	ArEnaand E. P&ditis and Jack Mostow Department of Computea: Science Rutgers University, New Brunswick, NJ 08903 Abstract An adaptive inteTpTeter for a programming language adapts to particular applications by learning from execution experience. This paper describes PRO- LEARN, a prot...	1987	89
686	Joshua*: Uniform Access to Heterogeneous Knowledge Structures Why Joshing is Better tlin Conniving or Phming Steve Rowley, Howard Shrobe, Robert Cassels Symbolics Cambridge Research Center 1 II Cambridge Center, Cambridge, MA 02142 Walter Hamscher MIT Artificial Intelligence Laborato...	1987	9
687	Knowledge Level Learning in Soar1 Paul S. Rosenbloom John E. Laird Allen Newell Knowledge Systems Lab. Department of EECS Computer Science Dept. Computer Science Dept. University of Michigan Carnegie-Mellon U. Stanford University Ann Arbor, MI 48109 Pittsburgh...	1987	90
688	Stuart 3. Russell Benjamin N. Grosof Computer Science Division Computer Science Department University of California Stanford University Berkeley, CA 94720 Stanford, CA 94305 Abstract We give a declarative formulation of the biases used in inductive concept ...	1987	91
689	Learning and Representation Ghan Jeffrey C. ScM.immer* Department of Information and Computer Science University of California, Irvine 92717 schlimmer@ics .uci. edu To remain effective without human interaction, intelligent sys- tems must be able to adapt to their environmen...	1987	92
690	An EBL System that xtends and Generalizes Explanations * Jude W. Shavlikl Gerald F. DeJong Coordinated Science Laboratory University of Illinois Urbana, IL 61801 Many concepts require generalizing number. For example, concepts such as momentum and energy conservatio...	1987	93
691	This paper extends previous work which provided a theory for the interpretation of and necessity for clue words in a particular kind of discourse - namely, one-way arguments. Previous work described a taxonomy of cunnective clues (words such as “hen&’ or phrases such as “as a result”), where each clue, c...	1987	94
692	AN: An Interlingual A Bonnie Dorr to achine Tradati M.I.T. Artificial Intelligence Laboratory Abstract Machine translation has been a particularly difficult problem in the area of Natural Language Processing for over two decades. Early approaches to translation failed ...	1987	95
693	Recovering from Erroneous Inferences Kurt P. Eiselt* Department of Information and Computer Science University of California Irvine, California 92717 ntroduction As we read, we make unconscious decisions about the meaning of ambiguous words, sentences, or passages b...	1987	96
694	Eduard H. Hovy Information Sciences Institute of USC1 4676 Admiralty Way Marina de1 Rey, CA 962926695 Telephone: 213-822-1511 HQVU @ VAXA.ISI.EDU Abstract a’he computer maxim garbage in, garbage out is especially true of language generation. ‘When a generator slavishly follows its input topic...	1987	97
695	Aravind IL Joshi Department of Corn uter and Information Science Room 55 Moore School s Universit of Penns lvania Philade phia, PA 9104 i! Y ABSTRACT In natural language generation the grammatical component has to be systematically interfaced to the other components...	1987	98
696	1 Burlington Rd. Bedford, Mass;echusetts Ql.730 ail Stop A040 Abstract The KING KONG Ilngulstlc lnnterface was developed at MPTRE to be a portable natural Ian- guage interface for expert systems. It is possible to port KING KONG from one expert system to another without ...	1987	99
697	Stephanie A. Miller & Lenhart K. Schubert Department of Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2Hl Abstract Theorem provers are prone to combinatorial explosions, espe- cially when the reasoning chains needed to establish a desired result are lengthy. To alle...	1988	1
698	Rim Dechter Cognitive Systems Laboratory Computer Science Department University of California, Los Angeles, CA 90024 Abstract This paper presents a constraint network formulation of belief maintenance in dynamically changing environments. We focus on the task of computing the degr...	1988	10
699	Design for Testability Peng Wu MIT AI Lab 545 Technology Sq., Rm833 Cambridge, MA 02139 Abstract This paper presents an implemented system for modifying digital circuit designs to enhance testa- bility. The key contributions of the work are: (1) se...	1988	100

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.