Table of Contents

• Symbols and Subsymbols for Representing Knowledge: A Catalogue RaisonnéMarcello Frixione, Giuseppe Spinelli, Salvatore Gaglio. 3-7
• A Symbol Is Not a SymbolNils Dahlbäck. 8-14
• Parallel Iterative A* Search: An Admissible Distributed Heuristic Search AlgorithmShie-rei Huang, Larry S. Davis. 23-29
• Correct Parallel Status Assignment for the Reason Maintenance SystemRosanne M. Fulcomer, William E. Ball. 30-35
• Single-Agent Parallel Window Search: A Summary of ResultsCurt Powley, Richard E. Korf. 36-41
• Searching Game Trees in Parallel Using SSSSubir Bhattacharya, Amitava Bagchi. 42-47
• Platypus: A Constraint-Based Reasoning SystemWilliam S. Havens, Paul Stephen Rehfuss. 48-53
• Domain Dependence in Parallel Constraint SatisfactionPaul R. Cooper, Michael J. Swain. 54-59
• A Universal Programming LanguageHans W. Guesgen. 60-65
• Explaining Prolog Based Expert Systems Using a Layered Meta-InterpreterLeon Sterling, L. Ümit Yalçinalp. 66-71
• Simulation of Hybrid Circuits in Constraint Logic ProgrammingThomas Graf, Pascal Van Hentenryck, Claudine Pradelles, Laurent Zimmer. 72-77
• An Evaluation of DRete on CUPlD for OPSS MatchingMichael A. Kelly, Rudolph E. Seviora. 84-90
• The Search Ahead Conflict Resolution for Parallel Firing of Production SystemsChinh-Chi Hsu, Feng-Hsu Wang. 91-96
• A Technique for Customizing Object-Oriented Knowledge Representation Systems, With An Application to Network Problem ManagementLisiane Goffaux, Robert Mathonet. 97-103
• Contexts: Dynamic Identification of Common Parameters in Distributed Analysis of Complex DevicesSanjaya Addanki, Roberto Cremonini, J. Scott Penberthy. 104-109
• A Knowledge-Based Software Information SystemPremkumar T. Devanbu, Peter G. Selfridge, Bruce W. Ballard, Ronald J. Brachman. 110-115
• Chart Parsing of FlowgraphsRudi Lutz. 116-121
• Call-Graph Caching: Transforming Programs into NetworksMark Perlin. 122-128
• A New Metaphor for the Graphical Explanation of Forward-Chaining Rule ExecutionJohn Domingue, Marc Eisenstadt. 129-134
• Reconstructive Explanation: Explanation as Complex Problem SolvingMichael R. Wick, William B. Thompson. 135-140
• Adaptation-Based Explanation: Extending Script/Frame Theory to Handle Novel InputAlex Kass. 141-150
• A Vectorization Technique for Prolog without ExplosionYasusi Kanada, Masahiro Sugaya. 151-156
• Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed BacktrackingNikos Drakos. 157-162
• Unsupervised Learning by Backward InhibitionTomas Hrycej. 170-175
• On Multi-Layered Connectionist Models: Adding Layers vs. Increasing WidthChung-Jen Ho. 176-179
• Generation, Local Receptive Fields and Global Convergence Improve Perceptual Learning in Connectionist NetworksVasant Honavar, Leonard Uhr. 180-185
• Beyond PDP: The Frequency Modulation Neural Network ArchitectureHideto Tomabechi, Hiroaki Kitano. 186-192
• Experiences Implementing a Parallel ATMS on a Shared-Memory MultiprocessorEdward Rothberg, Anoop Gupta. 199-205
• The ELINT Application on Poligon: The Architecture and Performance of a Concurrent Blackboard SystemJames Rice. 212-220
• The Implementation of Expert, Knowledge-Based SystemsJohn K. Debenham. 221-226
• Knowledge Base CompilationF. D. Highland, Christine T. Iwaskiw. 227-232
• Rapid Retrieval Algorithms for Case-Based ReasoningRichard H. Stottler, Andrea L. Henke, James A. King. 233-237
• Minimizing Response Times in Real Time Planning and SearchShashi Shekhar, Soumitra Dutta. 238-242
• Intelligent Monitoring and ControlBarbara Hayes-Roth, Richard Washington, Rattikorn Hewett, Micheal Hewett, Adam Seiver. 243-249
• Input Data Management in Real-Time AI SystemsRichard Washington, Barbara Hayes-Roth. 250-255
• Real-Time AI Systems: A Definition and An ArchitectureRajendra T. Dodhiawala, N. S. Sridharan, Peter Raulefs, Cynthia Pickering. 256-264
• Node Aggregation for Distributed Inference in Bayesian NetworksKuo-Chu Chang, Robert M. Fung. 265-270
• Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction ProblemsRina Dechter, Itay Meiri. 271-277
• Partial Constraint SatisfactionEugene C. Freuder. 278-283
• An Algebraic Approach to Constraint Satisfaction ProblemsIgor Rivin, Ramin Zabih. 284-289
• A Comparison of ATMS and CSP TechniquesJohan de Kleer. 290-296
• Fast Recursive Formulations for Best-First Search That Allow Controlled Use of MemoryAnup K. Sen, Amitava Bagchi. 297-302
• Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New TechniqueHenry W. Davis, Anna Bramanti-Gregor, Xiaoteng Chen. 303-308
• Constrained Heuristic SearchMark S. Fox, Norman M. Sadeh, Can A. Baykan. 309-315
• Multi-Dimensional Heuristic SearchingPeter C. Nelson, Lawrence J. Henschen. 316-321
• The Reason for the Benefits of Minimax SearchAnton Scheucher, Hermann Kaindl. 322-327
• Generalized Game TreesRichard E. Korf. 328-333
• On Optimal Game-Tree Search using Rational Meta-ReasoningStuart J. Russell, Eric Wefald. 334-340
• Conspiracy Numbers and Caching for Searching And/Or Trees and Theorem-ProvingCharles Elkan. 341-348
• Preprocessing Search Spaces for Branch and Bound SearchQiang Yang, Dana S. Nau. 349-353
• And-Or Graphs Applied to RUE ResolutionVincent J. Digricoli, James J. Lu, V. S. Subrahmanian. 354-358
• A Rational Reconstruction and Extension of Recursion AnalysisAlan Bundy, Frank van Harmelen, Jane Hesketh, Alan Smaill, Andrew Stevens. 359-365
• Recognizing Unnecessary InferenceDan Benanav. 366-371
• Abstract Theorem ProvingFausto Giunchiglia, Toby Walsh. 372-377
• Structuring Computer Generated ProofsChristoph Lingenfelder. 378-383
• Program Derivation Using AnalogyMehdi T. Harandi, Sanjay Bhansali. 389-394
• Logic Programming with General Clauses and Defaults Based on Model EliminationMarco A. Casanova, Ramiro A. de T. Guerreiro, Andrea Silva. 395-400
• Reducing the Derivation of Redundant Clauses in Reasoning SystemsRolf Socher-Ambrosius. 401-406
• Explanation Based Program TransformationMaurice Bruynooghe, Luc De Raedt, Danny De Schreye. 407-412
• The Specialization and Transformation of Constructive Existence ProofsPeter Madden. 413-418
• On Wu s Method for Proving Constructive Geometric TheoremsDongming Wang. 419-424
• On the Decidability of Formulae Involving Continuous and Closed FunctionsDomenico Cantone, Eugenio G. Omodeo. 425-430
• An Approximate Solver for Symbolic EquationsElisha Sacks. 431-434
• Lock, Linear Lambda-Paramodulation in Operator Fuzzy LogicXuhua Liu. 435-440
• Modal Theorem Proving: An Equational ViewpointYves Auffray, Patrice Enjalbert. 441-445
• How to Represent Opaque Sentences in First Order LogicBijan Arbab. 458-462
• A Theorem Prover for Prioritized CircumscriptionAndrew B. Baker, Matthew L. Ginsberg. 463-467
• Circumscribing EqualityPeter K. Rathmann, Marianne Winslett. 468-476
• A Computational Framework for Granularity and its Application to Educational DiagnosisJim E. Greer, Gordon I. McCalla. 477-482
• The Generation of Critical Problems by Abstract Interpretations of Student ModelsRick Evertsz. 483-488
• Generating Causal Explanation from a Cardio-Vascular SimulationSarah A. Douglas, Zheng-Yang Liu. 489-496
• Focus of Control Through Goal RelationshipsVictor R. Lesser, Daniel D. Corkill, Robert Whitehair, J. A. Hernandez. 497-503
• Opportunistic MemoryKristian J. Hammond. 504-510
• An Adaptive Model of Decision-Making in PlanningGregg Collins, Lawrence Birnbaum, Bruce Krulwich. 511-516
• Argumentation: Planning Other Agents PlansKatia P. Sycara. 517-523
• Combining Case-Based and Rule-Based Reasoning: A Heuristic ApproachEdwina L. Rissland, David B. Skalak. 524-530
• Generating Facts From Opinions with Information Source ModelsMartin Thost. 531-536
• Defining Salience in Case-Based ArgumentsKevin D. Ashley. 537-542
• Simulating Student ProgrammersJames C. Spohrer, Elliot Soloway. 543-549
• The Correction Machine: Formulating Explanations for User MisconceptionsAlex Quilici. 550-555
• Learning to Diagnose by DoingJayant Kalagnanam, Eswaran Subrahmanian. 556-561
• Focusing Attention for Observational Learning: The Importance of ContextJoel D. Martin. 562-567
• Neural-Net Implementation of Complex Symbol-Processing in a Mental Model Approach to Syllogistic ReasoningJohn A. Barnden. 568-573
• A Probabilistic Approach to Marker PropagationDekai Wu. 574-582
• Automated Synthesis of Constrained GeneratorsWesley Braudaway, Chris Tong. 583-589
• Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable DomainsSteve A. Chien. 590-595
• Towards a General Framework for Composing Disjunctive and Iterative Macro-operatorsPeter Shell, Jaime G. Carbonell. 596-602
• Selective Learning of Macro-operators with Perfect CausalitySeiji Yamada, Sabinro Tsuji. 603-608
• Learning Subgoal Sequences for PlanningDavid Ruby, Dennis F. Kibler. 609-614
• A Study of Empirical Learning for an Involved ProblemLarry A. Rendell. 615-620
• A Problem Space Approach to Expert System SpecificationGregg Yost, Allen Newell. 621-627
• Comparing the Conceptual Systems of ExpertsBrian R. Gaines, Mildred L. G. Shaw. 633-638
• Learning DNF by Decision TreesGiulia Pagallo. 639-644
• Constructive Induction On Decision TreesChristopher J. Matheus, Larry A. Rendell. 645-650
• Principled Constructive InductionPankaj Mehra, Larry A. Rendell, Benjamin W. Wah. 651-656
• Improving Efficiency by Learning Intermediate ConceptsJames Wogulis, Pat Langley. 657-662
• Coping With Uncertainty in Map LearningKenneth Basye, Thomas Dean, Jeffrey Scott Vitter. 663-668
• Learning Novel Domains Through Curiosity and ConjecturePaul D. Scott, Shaul Markovitch. 669-674
• Rule Creation and Rule Learning Through Environmental ExplorationWei-Min Shen, Herbert A. Simon. 675-680
• Abstraction in Problem Solving and LearningAmy Unruh, Paul S. Rosenbloom. 681-687
• Acquiring Recursive Concepts with Explanation-Based LearningJude W. Shavlik. 688-693
• Lazy ExplanationBased Learning: A Solution to the Intractable Theory ProblemPrasad Tadepalli. 694-700
• Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational ApproachJack Mostow, Armand Prieditis. 701-707
• Induction in an Abstraction Space: A Form of Constructive InductionGeorge Drastal, Gabor Czako, Stan Raatz. 708-712
• Detecting and Correcting Errors of Omission After Explanation-Based LearningMichael J. Pazzani. 713-718
• An Integrated Characterization and Discrimination Scheme to Improve Learning Efficiency in Large Data SetsRoberto Gemello, Franco Mana. 719-724
• The Effect of Rule Use on the Utility of Explanation-Based LearningRaymond J. Mooney. 725-730
• Eliminating Expensive Chunks by Restricting ExpressivenessMilind Tambe, Paul S. Rosenbloom. 731-737
• Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned KnowledgeShaul Markovitch, Paul D. Scott. 738-743
• Incorporating Redundant Learned Rules: A Preliminary Formal Analysis of EBLRussell Greiner, J. Likuski. 744-749
• Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle CrossoverRich Caruana, Larry J. Eshelman, J. David Schaffer. 750-755
• Alternatives for Classifier System Credit AssignmentGunar E. Liepins, Mike R. Hilliard, Mark R. Palmer, G. Rangarajan. 756-761
• Training Feedforward Neural Networks Using Genetic AlgorithmsDavid J. Montana, Lawrence Davis. 762-767
• Hierarchical Genetic Algorithms Operating on Populations of Computer ProgramsJohn R. Koza. 768-774
• An Experimental Comparison of Symbolic and Connectionist Learning AlgorithmsRaymond J. Mooney, Jude W. Shavlik, Geoffrey G. Towell, Alan Gove. 775-780
• An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification MethodsSholom M. Weiss, Ioannis Kapouleas. 781-787
• An Empirical Comparison of ID3 and Back-propagationDouglas H. Fisher, Kathleen B. McKusick. 788-793
• Noise-Tolerant Instance-Based Learning AlgorithmsDavid W. Aha, Dennis F. Kibler. 794-799
• Generating Better Decision TreesSteven W. Norton. 800-805
• Building Robust Learning Systems by Combining Induction and OptimizationDavid K. Tcheng, Bruce L. Lambert, Stephen C. Y. Lu, Larry A. Rendell. 806-812
• Concept Learning and the Problem of Small DisjunctsRobert C. Holte, Liane Acker, Bruce W. Porter. 813-818
• Chemical Analogies: Two Kinds of ExplanationPaul Thagard, Dawn M. Cohen, Keith J. Holyoak. 819-824
• Noise-Tolerant Conceptual ClusteringDouglas H. Fisher. 825-830
• Concept Formation by Incremental Conceptual ClusteringMirsad Hadzikadic, David Y. Y. Yun. 831-836
• A Critique of the Valiant ModelWray L. Buntine. 837-842
• The Minimum Description Length Principle and Its Application to Online Learning of Handprinted CharactersQiong Gao, Ming Li. 843-848
• Towards Friendly Concept-LearnersLuc De Raedt, Maurice Bruynooghe. 849-858
• Things That Change by ThemselvesVladimir Lifschitz, Arkady Rabinov. 864-867
• A Formal Account of Self-Knowledge and ActionYves Lespérance. 868-874
• Constraint Satisfaction with Delayed EvaluationMonte Zweben, Megan Eskey. 875-880
• Constraint Posting for Verifying VLSI CircuitsDaniel Weise. 881-886
• Temporally Coarse Representation of Behavior for Model-based Troubleshooting of Digital CircuitsWalter Hamscher. 887-893
• Filter Preferential Entailment for the Logic of Action in Almost Continuous WorldsErik Sandewall. 894-899
• A Parallel Algorithm for Statistical Belief Refinement and its use in Causal ReasoningJay C. Weber. 900-905
• Temporal Projection and ExplanationAndrew B. Baker, Matthew L. Ginsberg. 906-911
• Negotiation and Task Sharing Among Autonomous Agents in Cooperative DomainsGilad Zlotkin, Jeffrey S. Rosenschein. 912-917
• Ascribing Plans to AgentsKurt Konolige, Martha E. Pollack. 924-930
• Ordering Problem SubgoalsJie Cheng, Keki B. Irani. 931-936
• Towards a Theory of Conflict Detection and Resolution in Nonlinear PlansJoachim Hertzberg, Alexander Horz. 937-942
• Control of Refitting during Plan ReuseSubbarao Kambhampati, James A. Hendler. 943-948
• A Model of Planning for Plan Efficiency: Taking Advantage of Operator OverlapCaroline C. Hayes. 949-953
• Time for Action: On the Relation Between Time, Knowledge and ActionYoav Shoham. 954-959
• Goal Ordering in Partially Ordered PlansMark Drummond, Ken Currie. 960-965
• Decision-Making in an Embedded Reasoning SystemMichael P. Georgeff, François Felix Ingrand. 972-978
• Solving Time-Dependent Planning ProblemsMark S. Boddy, Thomas Dean. 979-984
• A Model for Projection and ActionKeiji Kanazawa, Thomas Dean. 985-990
• The Dynamics of Action SelectionPattie Maes. 991-997
• A Reactive Scheduling AgentPatrick Prosser. 1004-1009
• Constraint Satisfiability Algorithms for Interactive Student SchedulingRonen Feldman, Martin Charles Golumbic. 1010-1016
• Neuroplanners and Their Application to Eyes/Head/Neck CoordinationDaryl H. Graf, Wilf R. LaLonde. 1022-1028
• Representations of Assembly SequencesLuiz Homem de Mello, Arthur C. Sanderson. 1035-1042
• Preferred Subtheories: An Extended Logical Framework for Default ReasoningGerhard Brewka. 1043-1048
• A Correct Non-Monotonic ATMSUlrich Junker. 1049-1054
• Outline of a Naive Semantics for Reasoning with Qualitative Linguistic InformationDaniel G. Schwartz. 1068-1073
• A Semantics for Probabilistic Quantifier-Free First-Order Languages, with Particular Application to Story UnderstandingEugene Charniak, Robert P. Goldman. 1074-1079
• HUGIN - A Shell for Building Bayesian Belief Universes for Expert SystemsStig K. Andersen, Kristian G. Olesen, Finn Verner Jensen, Frank Jensen. 1080-1085
• Negative Reasoning Using InheritanceLin Padgham. 1086-1092
• An Evidence-based Framework for a Theory of InheritanceKrishnaprasad Thirunarayan, Michael Kifer. 1093-1098
• On the Declarative Semantics of Inheritance NetworksKrishnaprasad Thirunarayan, Michael Kifer, David Scott Warren. 1099-1103
• A Modest, but Semantically Well Founded, Inheritance ReasonerFahiem Bacchus. 1104-1109
• Measure-Free Conditioning, Probability and Non-Monotonic ReasoningDidier Dubois, Henri Prade. 1110-1114
• An Analysis of ATMS-Based Techniques for Computing Dempster-Shafer Belief FunctionsGregory M. Provan. 1115-1120
• Reflection and Action Under Scarce Resources: Theoretical Principles and Empirical StudyEric Horvitz, Gregory F. Cooper, David Heckerman. 1121-1127
• Qualitative Reasoning of Bayesian Belief Using Meta-knowledgeBon K. Sy. 1128-1133
• The Tractability of Path-Based InheritanceBart Selman, Hector J. Levesque. 1140-1145
• Vivid Knowledge and Tractable ReasoningDavid W. Etherington, Alexander Borgida, Ronald J. Brachman, Henry A. Kautz. 1146-1152
• Skeptical Inheritance: Computing the Intersection of Credulous ExtensionsLynn Andrea Stein. 1153-1160
• Uncertainty, Belief, and ProbabilityRonald Fagin, Joseph Y. Halpern. 1161-1167
• Belief as Defeasible KnowledgeYoav Shoham, Yoram Moses. 1168-1173
• Perturbation Analysis with Qualitative ModelsRenato de Mori, Robert Prager. 1180-1186
• Stochastic Analysis of Qualitative DynamicsJon Doyle, Elisha Sacks. 1187-1192
• Constraint Reasoning Based on Interval ArithmeticEero Hyvönen. 1193-1198
• Relating the TMS to Autoepistemic LogicYasushi Fujiwara, Shinichi Honiden. 1199-1205
• On the Relation Between Truth Maintenance and Autoepistemic LogicMichael Reinfrank, Oskar Dressler, Gerhard Brewka. 1206-1212
• On the Relation Between Autoepistem ic Logic and CircumscriptionKurt Konolige. 1213-1218
• Using a Feature Algebra for Reasoning about Geometric Feature InteractionsRaghu Karinthi, Dana S. Nau. 1219-1224
• Automated Physical ModelingAndrew Gelsey. 1225-1230
• A Focused, Context-Sensitive Approach to MonitoringRichard J. Doyle, Suzanne M. Sellers, David Atkinson. 1231-1237
• Model-Based Monitoring of Dynamic SystemsDaniel Dvorak, Benjamin Kuipers. 1238-1243
• Approximation of Indistinct ConceptsZhang Mingyi. 1244-1248
• ANASTASIL: A Hybrid Knowledge-Based System for Document Layout AnalysisAndreas Dengel, Gerhard Barth. 1249-1254
• Temporal Matching: Recognizing Dynamic Situations from Discrete MeasurementsKlaus Nökel. 1255-1260
• The Orders of Magnitude Models as Qualitative AlgebrasLouise Travé-Massuyès, Núria Piera. 1261-1266
• Processes at DiscontinuitiesPatrick J. Hayes, Michael Leyton. 1267-1272
• Introducing Actions into Qualitative SimulationKenneth D. Forbus. 1273-1278
• The Thought Experiment Approach to Qualitative PhysicsDavid L. Hibler, Gautam Biswas. 1279-1284
• The Logic of Time Structures: Temporal and Nonmonotonic FeaturesMira Balaban, Neil V. Murray. 1285-1290
• Approximation Algorithms for Temporal ReasoningPeter van Beek. 1291-1296
• Managing Efficiently Temporal Relations Through Indexed Spanning TreesMalik Ghallab, A. Mounir Alaoui. 1297-1303
• Normality and Faults in Logic-Based DiagnosisDavid Poole. 1304-1310
• A Theory of Diagnosis for Incomplete Causal ModelsLuca Console, Daniele Theseider Dupré, Pietro Torasso. 1311-1317
• Physical Negation Integrating Fault Models into the General Diagnostic EnginePeter Struss, Oskar Dressler. 1318-1323
• Diagnosis with Behavioral ModesJohan de Kleer, Brian C. Williams. 1324-1330
• Reasoning about Kinematic TopologyBoi Faltings, Emmanuel Baechler, J. Primus. 1331-1336
• Simplification and Abstraction of Kinematic BehaviorsLeo Joskowicz. 1337-1342
• Reasoning About Hidden MechanismsRichard J. Doyle. 1343-1349
• A Diagnostic Algorithm based on Models at Different Level of AbstractionMassimo Gallanti, Marco Roncato, Alberto Stefanini, Giorgio Tornielli. 1350-1355
• Experience Learning in Model-Based Diagnostic SystemsYoshiyuki Koseki. 1356-1362
• Candidate Ordering and Elimination in Model-Based Fault DiagnosisJiah-Shing Chen, Sargur N. Srihari. 1363-1368
• An Integrated Knowledge Based Assembly Control System for Automobile ManufacturingBurkhard Freitag, Bernhard Huber, Wolfgang Womann. 1369-1374
• On the Semantics of CounterfactualsPeter Jackson. 1382-1387
• Functional Representation of Designs and Redesign Problem SolvingAshok K. Goel, B. Chandrasekaran. 1388-1394
• Towards a Generic Model of Configuraton TasksSanjay Mittal, Felix Frayman. 1395-1401
• A Case-Based Mechanical Redesign SystemFrancois Daube, Barbara Hayes-Roth. 1402-1407
• A Unified View of Propositional Knowledge Base UpdatesHirofumi Katsuno, Alberto O. Mendelzon. 1413-1419
• Plausible Inferencing Using Extended CompositionMichael N. Huhns, Larry M. Stephens. 1420-1425
• Storing and Generalizing Multiple Instances While Maintaining Knowledge-Level ParallelismRonald A. Sumida, Michael G. Dyer. 1426-1431
• Reasoning About Assumptions in Graphs of ModelsSanjaya Addanki, Roberto Cremonini, J. Scott Penberthy. 1432-1438
• Tuning a Knowledge Base of Refinement Rules To Create Good Circuit DesignsChris Tong, Phil Franklin. 1439-1445
• Automating the Construction of Patchers That Satisfy Global ConstraintsKerstin Voigt, Chris Tong. 1446-1452
• Extending the Constraint Propagation of IntervalsAllen C. Ward, Tomás Lozano-Pérez, Warren P. Seering. 1453-1460
• A Schema-Based Approach to Understanding Subjunctive ConditionalsWayne Wobcke. 1461-1466
• Semantic Interpretation Based on the Multi-World ModelKatashi Nagao. 1467-1473
• Semantics of Perspectival UtterancesYasuhiro Katagiri. 1474-1479
• Formal Properties and Implementation of Bidirectional ChartsGiorgio Satta, Oliviero Stock. 1480-1485
• Bidirectional Use of Knowledge in the Multi-modal NL Access System XTRAJürgen Allgayer, Roman M. Jansen-Winkeln, Carola Reddig, Norbert Reithinger. 1492-1497
• Phrasing a Text in Terms the User Can UnderstandJohn A. Bateman, Cécile Paris. 1511-1517
• POPEL-HOW: A Distributed Parallel Model for Incremental Natural Language Production with FeedbackWolfgang Finkler, Günter Neumann. 1518-1523
• Controlling a Language Generation PlannerSergei Nirenburg, Victor R. Lesser, Eric Nyberg. 1524-1530
• On the Generalization Capability of Multi-Layered Networks in the Extraction of Speech PropertiesRenato de Mori, Yoshua Bengio, Piero Cosi. 1531-1536
• A Parallel Parser for Spoken Natural LanguageEgidio P. Giachin, Claudio Rullent. 1537-1542
• Layering Predictions: Flexible Use of Dialog Expectation in Speech RecognitionSheryl R. Young, Wayne H. Ward, Alexander G. Hauptmann. 1543-1549
• Computer-Aided Grammar Acquisition in the Chinese Understanding System CUSAGALu Ruqian, Liu Yinghui, Xiaobin Li. 1550-1555
• Lexicon Acquisition: Learning from Corpus by Capitalizing on Lexical CategoriesUri Zernik. 1556-1564
• Perception of Non-Rigid Motion: Inference of Shape, Material and ForceAlex Pentland, John Williams. 1565-1570
• A Homogeneous Framework for Visual RecognitionRick Kjeldsen, Ruud M. Bolle, Andrea Califano, Russell W. Taylor. 1578-1584
• A Small Leakage Model for Diffusion Smoothing of Image DataLi-Dong Cai. 1585-1590
• Can Early Stage Vision Detect TopologyLifu Liu, Nanyuan Zhao, Bian Zhaoqi. 1591-1595
• Objective Functions for Feature DiscriminationPascal Fua, Andrew J. Hanson. 1596-1602
• Some Experiments in Applying Inductive Inference Principles to Surface ReconstructionEdwin P. D. Pednault. 1603-1609
• Three-Dimensional Interpretation of QuadrilateralsGang Xu, Saburo Tsuji. 1610-1616
• Visual Reasoning in Geometry Theorem ProvingMichelle Y. Kim. 1617-1622
• Experiments with a Network-Based Geometric Reasoning EngineRobert B. Fisher, Mark J. L. Orr. 1623-1628
• Building a World Model for a Mobile Robot Using Dynamic Semantic ConstraintsMinoru Asada, Yoshiaki Shirai. 1629-1634
• Reference Frames for Animate VisionDana H. Ballard. 1635-1641
• Using Generic Knowledge in Analysis of Aerial Scenes: A Case StudyAndres Huertas, William Cole, Ramakant Nevatia. 1642-1648
• Chromatic StereopsisJohn R. Jordan III, Alan C. Bovik, Wilson S. Geisler. 1649-1654
• Using Line Correspondence Stereo to Measure Surface OrientationLawrence B. Wolff, Terrance E. Boult. 1655-1660
• A Region-Based Stereo AlgorithmGang Xu, Hideki Kondo, Saburo Tsuji. 1661-1668
• The Challenge of Neural DarwinismStephen W. Smoliar. 1669-1671
• Robot NavigationDavid P. Miller. 1672-1674
• High-Impact Future Research Directions for Artificial IntelligencePerry W. Thorndyke. 1675-1675
• Artificial Intelligence and Space ExplorationPeter Friedland. 1676-1678
• (How) Is AI Impacting Manufacturing?Mark S. Fox. 1679