Table of Contents

• A Tractable Class of Abduction ProblemsKave Eshghi. 3-8
• An Abductive Framework for General Logic Programs and other Nonmonotonic SystemsGerhard Brewka, Kurt Konolige. 9-17
• Critical ReasoningOlivier Raiman, Johan de Kleer, Vijay A. Saraswat. 18-23
• Focusing Construction and Selection of Abductive HypothesesDavid B. Leake. 24-31
• A New Logical framework for Deductive PlanningWerner Stephan, Susanne Biundo. 32-38
• Semantical and Computational Aspects of Horn ApproximationsMarco Cadoli. 39-45
• Automatic Generation of Some Results in Finite AlgebraMasayuki Fujita, John K. Slaney, Frank Bennett. 52-59
• Extending the Resolution Method with SortsChristoph Weidenbach. 60-65
• Proving Theorems in a Multi-Source EnvironmentLaurence Cholvy. 66-73
• Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5Ricardo Caferra, Stéphane Demri. 74-79
• First-Order Modal Logic Theorem Proving and Functional SimulationAndreas Nonnengart. 80-87
• Automatic Case Analysis in Proof by InductionAdel Bouhoula, Michaël Rusinowitch. 88-94
• Combining Induction Axioms by MachineChristoph Walther. 95-101
• Bottom-up Abduction by Model GenerationKatsumi Inoue, Yoshihiko Ohta, Ryuzo Hasegawa, Makoto Nakashima. 102-108
• SCOTT: A Model-Guided Theorem ProverJohn K. Slaney. 109-115
• Difference UnificationDavid A. Basin, Toby Walsh. 116-122
• On the Polynomial Transparency of ResolutionReinhold Letz. 123-131
• A Note on Backward Dual Resolution and Its Application to Proving Completeness of Rule-Based SystemsAntoni Ligeza. 132-137
• Exploiting Irrelevance Reasoning to Guide Problem SolvingAlon Y. Levy, Yehoshua Sagiv. 138-145
• Automated Trend Detection with Alternate Temporal HypothesesIra J. Haimowitz, Isaac S. Kohane. 146-151
• Exploiting Domain structure to Achieve Efficient Temporal ReasoningMike Williamson, Steve Hanks. 152-159
• Situation Recognition: Representation and AlgorithmsChristophe Dousson, Paul Gaborit, Malik Ghallab. 166-174
• ANTLIMA - A Listener Model with Mental ImagesJörg R. J. Schirra, Eva Stopp. 175-180
• AI Models as a Variety of Psychological ExplanationKieron O Hara, Nigel Shadbolt. 188-193
• Using the Affective Reasoner to Support Social SimulationsClark Elliott. 194-201
• A Computational Model of Tractable Reasoning - Taking Inspiration from CognitionLokendra Shastri. 202-207
• Dynamic Memories: Analysis of an Integrated Comprehension and Episodic Memory Retrieval ModelTrent E. Lange, Charles M. Wharton. 208-216
• Bidirectional Best-First Search with Bounded Error: Summary of ResultsAndreas L. Köll, Hermann Kaindl. 217-223
• When Functional and Bijective Constraints Make a CSP PolynomialPhilippe David. 224-231
• Consistency Techniques for Numeric CSPsOlivier Lhomme. 232-238
• Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPsRichard J. Wallace. 239-247
• Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction ProblemsEugene C. Freuder, Paul D. Hubbe. 254-261
• Domain Filtering can Degrade Intelligent Backtracking SearchPatrick Prosser. 262-267
• Optimistic Parallel biscrete RelaxationKinson Ho, Paul N. Hilfinger, Hans W. Guesgen. 268-275
• Diagnosing and Solving Over-Determined Constraint Satisfaction ProblemsR. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognum. 276-281
• Exploiting Interchangeabilities in Constraint-Satisfaction ProblemsAlois Haselböck. 282-289
• Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability ProblemsBart Selman, Henry A. Kautz. 290-295
• Satisfiability of Boolean Formulas over Linear ConstraintsHenri Beringer, Bruno De Backer. 296-304
• Agents Habitats and Routine BehaviorRichard Alterman, Roland Zito-Wolf. 305-310
• Learning to Coordinate Actions in Multi-Agent-SystemsGerhard Weiss. 311-317
• Liveness and Fairness Properties in Multi-Agent SystemsHans-Dieter Burkhard. 325-331
• Enhancing Performance of Cooperating Agents in Real-Time Diagnostic SystemsUrsula M. Schwuttke, Alan G. Quan. 332-337
• A Collaboration Mechanism on Positive Interactions in Multi-agent EnvironmentsKei Matsubayashi, Mario Tokoro. 346-351
• A Scheme for Agent Collaboration in Open Multiagent EnvironmentsEiichi Osawa. 352-359
• An Approach to Analyzing the Need for Meta-Level CommunicationKeith Decker, Victor R. Lesser. 360-366
• Collaborative Plans for Group ActivitiesBarbara J. Grosz, Sarit Kraus. 367-375
• All They Know: A Study in Multi-Agent Autoepistemic ReasoningGerhard Lakemeyer. 376-381
• Epistemic Extension of Propositional Preference LogicsJacques Wainer. 382-389
• A Representationalist Theory of IntentionKurt Konolige, Martha E. Pollack. 390-395
• Elements of a Utilitarian Theory of Knowledge and ActionPiotr J. Gmytrasiewicz, Edmund H. Durfee. 396-403
• Oz - A Programming Language for Multi-Agent SystemsMartin Henz, Gert Smolka, Jörg Würtz. 404-409
• W - A Logic System Based on the Shared Common Knowledge ViewsXianchang Wang, Huowang Chen, Quingping Zhao, Wei Li. 410-415
• A Domain Theory for Task Oriented NegotiationGilad Zlotkin, Jeffrey S. Rosenschein. 416-422
• Multi-Agent Planning as a Dynamic Search for Social ConsensusEithan Ephrati, Jeffrey S. Rosenschein. 423-431
• Understanding the Role of Negotiation in Distributed Search Among Heterogereous AgentsSusan E. Lander, Victor R. Lesser. 438-446
• Classification Networks: A Knowledge Representation Scheme for Curriculum PrescriptionKwok-Keung Yum, Thomas J. Richards. 447-452
• Constraint Based Automatic Construction and Manipulation of Geometric FiguresRichard Allen, Jeanne Idt, Laurent Trilling. 453-459
• PHI - A Logic-Based Tool for Intelligent Help SystemsMathias Bauer, Susanne Biundo, Dietmar Dengler, Jana Koehler, Gabriele Paul. 460-466
• Nonmonotonic Model Inference-A Formalization of Student ModelingMitsuru Ikeda, Yasuyuki Kono, Riichiro Mizoguchi. 467-476
• Expert System Validation through Knowledge Base RefinementPedro Meseguer. 477-482
• Test Case Generation using KBS StrategyLaurence Vignollet, Ruddy Lelouche. 483-489
• Off-line Reasoning for On-line EfficiencyYoram Moses, Moshe Tennenholtz. 490-495
• TREE: the Heuristic Driven Join Strategy of a RETE-Like MatcherJacques Bouaud. 496-503
• A Class Library Implementation of a Principled Open Architecture Knowledge Representation Server with Plug-in Data TypesBrian R. Gaines. 504-509
• Specification and Generation of Custom-Tailored Knowledge-Acquisition ToolsHenrik Eriksson. 510-518
• The Complexity of Nested Counterfactuals and Iterated Knowledge Base RevisionsThomas Eiter, Georg Gottlob. 526-533
• Syntactic Characterizations of Belief Change OperatorsAlvaro del Val. 540-547
• Non-Omniscient Belief as Context-Based ResoningFausto Giunchiglia, Luciano Serafini, Enrico Giunchiglia, Marcello Frixione. 548-554
• Notes on Formalizing ContextJohn McCarthy. 555-562 [doi]
• Statistical Foundations for Default ReasoningFahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller. 563-569
• The Power of Beliefs or Translating Default Logic into Standard Autoepistemic LogicGeorg Gottlob. 570-577
• On the Semantics of Supernormal DefaultsStefan Brass. 578-583
• Preference-Based Semantics for Nonmonotonic LogicsFrans Voorbraak. 584-591
• Generalization of the Dempster-Shafer TheoryJ. W. Guan, David A. Bell. 592-597
• Quantifying Beliefs by Belief Functions: An Axiomatic JustificationPhilippe Smets. 598-605
• Average-Case Analysis of a Search Algorithm for Estimating Prior and Posterior Probabilities in Bayesian Networks with Extreme ProbabilitiesDavid Poole. 606-612
• On the Hardness of Approximate ReasoningDan Roth. 613-619
• Belief Revision and Updates in Numerical Formalisms: An Overview, with new Results for the Possibilistic FrameworkDidier Dubois, Henri Prade. 620-625
• Second Order Measures for Uncertainty ProcessingZdenek Zdráhal. 626-633
• Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive InformationThomas Eiter, Georg Gottlob, Yuri Gurevich. 634-639
• Inconsistency Management and Prioritized Syntax-Based EntailmentSalem Benferhat, Claudette Cayrol, Didier Dubois, Jérôme Lang, Henri Prade. 640-647
• Path Consistency in a Network of Non-Convex IntervalsRobert A. Morris, William D. Shoaff, Lina Khatib. 655-661
• A Terminological Logic with Defaults: A Definition and an ApplicationLin Padgham, Tingting Zhang. 662-668
• How to Prefer More Specific Defaults in Terminological Default LogicFranz Baader, Bernhard Hollunder. 669-675
• Default Inheritance Reasoning in Hybrid KL-ONE-Style LogicsUmberto Straccia. 676-681
• More Notes on A Clash of Intuitions R. Al-Asady, A. Narayanan. 682-689
• A Multi-Dimensional Terminological Knowledge Representation LanguageHans Jürgen Ohlbach. 690-695
• Using Classification as a Programming LanguageChris Mellish, Ehud Reiter. 696-703
• Decidable Reasoning in Terminological Knowledge Representation SystemsMartin Buchheit, Francesco M. Donini, Andrea Schaerf. 704-709
• The Equivalence of Model-Theoretic and Structural Subsumption in Description LogicsRobert Dionne, Eric Mays, Frank J. Oles. 710-717
• Reasoning About Persistence: A Theory of ActionsYan Zhang, Norman Y. Foo. 718-723
• Soundness and Completeness Theorems for Three Formalizations of ActionG. Neelakantan Kartha. 724-731
• Deriving Properties of Belief Update from Theories of Action (II)Alvaro del Val, Yoav Shoham. 732-737
• The Range of Applicability of Nonmonotonic Logics for the Inertia ProblemErik Sandewall. 738-746
• Social Knowledge and Social Action: Heterogeneity in PracticeLes Gasser. 751-757
• Artificial Thought and Emergent MindIvan M. Havel. 758-766
• Vision Based Robot Behavior: Tools and Testbeds for Real-World AI ResearchHirochika Inoue. 767-773
• The Intelligent Hand: An Experimental Approach to Human Object Recognition and Implications for Robotic DesignSusan J. Lederman. 774-785
• Toward Flexible Intelligence: MITI s New Program of Real World ComputingNobuyuki Otsu. 786-791
• Consenting Agents: Negotiation Mechanisms for Multi-Agent SystemsJeffrey S. Rosenschein. 792-799
• Conceptual Design and Artificial IntelligenceDevika Subramanian. 800-809
• The Logic of Cognitive ActionJohan van Benthem. 810-812
• Computers and Thought Award : Challenges of Massive ParallelismHiroaki Kitano. 813-834
• A Language for Implementing Arbitrary LogicsMark Tarver. 839-844
• On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic ProgrammingPhan Minh Dung. 852-859
• A Metalogic Programming Approach to Reasoning about Time in Knowledge BasesSuryanarayana M. Sripada. 860-865
• A Parameterised Module System for Constructing Typed Logic ProgramsPatricia M. Hill. 874-880
• Logical Specification of Real-Time Granular Systems in an Object Oriented LanguageEmanuele Ciapessoni, Edoardo Corsetti, Manlio Migliorati, Elena Ratto. 881-888
• Average-Case Analysis of a Nearest Neighbor AlgorithmPat Langley, Wayne Iba. 889-894
• Estimating the Accuracy of Learned ConceptsTimothy L. Bailey, Charles Elkan. 895-901
• Case Retrieval through Multiple Indexing and Heuristic SearchEdwina L. Rissland, David B. Skalak, M. Timur Friedman. 902-908
• Retrieving Cases from Relational Data-Bases: Another Stride Towards Corporate-Wide Case-Base SystemsHideo Shimazu, Hiroaki Kitano, Akihiro Shibata. 909-915
• Abstraction via Approximate SymmetryThomas Ellman. 916-921
• An Analytic Learning System for Specializing HeuristicsSteven Minton. 922-929
• Integrating Inductive Neural Network Learning and Explanation-Based LearningSebastian Thrun, Tom M. Mitchell. 930-936
• SMART+: A Multi-Strategy Learning ToolMarco Botta, Attilio Giordana. 937-945
• Improving the Design of Induction Methods by Analyzing Algorithm Functionality and Data-Based Concept ComplexityLarry A. Rendell, Harish Ragavan. 952-959
• Evolutionary Learning Strategy using Bug-Based SearchHitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisuke Sato. 960-966
• Genetic State-Space Search for Constrained Optimization ProblemsJan Paredis. 967-973
• Learning of Resource Allocation Strategies for Game PlayingShaul Markovitch, Yaron Sella. 974-979
• Reducing Ambiguity by Learning Assembly Specific BehaviourBert Bredeweg, Cis Schut. 980-987
• Efficient Pruning Methods for Separate-and-Conquer Rule Learning SystemsWilliam W. Cohen. 988-994
• Learning Decision Lists over Tree Patterns and Its ApplicationSatoshi Kobayashi, Koichi Hori, Setsuo Ohsuga. 995-1001
• Induction of Oblique Decision TreesDavid G. Heath, Simon Kasif, Steven Salzberg. 1002-1007
• TDIS : an Algebraic FormalizationJean-Gabriel Ganascia. 1008-1015
• Decision Trees in Numerical Attribute SpacesThierry Van de Merckt. 1016-1021
• Constructive Inductive Logic ProgrammingStephane Lapointe, Charles X. Ling, Stan Matwin. 1030-1036
• Multiple Predicate LearningLuc De Raedt, Nada Lavrac, Saso Dzeroski. 1037-1043
• An Interactive System to Learn Functional Logic ProgramsFrancesco Bergadano, Daniele Gunetti. 1044-1049
• Avoiding Pitfalls When Learning Recursive TheoriesR. Mike Cameron-Jones, J. Ross Quinlan. 1050-1057
• A Theory of Clausal DiscoveryLuc De Raedt, Maurice Bruynooghe. 1058-1063
• HYDRA: A Noise-tolerant Relational Concept Learning AlgorithmKamal M. Ali, Michael J. Pazzani. 1064-1071
• Rule-Based RegressionSholom M. Weiss, Nitin Indurkhya. 1072-1078
• The Statistical Learning of Accurate HeuristicsAnna Bramanti-Gregor, Henry W. Davis. 1079-1087
• Learning to Achieve GoalsLeslie Pack Kaelbling. 1094-1099
• An Inductive Approach to Learning Search Control Rules for PlanningChristopher Leckie, Ingrid Zukerman. 1100-1105
• Combining FOIL and EBG to Speed-up Logic ProgramsJohn M. Zelle, Raymond J. Mooney. 1106-1113
• Recurrent Neural Networks for Sequence ProductionJoachim Diederich, Markus Wasserschaff. 1114-1119
• Sequence ExtrapolationPhilip D. Laird, Ronald Saul. 1120-1127
• A Methodology for Evaluating Theory Revision Systems: Results with Audrey IIJames Wogulis, Michael J. Pazzani. 1128-1134
• Symbolic Revision of Theories with M-of-N RulesPaul T. Baffes, Raymond J. Mooney. 1135-1142
• A Symbolic Model for Learning the Past-Tenses of English VerbsCharles X. Ling, Steven Cherwenka, Marin Marinov. 1143-1149
• Verbal Case Frame Acquisition from Bilingual Corpora1150-1157
• Automatic Documentation Generation: The Rnteraction of Text and ExamplesVibhu O. Mittal, Cécile Paris. 1158-1163
• Optimizing the Costs and Benefits of Natural Language GenerationEhud Reiter, Chris Mellish. 1164-1171
• Hypothetically Speaking Default Reasoning and Discourse-StructureAndrew Csinger, David Poole. 1179-1185
• Abduction and Dynamic Preference in Plan-Based Dialogue UnderstandingKatashi Nagao. 1186-1192
• Joint Utterance: Intrasentential Speaker/Hearer Switch as an Emergent PhenomenonKôiti Hasida, Katashi Nagao, Takashi Miyata. 1193-1201
• Generating Concise Discourse that Addresses a Users InferencesIngrid Zukerman, Richard McConachy. 1202-1207
• Preferences for Model Selection in ExplanationDaniel D. Suthers. 1208-1215
• For an Incremental Computation of Intrasentential CoreferencePaola Merlo. 1216-1221
• Tense and Aspect: A Mereological ApproachEnrico Franconi, Alessandra Giorgi, Fabio Pianesi. 1222-1229
• Using Device Models to Facilitate the Retrieval of Multimedia Design InformationCatherine Baudin, Jody Gevins Underwood, Vinod Baya. 1237-1245
• Decision-Theoretic Salience Interactions in Language GenerationT. Pattabhiraman, Nick Cercone. 1246-1252
• Structure and Rules in Automated Multimedia Presentation PlanningYigal Arens, Eduard H. Hovy, Susanne van Mulken. 1253-1261
• Understanding Spoken Natural Language with Omni-Directional Information FlowKatashi Nagao, Kôiti Hasida, Takashi Miyata. 1268-1275
• A Comprehensive and Practical Model of Memory-Based Machine TranslationHiroaki Kitano. 1276-1282
• Example-Based Machine Translation on Massively Parallel ProcessorsEiichiro Sumita, Kozo Oi, Osamu Furuse, Hitoshi Iida, Tetsuya Higuchi, Naoto Takahashi, Hiroaki Kitano. 1283-1289
• Approximating Maximum-Entropy Ratings for Evidential Parsing and Semantic InterpretationDekai Wu. 1290-1296
• Meeting the Interlocking Needs of LF-Computation Deindexing and Inference: An Organic Approach to General NLUChung Hee Hwang, Lenhart K. Schubert. 1297-1303
• Learning to Represent Codons: A Challenge Problem for Constructive InductionMark Craven, Jude W. Shavlik. 1319-1324
• Massively Parallel Support for Efficient Knowledge RepresentationMatthew P. Evett, William A. Andersen, James A. Hendler. 1325-1331
• Computing Effect-to-Cause/Cause-to-Effect Diagnoses Within NdLBéchir el Ayeb, Shengrui Wang. 1332-1338
• Source Code Informal Information Analysis Using Connectionist ModelsEttore Merlo, Ian McAdam, Renato de Mori. 1339-1345
• Spatial Reasoning and Connectionist InferenceAntje Beringer, Steffen Hölldobler, Franz J. Kurfess. 1352-1359
• Heuristically Expanding Knowledge-Based Neural NetworksDavid W. Opitz, Jude W. Shavlik. 1360-1365
• Dynamic Conflict Resolution in a Connectionist Rule-Based SystemClayton McMillan, Michael Mozer, Paul Smolensky. 1366-1373
• Characterizing and Automatically Finding Primary Effects in PlanningEugene Fink, Qiang Yang. 1374-1379
• Characterizing Subgoal Interactions for PlanningAnthony Barrett, Daniel S. Weld. 1388-1393
• Planning Using Multiple Execution Architectures1394-1401
• Anytime Sensing Planning and Action: A Practical Model for Robot ControlShlomo Zilberstein, Stuart J. Russell. 1402-1407
• Informedness vs. Computational Cost of Heuristics in Iterative Repair SchedulingMonte Zweben, Eugene Davis, Brian Daun, Michael Deale. 1416-1422
• Non-Order-Preserving Evaluation Functions: Recursive Graph-Search Methods for Job Sequencing ProblemsAnup K. Sen, Amitava Bagchi. 1423-1429
• Complexity Results for SAS+ PlanningChrister Bäckström, Bernhard Nebel. 1430-1435
• Plan Modification versus Plan Generation: A Complexity-Theoretic PerspectiveBernhard Nebel, Jana Koehler. 1436-1444
• Compositional Model-Based DesignPrasanta K. Bose, Shankar A. Rajamoney. 1445-1450
• Computer-Aided Creative Mechanism DesignBoi Faltings, Kun Sun. 1451-1459
• Diagnosis Process Dynamics: Holding the Diagnostic Trackhound in LeashClaudia Böttcher, Oskar Dressler. 1460-1465
• Theory Diagnoses: A Concise Characterization of Faulty SystemsGerhard Friedrich. 1466-1473
• A Formal Modeling Scheme for Continuous Systems: Focus on DiagnosisGautam Biswas, Xudong Yu. 1474-1479
• Diagnosis of Communicating Systems: Dealing with Incompleteness and UncertaintyMarc Riese. 1480-1487
• Goal-Directed Diagnosis-Diagnostic Reasoning in Exploratory-Corrective DomainsRon Rymon. 1488-1493
• Model-Based Diagnosis Meets Error Diagnosis in Logic ProgramsLuca Console, Gerhard Friedrich, Daniele Theseider Dupré. 1494-1501
• Machine-generated Explanations of Engineering Models: A Compositional Modeling ApproachThomas R. Gruber, Patrice O. Gautier. 1502-1508
• Symbolic Reasoning with Relative Orders of MagnitudePhilippe Dague. 1509-1515
• How Things are Intended to Work: Capturing Functional Knowledge in Device DesignYumi Iwasaki, Richard Fikes, Marcos Vescovi, B. Chandrasekaran. 1516-1522
• Prioritising Behaviours in Qualitative SimulationRoy Leitch, Qiang Shen. 1523-1529
• Fuzzy Causal Simulation in Process EngineeringKouamana Bousson, Louise Travé-Massuyès. 1536-1543
• Orientation and Qualitative Angle for Spatial ReasoningLongin Jan Latecki, Ralf Röhrig. 1544-1549
• Towards an Integrated Logic of Space, Time and MotionAntony Galton. 1550-1557
• Qualitative Modeling of RNA StructureKyungsook Han, Andrew Gelsey. 1558-1563
• Active Color Image Analysis for Recognizing ShadowsGareth Funka-Lea, Ruzena Bajcsy. 1573-1578
• Selective Attention in Dynamic VisionRichard J. Howarth, Hilary Buxton. 1579-1585
• Homing Using Combinations of Model ViewsRonen Basri, Ehud Rivlin. 1586-1591
• Dynamic Trajectory Planning Path-Velocity Decomposition and Adjacent PathsThierry Fraichard, Christian Laugier. 1592-1599
• Qualitative Recognition of Ongoing Human Action SequencesYasuo Kuniyoshi, Hirochika Inoue. 1600-1609
• Rule-Structured Facial Animation SystemCatherine Pelachaud, Marie-Luce Viaud, Hussein Yahia. 1610-1617
• An Uncertainty Model of Stereo Vision and its Application to Vision-Motion Planning of RobotJun Miura, Yoshiaki Shirai. 1618-1623
• Recognizing 3-D MotionCornelia Fermüller, Yiannis Aloimonos. 1624-1631
• Making Cognitive Map of Outdoor EnvironmentSaburo Tsuji, Shigang Li. 1632-1638
• Using Local Information in a Non-Local Way for Mapping Graph-Like WorldsGregory Dudek, Paul Freedman, Souad Hadjres. 1639-1647
• Map Validation and Self-location in a Graph-like WorldGregory Dudek, Michael R. M. Jenkin, Evangelos E. Milios, David Wilkes. 1648-1653
• Memory-Based NavigationBruno Crespi, Cesare Furlanello, Luigi Stringa. 1654-1660
• Action Representation and Purpose: Re-evaluating the Foundations of Computational VisionMichael J. Black, Yiannis Aloimonos, Christopher M. Brown, Ian Horswill, Jitendra Malik, Giulio Sandini, Michael J. Tarr. 1661-1666
• AI Multimedia and EducationRoger C. Schank, Glorianna Davenport, P. Ghislandi, James C. Spohrer, Kathleen Wilson. 1667-1672
• Fuzzy Logic and AIJohn Yen, Piero P. Bonissone, Didier Dubois, Christian Freksa, Ramon López de Mántaras, Enrique H. Ruspini, Lotfi A. Zadeh. 1673-1676
• Grand Challenge AI ApplicationsHiroaki Kitano, Walther von Hahn, Lawrence Hunter, Ryuichi Oka, Benjamin W. Wah, Toshio Yokoi. 1677-1683
• Instructions: Language and BehaviorBonnie L. Webber, Barbara J. Grosz, Shigeoki Hirai, Thomas Rist, Donia Scott. 1684-1689
• TELECOM and AI: The Emperors New Clothes?Franz Barachini, Fumio Hattori, Georg Pauthner, Werner Remmele, Gregg T. Vesonder. 1690-1692
• The Use of Geons for Generic 3D Object RecognitionSven J. Dickinson, Robert Bergevin, Irving Biederman, Jan-Olof Eklundh, Roger Munck-Fairwood, Alex Pentland. 1693-1702
• QUALTES: A Domain Specific Tool for Electric Power StationsTsunehiko Suzuki, Ryuji Kudo, Katsunori Ikami, Kentaro Iida, Takao Terano. 1703-1703
• Spoken Language Translation SystemGen-ichiro Kikui, Mark Seligman, Toshiyuki Takezawa, Masami Suzuki, Kenji Kita, Tsuyoshi Morimoto, Masaaki Nagata, Toshihisa Tashiro, Herbert Tropf, Shigeki Sagayama, Jun-ichi Takami, Kazumi Ohkura, Akira Kurematsu. 1705-1705