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
800	Compliance Viewed as Programming a Damped Spring Stephen J. Buckley * Manufacturing Research IBM Thomas J. Matson Research Center Yorktown Heights, NY Abstract Parts mating often requires the use of compliant mo- tions, which cause an o...	1988	57
801	Reasoning About Grasping S. A. Stansfield Sandia National Laboratories Albuquerque, N. M. 87185 Abstract The promise of robots for the future is that of intel- ligent, autonomous machines functioning in a variety of tasks and situations. If this promise is to be met, then it...	1988	58
802	Benjamin J. Mnipers and Uung-Tai Byun Department of Computer Sciences The Universit of Texas at Austin Austin, exas 78712 lY Abstract We present a qualitative method for a mobile robot to explore an unknown environment and learn a map, which can be robust in the face of various possi...	1988	59
803	Invariant Logic: A. Calculus for Problem Reformulation Michael R. Lowry Stanford Robotics Laboratory Box 3350, Stanford CA 94309 And Kestrel Institute 1801 Page Mill Road, Palo Alto CA 94304 lowry@kestrel.arpa Abstract Symmetries abound in nature. Observing sym- ...	1988	6
804	Subassembly Stability Nice Boneschanscher Hans van der Drift Laboratory for Manufacturing Systems Department of Mechanical Engineering Delft University, The Netherlands Abstract Planning a product assembly requires that we determine the order in which the product subparts ar...	1988	60
805	Inferring Igncbrance from the Locality of Visual Ernest Davis New York University 251 Mercer St. New York, NY 10012 Abstract This paper presents a logical theory that supports high-level reasoning about knowledge and perception. We construct a formal language in which perception can be ...	1988	61
806	Jahir Pabon and David Gossard Massachusetts Institute of Technology 77 Massachusetts Avenue Room 3-449 Cambridge, MA 02139 A central problem inherent to autonomous systems is the absence of an external reference frame in which sensory inputs can be interpreted. It is hypothesized that, in natural ...	1988	62
807	Ian Douglas orswill and Rodney Allen Brooks MIT Artificial Intelligence Lab I-AC m-,1- -l---- o-.--- -- 999 lecnnology mpare Cambridge, MA 02139 Abstract We describe a system that approaches and follows arbitrary moving objects in real tim...	1988	63
808	From: AAAI-88 Proceedings. Copyright ©1988, AAAI (www.aaai.org). All rights reserved. CUBRICON includes methodology to handle these prob- lems. Some systems use default techniques to handle am- biguous pointing. These techniques include: (1) a point returns the entity represented ...	1988	64
809	Gerhard Fischer and Christian Rat&e Department of Computer Science and Institute of Cognitive Science University of Colorado, Campus Box 430, Boulder, CO 80309 Abstract Spreadsheet systems have changed the way the world perceives and deals with computers. In an attempt at maintaining the posi...	1988	65
810	Automatic Construction of User-Interface Displays* Uigal Arens Lawrence Miller Stuart C. Shapiro Norman K. Sondheimer USC/Information Sciences Institute 4676 Admiralty Way Marina Del Rey, CA 90292 (213) 822-1511 Abstract Construction of user interfaces for most c...	1988	66
811	Specification By Reformulation: A Paradigm for Building Integrated User Suppod Environments1 John Yen, Robert Neches, and Michael DeBellis USC / Information Sciences Institute 4676 Admiralty Way, Marina de1 Rey, CA 90292 Abstract Specification by reformulation ...	1988	67
812	n The Extraction Information From Alex Pentland Vision Science Croup, The Media Lab, Massachusetts Institute of Technology Room E15-410, 20 Ames St., Cambridge MA 02138 We present a closed-form solution to the prob- lem extracting shape information from ...	1988	68
813	Feature Recognition Using Correlate Contained in Multiplle Neighbm%oods Andrea Califano Exploratory Computer Vision Croup IBM Thomas J. Watson Research Center PO Box 704, Yorktown Heights, NY 10598 Abstract Parameter transforms play a very important role in the recognition of geometric featur...	1988	69
814	eing Suspicious: Criti uing Problem Specifications Stephen Fickas and P. Nagarajan Computer Science Department University of Oregon Eugene, OR. 97403 Abstract One should look closely at problem specifications before attempting solutions: we may find that the specifier has only ...	1988	7
815	1. Performance of a System to Locate Address Blocks on Mail Pieces1 Ching-Huei Wang, Paul W. Palumbo and Sargur N. Srihari Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260 Abstract The objective of an Address Block Location System (ABLS) is to determ...	1988	70
816	Michael L. Brodie GTE Laboratori Incorporated Waltham, A 02254 brodie@gte.com (csnet) Abstract The effective application of AI Technology and the development of future computing systems require the integration of AI and Databas...	1988	71
817	HOW TO DRAW THREE PEOPLE IN A BOTANICAL GARDEN. Harold Cohen The University of California at San Diego Department of Visual Arts, La Jolla, Ca 92093 Abstract AARON is a program designed to investigate the cognitive principles underlying visual represen- tation. Under continuous...	1988	72
818	Investigations Into a Theory of Knowledge Base Revision: Preliminary Report Mukes h Dalal*t Rutgers University Department of Computer Science New Brunswick, NJ 08903 Abstract . A fundamental problem in knowledge representa- tion is how to revise knowledge when ne...	1988	73
819	Adding Number Restrictions to a Four-Valued Terminological Logic Peter F. Patel-Schneider Schlumberger Palo Alto Research 3340 Hillview Avenue Palo Alto, California 94304 Abstract An intuitive four-valued semantics can be used to develop expressively powerful terminological ...	1988	74
820	Normal Multimodal Logics Laurent Catach IBM Paris Scientific Center 3-5 Place VendBme, 75001 Paris, France Abstract This paper studies what we call normal multimodal logics, which are general modal systems with an arbitrary set of normal modal operators. We em- phasize th...	1988	75
821	A Logic for Hypothetical Reasoning Anthony J. Bonner Department of Computer Science Rutgers University New Brunswick, NJ 08903 Abstract This paper shows that classical logic is inappro- priate for hypothetical reasoning and develops an alternative logic for th...	1988	76
822	Robert M. Mac Gregor USC/Information Sciences Institute 4676 Admiralty Way, Suite 1001 Marina de1 Rey, CA 90292 macgreg@vaxa.isi.edu Abstract This paper describes the design of a pattern matcher for a knowledge representation system called LOOM....	1988	77
823	Lin Padgham LINKbING UNIVERSITY Department of Computer and Information Science S-581 83 Linkijping, Sweden Abstract Typing schemes which allow inheritance from super to sub types are a common way of representing information about the wo...	1988	78
824	1. Tractable Theories of Multiple Defeasible Inheritance In Ordinary onmonotonic Lo&s Brian A. Haugh Martin Marietta Laboratories 1450 South Rolling Road Baltimore, Maryland 21227 Abstract A suggestion by John McCarthy for general formulations of m...	1988	79
825	ic esi Mark F. Orelup Graduate Research Assistant John R. Dixon Professor Mechanical Design Automation Laboratory Department of Mechanical Engineering University of Massachusetts Amherst, MA 01003 This paper describes the meta-level control system of a program (Dominic...	1988	8
826	Mixing Strict and Defeasible Inheritance John F. Horty1T2 Richmond I%. Thomason lcomputer Science Department 2Philosophy Department Carnegie Mellon University University of Maryland Pittsburgh, PA 15213 College Park, MD 20742 31ntelligent Systems Program Un...	1988	80
827	Nonmonotonic Inheritance and Generic Reflexives David S. Touretzky Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 Abstract. Generic reflexive statements such as Elephants dove themselves have traditionally been formalized usi...	1988	81
828	eyornd HSA: Structures for PBausible antic Networks Paul R. Cohen and Cynthia L. Eoiselle Experimental Knowledge Systems Labora.tory Depaztment of computer and Information Science University of Massachusetts Amherst, Massachusetts Abstract We present ...	1988	82
829	Brian C. Williams * MIT Artificial Intelligence Lab 545 Technology Square Cambridge, MA 02139 Abstract The apparently weak properties of a qualitative algebra have lead some to conclude that we must turn instead to extra-mathematical properties of phy...	1988	83
830	ualitative Approach to echanical Constraint * Paul Nielsen Qualitative Reasoning Group Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue, Urbana, Illinois 61801 Abstract This paper provides a qualitative ...	1988	84
831	Global Filters for aviorsa 1 Peter Struss SIEMEMS Corp. ZrI INF 22 otto- 6 -8000 Muenc t Germany Abstract Current methods in qualitative physic sometimes predict behaviors of physical systems that do not correspond to any real- valued solution. One...	1988	85
832	Kenneth Man- MIT Artificial Intelligence Laboratory NE 43 - 438 545 Technology Square, Cambridge, MA 02139. Abstract Even with powerful numerical computers, explor- ing complex dynamical systems requires signifi- cant human effort and judgment to prepare sim- ulations and to in...	1988	86
833	Exaggeration Daniel S. Weld Computer Science Department, FR-35 University of Washington Seattle, WA 98195 Abstract Exaggeration is a technique for solving compar- ative analysis problems by considering extreme perturbations to a system. For example, e...	1988	87
834	uallitative Reasoning at Multi esolutions Seshashayee S. Murthy M T. J. W&son Research Center P.Q. Box 704 Yorktown Heights, NY 10598 Ah§tI%Nt In this paper we describe an approach to unify the various quantity spaces that have been proposed in qualitative reasoning with number...	1988	88
835	I A l( Setting up Large-Scale ualitative Models Brian Falkenhainer and Kenneth II. Forbus Qualitative Reasoning Group Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Abstract Avenue, Urbana, Illinbis 61...	1988	89
836	Andrew Gelman, Susan Altman, Matt Pallakoff, Ke GO, mce w Abstract FRM is an experimental, knowledge-based system that assists in the judgmental aspects of budget planning and financial resource management. Problem solving in this domain requires many kinds of...	1988	9
837	Formal Basis for Commonsense Abstraction of Dynamic Systems1 Uumi Iwasaki2 Computer Science Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Abstract Abstraction is an essential technique in reasoning about complex systems involving a large number of variab...	1988	90
838	Causal Ordering in a Yumi Iwasaki2 egartrnent of Corn Carnegie Mellon ittsburgh, Peunsylvania 15213 Abstract This paper describes a computational approach, based on the theory of causal ordering, for inferring causality from an acausal, formal description of a phenomena. Causal ordering...	1988	91
839	Controlling Qualitative Resolution Jean-Luc Dormoy Electricit de France Research Center Clamart, France LAFQRIA - Pierre & arie Curie Paris University Abstract We proposed earlier in [Dormoy & Raiman, 19881 a new way of reasoning about a device, we called “Assembling a Device”. Starting...	1988	92
840	Non-Intersection of Trajectories in Qualitative Phase Space: A Global Constraint for Qualitative Simulation* Wood W Lee and Benjamin J Kuipers Department of Computer Sciences University of Texas, Austin, Texas 78712 Abstract The QSIM algorithm is useful for predicting the ...	1988	93
841	Using Incomplete Quantitative KnswIedge in Qualitative Reasoning* Benjamin Kuipers and Daniel Berleant Department of Computer Sciences University of Texas, Austin, Texas 78712 email: kuipers@cs.utexas.edu or berleantQsally.utexas.edu Abstract Incomplete knowledge of the s...	1988	94
842	Function Sharing in Mechanical Design* Karl T. Ulrich and Warren P. Seering Massachusetts Institute of Technology Artificial Intelligence Laboratory Cambridge, Massachusetts, USA 02139 ulrich@hephaestus.ai.mit.edu, wps@hephaestus.ai.mit.edu Abstract Function sharing...	1988	95
843	From Kinematics to Shape: in up roach to Innovative Leo Joskowicz Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer Street, New York, NY 10012 Abstract We address the problem of designing the shape of solid objects...	1988	96
844	Assembling a Device Jean-Luc Dormoy Olivier Raiman Electricit de France Research Center I.B.M. Scientific Center Clamart, France LAFORIA Paris, France Pierre & Marie Curie Paris University Abstract We present here a new way of reasoning on a device based on structure, we call assembling...	1988	97
845	Sarosh Talukdar, Jim Rehg, Rob Woodbury, Albert0 Elfes Engineering Design Research Center Carnegie Mellon University Pittsburgh, PA 15213 Abstract Design systems can have considerable embedded value. Improvements in such systems are better achieved through upgrades than through complete repla...	1988	98
846	The Induction of Fault iagnosis Systems from uakitative S* D.A. Pearce The Turing Institute 36 North Hanover St, Glasgow, Scotland Abstract This paper describes a methodology for the auto- matic construction of diagnostic expert systems, and its application...	1988	99
847	Distributed Truth Maintenance David Murray Bridgeland and Michael N. Huhns Microelectronics and Computer Technology Corporation Artificial Intelligence Laboratory 3500 West Balcones Center Drive Austin, TX 78759-6509 bridgeland@mcc.com Abstract In this p...	1990	1
848	An Algebraic Approach to Conflict Resolution in Planning Qiang Yang * Department of Computer Science University of Waterloo Waterloo, Ont. Canada, N2L 3Gl qyang@watdragon.waterloo.edu Abstract This paper presents an algebra for conflict resolution in nonlinear ...	1990	10
849	An Experiment in Direct Knowledge Acquisition Peter W. Mullarkey Schlumberger Laboratory for Computer Science P.O. Box 200015, Austin, TX 78720-0015, U.S.A. mullarkey@slcs.slb.com Abstract LQMS is a knowledge-based system that identifies and explains anomalies in data acquir...	1990	100
850	Establishing the Coherence of an Explanation to Improve Refinement of an I complete Knowledge ase Young-Tack Park and David C. Wilkins Computer Science Department 405 North Mathews Ave. University of Illinois Urbana, Illinois 61801 Abstract The power of knowledge acqui...	1990	101
851	A Design Based Approach to Constructing Computational Solutions to Diagnostic Problems D. Volovik & I. A. Zualkernan Department of Computer Science University of Minnesota, Minneapolis, Minnesota USA P. E. Johnson Department of Information & Decision Sciences University of Minnesota, Mi...	1990	102
852	ase Niall Murtagh and Masarnichi Shimura Department of Computer Science, Tokyo Institute of Technology 2-12-1 0-okayama, Meguro-ku, Tokyo 152, JAPAN email: nia.llQcs.titech.ac.jp Abstract Conventional methods for the parametric design of engineering structures rely on the iterative re-u...	1990	103
853	Connectionism, Rule Following, and Symbolic Manipulatio Robert F. Wadley School of Computing Science Simon Fraser University Bumaby, Canada VSA lS6 hadley@cs.sfu.ca Abstract At present, the prevailing Connectionist methodology for representing rules is to implicitly embody rules in “neu...	1990	104
854	A Structured Connectionist Unification Algorithm Steffen Hiilldobler* International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, CA 94704, USA Ema& steffenQicsi.Berkeley.edu Abstract A connectionist unification algorithm is presented. It utiliz...	1990	105
855	E EXPRESSIVENESS NVA LES Rina Dechter (‘I Computer Science Department Technion -- Israel Institute of Technology Haifa, Israel, 32000 e-mail: dechter@techsel.bitnet units whose stable patterns, (relative to the visible units) coincide with the original relation. This task is central to mos...	1990	106
856	The Complexity of Closed World Reasoning and Circumscription Marco Cadoli, Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Universit A di Roma “La Sapienza” via Buonarroti 12, 00185 Roma, Italia Abstract Closed world reasoning is a common nonmono- tonic technique that a...	1990	107
857	ptimally Efficient Inference Syste Lokendra Shastri and Venkat Ajjanagadde Department of Computer & Information Science University of Pennsylvania Philadelphia, PA 19104, USA shastri@cis.upenn.edu Abstract This paper describes a knowledge representa- tion and reasoning system that performs a ...	1990	108
858	It’s Not My Default: The Corn lexity of Membership Problems i Restricted Propositional Default Logics Jonathan S tillman Artificial Intelligence Program General Electric Research and Development Center P.O. Box 8 Schenectady, N.Y. 12301 e-mail: stillman@crd.ge.com Abstract We investi...	1990	109
859	Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Ramin Zabih Computer Science Department Stanford University Stanford, California 94305 Abstract Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class...	1990	11
860	r Nonmo otonic Reasoning Hector Geffner hector@ibm.com T. J. Watson Research Center P. 0. Box 704, Room Hl-KlO Yorktown Heights, N.Y. 10598 Abstract C~vscsl theories are default theories which explicitly accommodate a distinction between ‘explained’ and ‘unexplained’ propositions....	1990	110
861	Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection Gerhard Lakemeyer Department of Computer Science University of Toronto Toronto, Ontario, Canada, M5S lA4 e-mail: gerhard@ai.toronto.edu Abstract Since knowledge bases (KBs) are usually ...	1990	111
862	Reasoning t No onotonic Leora Morgenstern leora@ibm.com IBM T.J. Watson Research P.O. Box 704, Mail Stop HlN08 Yorktown Heights, N.Y. 10598 (914)784-7151 Abstract This paper presents a formal theory of multiple agent non-monotonic reasoning. We introduce the subject of multiple...	1990	112
863	A Circumscriptive Theory for Causal and Evidential Support Eunok Paek Department of Computer Science Stanford University Stanford, California 94305 paek@cs.stanford.edu Abstract Reasoning about causality is an interesting applica- tion area of formal nonmonotonic theories. ...	1990	113
864	Conditional Logics of Normality as Modal Systems Craig Boutilier Department of Computer Science University of Toronto Toronto, Canada M5S lA4 Abstract Recently, conditional logics have been developed for ap- plication to problems in default reasoning. We present a uniform...	1990	114
865	the Scope of Reasoning: Preliminary Report David W. Etherington Artificial Intelligence Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 ether@research.att.com Sarit Kraus* Institute for Advanced Computer Studies Department of Computer Science University of Maryl...	1990	115
866	The Representation of Defaults in Cyc Ramanathan V. Guha MCC 3500 West Balcones Center Drive Austin, Texas, 78759-6509 guha@mcc.com Abstract This paper provides an account of the representa- tion of defaults in Cyc and their semantics in terms of first order logic with reificat...	1990	116
867	The Generalized Theory of Model Preference (Preliminary Report) Piotr Rychlik Institute of Computer Science Polish Academy of Sciences PKiN, 00-901 Warsaw, POLAND Abstract In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [...	1990	117
868	Terminological Cycles in KL-ONE-based Knowledge Representation Languages1 Franz Baader German Research Center for Artificial Intelligence Projektgruppe WINO, Postfach 2080 D-6750 Kaiserslautern, West Germany baade@uklirb.uucp Abstract Cyclic definitions are often prohibited in termin...	1990	118
869	On the Complexity of Monotonic Inheritance with Roles Ramiro A. de T. Guerreiro Andrea S. Hemerly Rio Scientific Center Rio Scientific Center IBM Brazil IBM Brazil P. 0. Box 4624 P.O. Box 4624 20.001, Rio de Janeiro, RJ 20.00 1, Rio de -Janeiro, R.J Yoav Shoham Computer S...	1990	119
870	Dynamic Constraint Satisfaction Sanjay Mittal and Brian Falkenhainer System Sciences Laboratory Xerox Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto CA 94304 Abstract Constraint satisfaction (CSP) is a powerful and exten- sively u...	1990	12
871	Boolean Extensions o Inheritance N&wo&s John F. Horty Philosophy Department and Institute for Advanced Computer Studies University of Maryland College Park, MD 20742 horty@umiacs.umd.edu Abstract Much of the theoretical research on nonmonotonic in- heritanc...	1990	120
872	A Temporal Terminological Logic* Albrecht Schmiedel Technische Universittit Berlin Sekr. FR 5-12, Projekt KIT-BACK Franklinstrafle 28/29 D-1000 Berlin 10, West-Germany schmied@dbOtuill.bitnet Abstract An attempt is made to integrate three well-known formalisms of knowledge r...	1990	121
873	A Maximum Entropy Approach to NOIl notonic Mois& Goldszmidt Paul Morris Judea Pearl moises@cs.ucla.edu morris~intellicorp.com judea@cs.ucla.edu Cognitive Systems Lab. Intellicorp Cognitive Systems Lab. University of California 1975 El Camino Real West University of ...	1990	122
874	A Hybrid Framework for Representing Uncertain Knowledge Alessandro Saffiotti* IRIDIA - Universit.e Libre de Bruxelles Av. F. Roosvelt 50 - CP 194/6 B-1050 Bruxelles - Belgium E-mail: rO1507@bbrbfuOl.bitnet Abstract This paper addresses the problem of bridging the gap be- tween the fi...	1990	123
875	A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning Institute for New l-4-28 Mita, Abstract This paper presents a formal relationship Ken Satoh Generation Computer Technology Minato-ku, Tokyo 108, Japan ksatoh@icot.jp for . probability theory and a class of nonmon...	1990	124
876	ILITIES T CE Haim Shvaytser (Schweitzer) SRI, David Sarnoff Research Center CN5300 Princeton, NJ 08543-5300 haim@vision.sarnoff .com Table 1: the four worlds of R and C world R C probability Wl FALSE FALSE Abstract A method is described for deriving ...	1990	125
877	Very Fast Decision Table Execution of Propositional Expert Systems Robert M. Colomb Charles Y.C. Chung CSIRO Division of Information Technology Box 1599 North Ryde NSW 2113 Australia colomb@syd.dit.csiro.au Abstract A formal equivalence between propositional expert systems and decision tables...	1990	126
878	The Intelligent Database Interface: Integrating AI and Database Systems Donald P. McKay and Timothy W. Finin and Anthony O’Hare* Unisys Center for Advanced Information Technology Paoli, Pennsylvania mckay@prc.unisys.com and finin@prc.unisys.com Abstract The Intelligent Database In...	1990	127
879	On the Performance of Lazy Matching in Production Systems Daniel I? Miranker, David A. Brant, Bernie Lofaso, David Gadbois *Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 ABSTRACT Production systems are an established method for encoding knowledge in an exp...	1990	128
880	A Framework for Investigating Production System Formulations with Polynomially Bounded Match Milind Tarnbe School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Abstract Real time constraints on AI systems require guaranteeing bounds on these systems’ performance. Howe...	1990	129
881	The Design of a Marker Passing Architecture for Knowledge Processing Wing Lee and Dan Moldovan Department of Electrical Engineering - Systems University of Southern California 90089- 1115 Los Angeles, California wlee@gringo.usc.edu, moldovan@gringo.usc.edu Abstract Knowle...	1990	13
882	A Principled Approach to Reasoning about the Specificity of John Yen Department of Computer Science Texas A&M University College Station, TX 77843 Yen@CSSUN.TAMU.EDU Abstract Even though specificity has been one of the most useful conflict resolution strategies for select...	1990	130
883	Weak Representations of Interval Algebras G&u-d Ligozat LIMSI, Universid Paris-Sud, B.P. 133 9 1403 Orsay Cedex, France ligozat@ fiiutoll .bitnet Abstract Ladkin and Maddux [LaMa87] showed how to interpret the calculus of time intervals defined by Allen [AZ2831 in terms of representations of ...	1990	131
884	A qualitative model for space Amitabha Mukerjee Gene Joe Department of Computer Science Texas A&M University College Station TX 77843-3112 Abstract Most geometric models are quantitative, making it diffiiult to abstract the underlying spatial information needed for tasks such as planning, ...	1990	132
885	Reasoning about Qualitative Temporal Information Peter van Beek Department of Computer Science1 University of Waterloo Waterloo, Ontario, CANADA NZL 3Gl pgvanbeek@dragon.waterloo.edu Abstract Interval and point algebras have been proposed for representing q...	1990	133
886	etric Constrai Systems Glenn A. Kramer School of Cognitive and Computing Sciences Schlumberger Laboratory for Computer Science* University of Sussex P.O. Box 200015 Brighton BNl 9&H, England Austin, Texas 78720-0015 gak@slcs.slb.com Abstract Finding the configurations of a set of rigid ...	1990	134
887	laini or ces to Create Useful Concepts for Evaluating States Richard C. Yee Sharad Saxena Paul E. Utgoff Andrew G. Barto Department of Computer and Information Science University of Massachusetts, Amherst, MA 01003 yee@cs.umass.edu, saxena@cs.umass.edu u...	1990	135
888	Effective Generalization of Relational Descriptions Larry Watanabe and Larry Rendell Beckman Institute and Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue, Urbana, Illinois 61801 U.S.A. watanabe@cs.uiuc.edu Abs...	1990	136
889	On Analytical and Similarity-Based Classification Marc Vilain, Phyllis Koton, and Melissa P. Chase The MITRE Corporation Burlington Road, Bedford, MA 01730 Internet: Abstract This paper is concerned with knowledge representation issues in machine learning. In particular, ...	1990	137
890	Refinement of Approximate Domain Theories by Knowledge-Based Neural Networks* Geoffrey G. Towel1 Jude W. Shavlik Michiel 0. Noordewier University of Wisconsin - Madison 1210 West Dayton Street Madison, Wisconsin 53706 Abstract Standard algorithms for explanation-...	1990	138
891	Adding Domain Knowledge to SBL through Feature Construction Christopher John Matheus* GTE Laboratories Incorporated 40 Sylvan Rd., Waltham MA 02254 cjml@bunny.gte.com Abstract This paper presents two methods for adding domain knowledge to similarity-based learning through featu...	1990	139
892	arallel synchronous James G. Schmolze and Suraj Goel Department of Computer Science Tufts University / Medford, MA 02155 / USA E-mail: schmolze@cs.tufts.edu Abstract To speed up production systems, many researchers have turned to parallel implementations. We describe ...	1990	14
893	Two Case St ies in Cost-Sensitive Co cquisition* Ming Tan and Jeffrey C. Schlimmer School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 tan@cs.cmu.edu, schlimmer@cs.cmu.edu Abstract This paper explores the problem of learning from exam- ples when feat...	1990	140
894	Incremental Non-Backtracking Focusing: A Polynomially Bounded Generalization Algorithm for Version Benjamin D. Smith University of Southern California Department of Computer Science Los Angeles, CA 90089-0782 benjamin@castor.usc.edu Abstract The candidate eliminatio...	1990	141
895	Complementary Discrimination Learning: uality between Generalizatio iscrimination Wei-Min Shen ACT/AI, MCC, 3500 West Balcones Center Drive Austin, TX 78759 wshen@mcc.com Abstract Although generalization and discrimination are commonly used together in machine...	1990	142
896	A Proven Domain-Independent Scientific Function-Finding Algorithm Cullen Schaffer Department of Computer Science Rutgers University 9 New Brunswick, NJ l 08903 201-932-4635 l schaffer@paul.rutgers.edu Abstract Programs such as Bacon, Abacus, Coper, Kepler and oth- ...	1990	143
897	Knowledge Level and Inductive Uses of Chunking (EBL) Paul S. Rosenbloom Information Sciences Institute University of Southern California 4676 Admiralty Way Marina de1 Rey, CA 90292 rosenbloom@isi.edu Abstract When explanation-based learning (EBL) is used for knowledge level lea...	1990	144
898	Changing the Rules: A Comprehensive pproach to T nernent* Dirk Ourston and Raymond J. Mooney Department of Computer Sciences University of Texas Austin, TX 78712 email: dirk@cs.utexas.edu, mooney@cs.utexas.edu Abstract This paper presents a comprehensive approach to...	1990	145
899	nduct ive ilist ic ai Yoichiro Nakakuki Yoshiyuki Koseki Midori Tanaka C&C Systems Research Laboratories, NEC Corp. 4-l-l Miyazaki, Miyamae-ku, Kawasaki 213 nakakuki%asl.cl.nec.co.jp@uunet.UU.NET JAPAN Abstract This paper describes an inductive learning method in proba...	1990	146

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.