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
900	Learning to Coordinate Behaviors Pattie Maes & Rodney A. Brooks AI-Laboratory Massachusetts Institute of Technology 545 Technology Square Cambridge, MA 02139 pattieQai.mit .edu brooksQai.mit .edu Abstract We describe an algorithm which allows a behavior- ba...	1990	147
901	Empirical Studies on the Speed of Convergence of Neural Network Training using Genetic Algorithms Hiroaki Kitano Center for Machine Translation Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. hiroaki@cs.cmu.edu Abstract This paper reports several experimental results on the speed of c...	1990	148
902	Theory Reduction, eory Allen Ginsberg AT&T Bell Laboratories Holmdel, NJ 07733 abgQvaxl35.att.com Abstract This paper presents an approach to retranslation, the third and final step of the theory reduction approach to solving theory revision problems [3,4]. Retranslation inv...	1990	149
903	An Organizational Approach to Adaptive Production Systems Toru Ishida Makoto Yokoo NTT Communications and Information Processing Laboratories l-2356, Take, Yokosuka-shi, 238-03, Japan ishida/yokoo%nttkb.ntt.jp@relay.cs.net Abstract Recently-developed techni...	1990	15
904	sal Trees fro n-nation * Dan Geiger Azaria Paz Judea Pearl dgeiger@nrtc.northrop.com paz@techsel.bitnet judea@cs.ucla.edu Northrop Research and Computer Science Department Cognitive Systems Lab. Technology Center Israel Institute of Technology University of California ...	1990	150
905	Constructor: A System for the Induction of Probabilistic Models Robert M. Fung and Stuart L. Crawford Advanced Decision Systems 1500 Plymouth Street Mountain View, CA 94043-1230 Abstract The probabilistic network technology is a knowledge- based technique which focuses on reasoning u...	1990	151
906	Generalization with Taxonomic Information Alan M. fiisch and C. David Page Jr. Dept. of Computer Science and Beckman Institute University of Illinois 405 North Mathews Ave. Urbana, IL 61801 Abstract This paper studies sorted generalization-the gener- alization...	1990	152
907	What Should Be Minimized in a Decision Tree? Usama M. Fayyad and Keki B. Irani Artificial Intelligence Laboratory Electrical Engineering & Computer Science Department The University of Michigan Ann Arbor, MI 48109-2122 umf@zip.eecs.umich.edu Abstract In this paper, we address the issue of eva...	1990	153
908	Learning from Textbook nowledge: A Case Study William W. Cohen Computer Science Department Rutgers University New Brunswick, NJ 08903 wcohen@cs.rutgers.edu Abstract One of the “grand challenges for machine learning” is the problem of learning from textbooks. This paper addre...	1990	154
909	Myths and Legends in Learning Wray Buntine* Turing Institute Classification George House, 36 Nth. Hanover St. Glasgow, Gl 2AD, UK Abstract This paper is a discussion of machine learning theory on empirically learning classification rules. The pa- per proposes six myths in the mach...	1990	155
910	Inductive Learning in a ixed aradigm Setting* David B. Skalak and Edwina E. R&land Department of Computer and Information Science University of Massachusetts, Amherst, MA 01003 SKALAK@CS.UMASS.EDU Abstract In a precedent-bused domain one appeals to previ- o...	1990	156
911	A Hybrid Connectionist, Sy b&c Learning System Lawrence 0. Hall and Steve G. Romaniuk Department of Computer Science and Engineering University of South Florida Tampa, Fl. 33620 email:hall@sol.usf.edu romaniuk@sol.usf.edu Abstract This paper describes the learnin...	1990	157
912	Automated iscovery in a Che aboratory* Jan M. kytkovvt Jieming Zhu Abul Hussam Department of Computer Science Department of Chemistry zytkow@gmuvax.gmu.edu jzhu@gmuvax.gmu.edu George Mason University, Fairfax, VA 22030 U.S.A. Abstract We describe an application of t...	1990	158
913	tive Search lanat ion- ased Learning of ic Censors Neeraj Bhatnagar Learning and Knowledge Acquisition Group Siemens Corporate Research, Inc. 755 College Road (E), Princeton, NJ 08540. neeraj@learning.siemens.com Abstract We introduce an adaptive search technique...	1990	159
914	Probabilistic Semantics for Cost Based Abduction* Eugene Charniak and Solomon E. Shimony Computer Science Department Box 1910, Brown University Providence, RI 02906 ec@cs.brown.edu and ses@cs.brown.edu Abstract Cost-based abduction attempts to find the best ex...	1990	16
915	Empirical Comparisons of Some Design Replay Algorit Brad Blumenthal t Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 brad@cs.utexas.edu Abstract Although most design replay techniques have been em- pirically tested against so...	1990	160
916	Megan Eskey and Monte Zweben NASA Ames Research Center M.S. 244-17 Moffett Field, California 94035 eskey@pluto.arc.nasa.gov, zweben@!pluto.arc.nasa.gov Abstract This paper describes an application of an analyti- cal learning technique, Plausible Explanation-Based Learning (P...	1990	161
917	Why PRODIGY/EBL Works Oren Etzioni* School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 etzi@cs.cmu.edu Abstract Explanation-Based Learning (EBL) fails to accel- erate problem solving in some problem spaces. How do these problem ...	1990	162
918	Learning Abstraction Hierarchies for Problem Solving Craig A. Knoblock* School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 cak@cs.cmu.edu Abstract The use of abstraction in problem solving is an effective approach to reducing search, bu...	1990	163
919	Extending EBG to Term-Rewriting Systems Philip Laird Evan Gamble (LAIRII@FWJT~.MW.WWLGO~) (GAMBLE@PL~T~.ARc.NAsA.Gov) AI Research Branch Sterling Federal Systems, Inc. NASA Ames Research Center Moffett Field, CA 94035 Abstract We show that the familiar explanation-based general- i...	1990	164
920	Operationality Criteria for Recursive Predicates Stanley Letovsky School of Computer Science Carnegie-Mellon University Pittsburgh, PA 15213 letovsky@cs.cmu.edu Abstract Current explanation-based generalization (EBG) tech- niques can perform badly when the problem being solv...	1990	165
921	e Utility of in ecursive ain Theories Devika Subramanian* and Ronen Feldman Computer Science Department Cornell University Ithaca, NY 14853 Abstract We investigate the utility of explanation-based learning in recursive domain theories and examine the cost of using macro-r...	1990	166
922	Integrating Natural Language Processing and Knowledge Based Processing* Rebecca Passonneau and Carl Weir and Tim Finin and Martha Palmer Unisys Corporation The Center for Advanced Information Technology Paoli, Pennsylvania Abstract A central problem in text-understanding research ...	1990	167
923	Towards Incremental iguat ion with a Generalized iscrimination Network Manabu Okumura and Hozumi Tanaka Department of Computer Science, Tokyo Institute of Technology 2-12-1, 0-okayama, Meguro-ku, Tokyo, 152, Japan dora@cs.titech.ac.jp Abstract Semantic disa...	1990	168
924	uly Parallel u g of Text* Yeong-Ho Yu and Robert F. Simmons Artificial Intelligence Laboratory The University of Texas at Austin Austin, Texas 787’12 yu@cs.utexas.edu, simmons@cs.utexas.edu Abstract Understanding a text requires two basic tasks: making inferences at sever...	1990	169
925	Two views of beliefi Belief as generalized robability and belief as evidence Joseph Y. Halpern Ronald Fagin IBM Almaden Research Center San Jose, CA 95120 email: halpern@ibm.com, fagin@ibm.com Abstract Belief functions are mathematical objects defined to satisfy three axioms that ...	1990	17
926	Parsing a Natural Language Using Mutual Information Statistics* David M. Magerman and Mitchell P. Marcus CIS Department University of Pennsylvania Philadelphia, PA 19104 E-mail: magerman@linc.cis.upenn.edu Abstract The purpose of this paper is to characterize a constituent b...	1990	170
927	Accent and Discourse Context: Assigning Pitch Accent in Synthetic Speech Julia Hirschberg AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 julia@research.att .com Abstract Identifying the regularities underlying speaker deci- sions to emphasize or de-emphasize...	1990	171
928	Structure of Perspectivity: A Case of Japanese Reflexive Pronoun “dwP 3-9-l 1 Abstract Yasuhiro Katagiri NTT Basic Research Laboratories Midori-cho, Musashino, Tokyo, 180 Japan katagiri%atom.ntt.jp@relay.cs.net A theory of perspectivity is proposed to establish ...	1990	172
929	PRAGMA - A Flexible Bidirectional Dialogue System John M. Levine University of Cambridge, Computer Laboratory, Pembroke Street, Cambridge CB2 3QG, England. jml@uk.ac.cam.cl Abstract This paper gives an overview of a natural language dialogue system called PRAGMA. This system contains a number of...	1990	173
930	LOGICALTASKMODELLING FOR MAN-MACHINEDIALOGUE M.D. SADEK Centre National d’Etudes des Telecommunications Route de Tn5gastel - B.P.40 F 22301 Lannion Cedex - FRANCR Abstract To design a task-independent dialogue system, we present a task-oriented dialogue analysis in terms of finding the referents...	1990	174
931	The Belief Calculus and Uncertain Reasoning Yen-Teh Hsia* IRIDIA, Universitk Libre de Bruxelles 50 av. F. Roosevelt, CP 19416 1050, Brussels, Belgium rO1509@bbrbfuOl.bitnet Abstract We formulate the Dempster-Shafer formalism of belief functions [Shafer 761 in the spirit of logical inferenc...	1990	18
932	Symbolic Probabilistic Inference in Belief Networks Ross D. Shachter, Bruce D’ Ambrosio, and Brendan A. Del Favero Engineering-Economic Systems Dept. Department of Computer Science Engineering-Economic Systems Dept. Stanford University Oregon State University Stanford University Stanford, ...	1990	19
933	A Hierarchical Protocol for Coordinating Multiagent Behaviors Edmund H. Durfee and Thomas A. Montgomery Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor, Michigan 48109 durfee@caen.engin.umich.edu, monty@caen.engin.umich.edu...	1990	2
934	Incremental, Approzimate Planning Charles Elkan Department of Computer Science University of Toronto* ABSTRACT: This paper shows how using a nonmono- tonic logic to describe the effects of actions enables plau- sible plans to be discovered quickly, and then refined if time permits. ...	1990	20
935	Admissible Criteria Roy Feldman and Paul Morris IntelliCorp 1975 El Camino Real West Mountain View, CA 94040 feldman@intellicorp.com morris@intellicorp.com Abstract We introduce methods for identifying operator preconditions that need not be expanded further. ...	1990	21
936	Practical Temporal Projection Steve Hanks* Department of Computer Science and Engineering, FR-35 University of Washington hanks&s. washington.edu Abstract Temporal projection-predicting future states of a changing world-has been studied mainly as a formal problem...	1990	22
937	Synthesis of eactive Plans for Multi-Path Environments* F. Kabanza Universitk de Likge Institut Mont&ore B28 4000 Likge Sart-Tilman; Belgium U519026QBLIULG 11 .bitnet Abstract We describe a planner that works on the description of a multi-pa*th environment and ge...	1990	23
938	and Retrieval During Plan Reuse: ation Structure Based Approach Subbarao Kambhampati* Center for Design Research and Department of Computer Science Stanford University Bldg. 530, Duena Street, Stanford CA 94305-4026 e-mail: rao@sunrise.stanford.edu Abstract Effective mapping and retrieval are im...	1990	24
939	A Theory of Plan Modification Subbarao Kambhampati* Center for Design Research and Department of Computer Science Stanford University Bldg. 530, Duena Street, Stanford CA 943054026 e-mail: rao@sunrise.stanford.edu Abstract We present a theory of plan modification applicable to hierarchical no&ea...	1990	25
940	Introducing the Tileworld: Experimentally Evaluating Agent Architectures * Martha E. Pollack Artificial Intelligence Center and Center for the Study of Language and Information Marc Ringuette School of Computer Science Carnegie Mellon University SRI International 333 Rave...	1990	26
941	Getting Serious about Parsing Plans: a Grammatical Analysis of Plan Recognition Marc Vilain The MITRE Corporation Burlington Road, Bedford, MA 01730 Internet: mbv@linus.mitre.org Abstract This paper is concerned with making precise the notion that recognizing plans is much like parsing ...	1990	27
942	tion for Plannin Under Uncertainty Michael P. Wellman AI Technology Office, Wright R&D Center Wright-Patterson AFB, OH 45433 wellman@wrdc.af.mil Abstract The virtue of the STRIPS assumption for planning is that it bounds the information relevant to determin- ing the effects of action...	1990	28
943	ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner * Qiang Yang Computer Science Department University of Waterloo Waterloo, Ontario, Canada, N2L 3Gl qyang@watdragon.waterloo.edu. Abstract We present the system ABTWEAK, which extends the precondition-e...	1990	29
944	On Acting Together Hector J. Levesque* Philip R. Cohen Dept. of Computer Science AI Center and CSLI University of Toronto SRI International Toronto, Ont. M5S lA4 Menlo Park, CA 94025 hector@ai.toronto.edu pcohen@ai.sri.com Jo& H. T. Nunes Dept. of Computer Sci...	1990	3
945	An Approach to Reasoning About Continuous Change for Applications in Planning Thomas Dean* Greg Siegle Department of Computer Science Brown University Box 1910, Providence, RI 02912 Abstract There are many planning applications that require an agent to coordinate...	1990	30
946	Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction Mark Drummond* and John Bresinai Sterling Federal Systems AI Research Branch, NASA Ames Research Center Mail Stop: 244-17, Moffett Field, CA 94035 Abstract This paper presents a projection algorith...	1990	31
947	Search Lessons Learned fro Crossword Puzzles Matthew L. Ginsberg* Michael Frank Michael P. Halpin Mark C. Torrance Computer Science Department Stanford University Stanford, California 94305 ginsberg@cs.stanford.edu Abstract The construction of a program that generates ...	1990	32
948	Iterative Broadening Matthew L. Ginsberg* and William D. Harvey Computer Science Department Stanford University Stanford, California 94305 ginsberg@cs.stanford.edu Abstract Conventional blind search techniques generally assume that the goal nodes for a given problem are distributed ...	1990	33
949	Path-Focused Duplication: rocedure for Sunil Issar Carnegie Mellon University Pittsburgh, Pennsylvania 15213-3890 si@cs.cmu.edu Abstract The mating paradigm for automated theorem provers was proposed by Andrews to avoid some of the short- comings in resolution. It facilitates automated deduc-...	1990	34
950	Consistent Linear S eedups to a First Solution in Parallel State-Space Search* Vikram A. Saletore and L. V. Kal6 Department of Computer Science, 1304 West Springfield Avenue, University Of Illinois at Urbana-Champaign, Urbana, Illinois 61801, USA email: saletore@cs.uiuc.edu ...	1990	35
951	Inductive Synt quat ional Nachum Dershowitz Eli Pinchover Department of Computer Science Department of Mathematics University of Illinois and Computer Science Urbana, IL 61801, U.S.A. Bar-Ilan University nachum@cs.uiuc.edu Ramat-Gan 52100, Israel Abstract An equa...	1990	36
952	Mechanizing inductive reasoning Emmanuel Kounalis and Michael Rusinowitch CRIN, 54506 Vandoeuvre lcs Nancy, BP239 (France) e-mail: { kounalis,rusi}@loria.fr Abstract Automating proofs by induction is important in many computer science and artificial intelligence applications...	1990	37
953	Skolem Functions and Equality in Automated Deduction * William McCune Mathematics and Computer Science Division Argonne National Laboratory Argonne, Illinois 60439-4801 mccune@mcs.anl.gov Abstract We present a strategy for restricting the application of the inference rule paramodulat...	1990	38
954	Automatically Generating Universal ttachments Through Compilation Karen L. Myers Department of Computer Science St anford University Stanford, California 94305 myers@neon.stanford.edu Abstract Universal attachment is a general-purpose mechanism for integrating di...	1990	39
955	Negotiation and Conflict Resolution in Non-Cooperative Domains Gilad Zlotkin* Jeffrey S. Rosenschein Computer Science Department, Hebrew University Givat Ram, Jerusalem, Israel gilad@humus.huji.ac.il, jeffQhumus.huji.ac.il Abstract In previous work [Zlotkin and Rosenschei...	1990	4
956	Solving Term Inequalities Gerald E Peterson? 225/105/2/206 mailcode 106 5165 McDonnell Douglas Corporation P. 0. Box 516, St. Louis, MO 63166 peterson@mdc.com Abstract This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of eq...	1990	40
957	Computing Stable Models By Using the ATMS Kave Eshghi Hewlett Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS12 6&Z, England. Email:ke@hplb.hpl.hp.com Abstract An algorithm is described which computes stable mod- els of propositional logic programs with negat...	1990	41
958	Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System Ulrich Junker GMD, F3-HIS Postfa,ch 1240 5205 St. Augustin 1, F.R..G. unido!gmdzi!junkerGhunet .uu.net Abstract In this pa.per we develop a proof procedure for au- ...	1990	42
959	Maintaining Consistency in a Stratified System Program Louiqa Raschid Department of Information Systems and Institute for Advanced Computer Studies University of Maryland College Park, MD 20742 louiqa@secd.cs.umd.edu Abstract We present our research on defining ...	1990	43
960	Exploiting locality in a TMS Johan de Kleer Xerox Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto CA 94304 USA Email: deKleer@xerox.com Abstract This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use wi...	1990	44
961	Constraints for the iscontinuity fro Mot ion Michael J. Black and P. Anandan Department of Computer Science Yale University New Haven, CT 06520-2158 Abstract Surface discontinuities are detected in a sequence of images by exploiting physical constraints at early stages in...	1990	45
962	c uting Exact A ets: Par Jean Ponce Beckman Institute University of Illinois Urbana, IL 61801 Abstract This paper introduces a new approach for com- puting the exact aspect graph of curved objects observed under orthographic projection. Curves corresp...	1990	46
963	Generalized Shape Autocorrelation Andrea Califano and Rakesh Mohan IBM, Thomas J. Watson Center Exploratory Computer Vision Group P.O. Box 704, Yorktown Heights, NY 10598 Abstract This paper presents an efficient and homogeneous paradigm for automatic acquisition and recognition of nonparametric...	1990	47
964	Coping with Uncertainty in a Control System for Navigation and Explosat ion Thomas Dean* Kenneth Basye Robert Chekaluk Seungseok Hyun Moises Lejter Margaret Randazza Department of Computer Science Brown University, Box 1910, Providence, RI 02912 Abstract A ...	1990	48
965	Learning General Completable Reactive Pla Melinda T. Gervasio* Beckman Institute for Advanced Science and Technology University of Illinois at Urbana-Champaign 405 N. Mathews Ave., Urbana, Illinois 61801 gervasio@cs.uiuc.edu Abstract This paper presents an e’xplanation-based learning strategy ...	1990	49
966	From: AAAI-90 Proceedings. Copyright ©1990, AAAI (www.aaai.org). All rights reserved. System Architecture In a loosely coupled distributed system, an agent spends most of its cpu time in computation as op- posed to communication. Since theorem proving by nature is computationally int...	1990	5
967	Integrating Execution, Planning, and Learning in Soar for External Environments* John E. Laird Artificial Intelligence Laboratory The University of Michigan 1101 Beal Ave. Ann Arbor, MI 48109-2110 laird@caen.engin.umich.edu Abstract Three key components of an autonomou...	1990	50
968	Symmetry Constraint Inference in Assembly Planning - Automatic Assembly Configuration Specification* Yanxi Liu and Robin J. Popplestone Laboratory for Perceptual Robotics Department of Computer and Information Science University of Massachusetts at Amherst, 01003 US...	1990	51
969	Becoming Increasingly Reactive Tom M. Mitchell School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Tom.Mitchell@cs.cmu.edu Abstract We describe a robot control architecture which combines a stimulus-response subsystem for rapid reaction, ...	1990	52
970	A Hierarchical Planner that Generates its Own Hierarchies Jens Christensen* Computer Science Department Stanford University Stanford, CA 94305 jens@cs.stanford.edu Abstract PABLO’ is a nonlinear planner that reasons hi- erarchically by generating abstract predicates...	1990	53
971	Indexical Knowledge in Robot Plans* Yves Lesphance and Hector J. Levesquet Dept. of Computer Science University of Toronto Toronto, Ont. M5S lA4 Canada lesperan@ai.toronto.edu and hector@ai.toronto.edu Abstract Robots act upon and perceive the world from a particu- lar...	1990	54
972	LOGnets: A Hybrid Graph Spatial Representation for Robot Navigation Peter K. Malkin and Sanjaya Addanki IBM T.J.Watson Research Center p.0. Box 704 Yorktown Heights, NY 10598 Abstract In this article we present a novel, hybrid graph spatial representation for robot navigation. This representatio...	1990	55
973	Towards a System Architecture Sup Gerhasd Fischer,l Andreas C. Lemke,l and Raymond McCall2 Dept. of Computer Science,’ College of Environmental Design,2 and Inst. of Cognitive Science1*2 Engineering Center ECOT 7-7, University of Colorado, Boulder, CO 80309-0430 (gerhard, andreas)@boulder.colorado.edu, m...	1990	56
974	Backward Model Tracing: An Explanation-Based Approach for Reconstructing Student Reasoning Danilo Fum (), Paolo Giangrandi(“), Carlo Tasso (“) () Dipartimento di Psicologia, Universit5 di Trieste Via dell’Universit.5 7, I-34123 Tries& Italy - fum@uts882.units.infn.it.bitnet ...	1990	57
975	ic Instructional Planner William R. Murray Artificial Intelligence Department FMC Corporate Technology Center 1205 Coleman Avenue, Box 580 Santa Clara, California 95052 murray@ctc.fmc.com Abstrirct’ The Blackboard Instructional Planner is a blackboard-based dynamic planner for ...	1990	58
976	What’s in a user? Karen Sparck Jones Computer Laboratory, University of Cambridge New Museums Site, Pembroke Street Cambridge CB2 3QG, UK I take user modelling to imply reasoning, explicitly or quasi-explicitly, about the user. Thus while systems or interfaces usually embed assumptions about their ...	1990	59
977	Complexity of K-Tree Structurecl Constraint Satisfaction Problems Eugene C. Freuderl Department of Computer Science University of New Hampshire Durham, New Hampshire 03824 Abstract Trees have played a key role in the study of constraint satisfaction problems because problems wi...	1990	6
978	The Future of Knowledge Re resent at ion Extended Abstract Ronald J. Brachman AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Abstract Knowledge representation (KR) has traditionally been thought of as the heart of artificial intelligence. Any- one who has ever built an ex...	1990	60
979	Rationality and its Roles in Reasoning (Extended Abstract) Jon Doyle* Massachusetts Institute of Technology Laboratory for Computer Science 545 Technology Square Cambridge, Massachusetts 02139, USA Abstract The economic theory of rationality promises to equal mathemati...	1990	61
980	Probably Approximately Correct Learning David Haussler* haussler@sat urn.ucsc.edu Baskin Center for Computer Engineering and Information Sciences University of California, Santa Cruz, CA 95064 1 Abstract This paper surveys some recent theoretical results on the efficiency of...	1990	62
981	Truth Maintenance David McAllester* Massachusetts Institute of Technology Artificial Intelligence Laboratory 545 Technology Square Cambridge, Massachusetts 02139, USA Abstract General purpose truth maintenance systems have re- ceived considerable attention in the past few years. This paper di...	1990	63
982	Massively Parallel AI* David L. Waltz Thinking Machines Corporation 245 First Street Cambridge, MA 02142-1214 Abstract Most AI researchers would, I believe, agree that truly intelligent machines (i.e. machines on a par with humans) will require at least four orders of magnitude more power ...	1990	64
983	AI and Software Engineering Will the Twain Ever Meet? Moderator: Robert Balzerl USC Iuforination Scieuces Iustitute Panelists: Richard Fikes Price Waterhouse Mark Fox Carnegie Mellon University John McDermott Digital Equipment Corporation Elliot Solow...	1990	65
984	Introduction I have been asked in this note to Richard Fikes Price Waterhouse Technology Centre 68 Willow Road Menlo Park, California 94025 U.S.A. comment on the nature and extent to which the technologies and methodologies used to build “smart” application systems have contributed t...	1990	66
985	Looking for the AI in Software Engineering An Applications Perspective Mark S. Fox Center for Integrated Manufacturing Decision Systems Carnegie Mellon University Pittsburgh, PA 15213 msf@cs.cmu.edu htiuction I have been asked to address the reasons why Artificial Inte...	1990	67
986	eveloping ‘Softw re is like Talki John McDermott Digital Equipment Corporation 111 Locke Drive, LMOZl/Kl 1 Marlboro, Massachusetts 01752 Context It’s not clear to me exactly what people in AI do, but one thing that is talked about a lot is how important knowledge is. One of the things knowledge ...	1990	68
987	The Techies vs. the Non-techies: Today’s Two Cultures Elliot Soloway Dept. of Electrical Engineering and Computer Science AI Laboratory University of Michigan Ann Arbor, MI 48109 Extended Abstract During the postwar heyday of physics, C.P. Snow, wrote a short article entitled “The Two Culture...	1990	69
988	Tree Decomposition with Applications to Constraint Processing Itay Meiri, Rina Dechter ’ and Judea Pearl Cognitive Systems Laboratory Computer Science Department University of California Los Angeles, CA 90024 itay@cs.ucla.edu, dechter@techsel.bitnet, judea@cs.ucla.edu Abstract This paper concern...	1990	7
989	Panel: User Modeling and User Interfaces Susan T. Dumais Bellcore 445 South St. Morristown, NJ 07960 std@bellcore.com The User Knows Best I will consider the problem of helping user’s retrieve information from large diverse collections of textual materials suc...	1990	70
990	User Modeling and User Interfaces Kathleen R. McKeovm Columbia University Department of Computer Science 450 Computer Science Building New York, N.Y. 10027 MCKEOWN@CS.COLUMBIA.EDU In the past several years, it has become increasingly apparent that there is strong disagree...	1990	71
991	User Models and User Interfaces: A Case for Domain Models, Task Models, and Tailorability James D. Hollan Bell Communications Research 445 South Street Morristown, New Jersey 07960 hollan@bellcore.com My thesis is that the case for user models has little empirical support, necessa...	1990	72
992	Integrating Planning and Acting in a Case-Based Framework.* Kristian Hammond Timothy Converse Charles Martin The University of Chicago Department of Computer Science Artificial Intelligence Laboratory 1100 East 58th Street Chicago, IL 60637 ai@tartarus.uchicago.edu Abstract ...	1990	73
993	A Method of Calculating the Measure of Salience in Understanding Metaphors IWAYAMA Makoto and TOKUNAGA Takenobu and TANAKA Hozumi Tokyo Institute of Technology 0-OKAYAMA, 2-12-1 MEGURO-KU, TOKYO, 152, JAPAN iwa@cs.titech.ac. jp Abstract This paper presents ...	1990	74
994	Distributed Cases for Case-Based Reasoning; Facilitating Use of Multiple Cases Michael Redmond* School of Information and Computer Science Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9382 E-mail: redmond@pravda.gatech.edu Abstract A case-based re...	1990	75
995	Validated Retrieval in Case-Based Reasoning Evangelos Simoudis Computer Science Department Brandeis University Waltham, MA 02254 and Digital Equipment Corporation Abstract We combine simple retrieval with domain-specific vali- dation of retrieved cases to produce a useful practica...	1990	76
996	0 IA SOF AI Lawrence Birnbaum, Gregg Collins, Michael Freed, and Bruce Krulwich Northwestern University The Institute for the Learning Sciences and Department of Electrical Engineering and Computer Science Evanston, Illinois Abstract We propose that a planner should be provi...	1990	77
997	Physical Impossibility Instead of Fault Models Gerhard Friedrich, Georg Gottlob, Wolfgang Nejdl Christian Doppler Laboratory for Expert Systems Technical University of Vienna, Paniglgasse 16, A-1040 Vienna, Austria - friedrich@vexpert .at Abstract In this paper we describ...	1990	78
998	de of Coherence lanation* Hwee Tou Ng Raymond J. Mooney Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 htng&s.utexas.edu, mooney@cs.utexas.edu Abstract Abduction is an important inference process un- derlying much of human intelligent ac...	1990	79
999	Stolving Large-Scale Constraint Satisfaction an Scheduling Problems Using a epair Metho Steven Mintonl Mark D. Johnston2 Andrew B. Philips1 Philip Laird3 lsterling Federal Systems 2Spac~7ede~~~~~~~~~c~~~~~titute 3AI Research Branch NASA Ames Research Center . ...	1990	8

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.