Table of Contents

• A Methodology for Systematic Verification of OPS5-Based AI ApplicationsG. Ravi Prakash, Eswaran Subrahmanian, Hosaker N. Mahabala. 3-8
• Intelligent Assistance through Collaborative ManipulationLoren G. Terveen, David A. Wroblewski, Steven N. Tighe. 9-14
• Effects of Parallelism on Blackboard System SchedulingKeith Decker, Alan Garvey, Marty Humphrey, Victor R. Lesser. 15-21
• The Automated Analysis of Rule-based Systems, Based on their Procedural SemanticsRick Evertsz. 22-29
• Holographic Reduced Representations: Convolution Algebra for Compositional Distributed RepresentationsTony Plate. 30-35
• A Macro Actor/Token Implementation of Production Systems on a Data-Mow MultiprocessorAndrea Sohn, Jean-Luc Gaudiot. 36-41
• Performance Comparison of Models for Multiple Rule FiringSteve Kuo, Dan I. Moldovan. 42-47
• On Supporting Associative Access and Processing over Dynamic Knowledge BasesIan N. Robinson. 48-55
• Negotiations Over Time in a Multi-Agent Environment: Preliminary ReportSarit Kraus, Jonathan Wilkenfeld. 56-61
• A Decision-Theoretic Approach to Coordinating Multi-agent InteractionsPiotr J. Gmytrasiewicz, Edmund H. Durfee, David K. Wehe. 62-68
• Towards a Formal Theory of Communication for Multi-agent SystemsMunindar P. Singh. 69-74
• Communication and Inference through SituationsHideyuki Nakashima, Stanley Peters, Hinrich Schütze. 75-81
• Commitment and Effectiveness of Situated AgentsDavid Kinny, Michael P. Georgeff. 82-88
• Generating Integrated Interpretation of Partial Information Based on Distributed Qualitative ReasoningTakashi Nishiyama, Osamu Katai, Sosuke Iwai, Tetsuo Sawaragi, Hiroshi Masuichi. 89-98
• A Resolution Method for Temporal LogicMichael Fisher. 99-104
• Formalizing and Using PersistencyThomas Guckenbiehl. 105-110
• Reflective Reasoning with and between a Declarative Metatheory and the Implementation CodeFausto Giunchiglia, Paolo Traverso. 111-117
• A Model Elimination Calculus for Generalized ClausesToni Bollinger. 126-131
• Consolution and its Relation with ResolutionElmar Eder. 132-136
• How to Prove Higher Order Theorems in First Order LogicManfred Kerber. 137-142
• Reasoning of Geometric Concepts based on Algebraic Constraint-directed MethodHitoshi Iba, Hirochika Inoue. 143-151
• An Inference Rule for Hypothesis GenerationRobert Demolombe, Luis Fariñas del Cerro. 152-157
• Consequence-Finding Based on Ordered Linear ResolutionKatsumi Inoue. 158-164
• Proof Transformation with Built-in Equality PredicateChristoph Lingenfelder, Axel Präcklein. 165-171
• An Expected-Cost Analysis of Backtracking and Non-Backtracking AlgorithmsColin J. H. McDiarmid, Gregory M. Provan. 172-177
• Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two MachinesAnup K. Sen, Amitava Bagchi, Bani K. Sinha. 178-183
• Learning Admissible Heuristics while Solving ProblemsAnna Bramanti-Gregor, Henry W. Davis. 184-191
• Using Aspiration Windows for Minimax AlgorithmsReza Shams, Hermann Kaindl, Helmut Horacek. 192-197
• High-Performance A/ast Search Using Rapidly Growing HeuristicsStephen V. Chenoweth, Henry W. Davis. 198-203
• Moving Target SearchToru Ishida, Richard E. Korf. 204-211
• Composing Real-Time SystemsStuart J. Russell, Shlomo Zilberstein. 212-217
• Incomplete Information and Deception in Multi-Agent NegotiationGilad Zlotkin, Jeffrey S. Rosenschein. 225-231
• Solving How to Clear a Block with Constructive Matching MethodologyMarta Franová, Yves Kodratoff. 232-239
• Generalizing Nonlinear Planning to Handle Complex Goals and Actions with Context-Dependent EffectsEdwin P. D. Pednault. 240-245
• A Formal Model for Classical PlanningJens Christensen, Adam J. Grove. 246-251
• Localized Search for Multiagent PlanningAmy L. Lansky. 252-258
• Commitment Strategies in Planning: A Comparative AnalysisSteven Minton, John L. Bresina, Mark Drummond. 259-267
• Parallel Non-Binary Planning in Polynomial TimeChrister Bäckström, Inger Klein. 268-273
• Complexity Results for PlanningTom Bylander. 274-279
• A Message Passing Algorithm for Plan RecognitionDekang Lin, Randy Goebel. 280-285
• The Downward Refinement PropertyFahiem Bacchus, Qiang Yang. 286-293
• A Logically Complete Reasoning Maintenance System Based on a Logical Constraint SolverJean Christophe Madre, Olivier Coudert. 294-299
• Contexts for Nonmonotonic RMSesJérôme Euzenat. 300-305
• On Semantics of TMSXianchang Wang, Huowang Chen. 306-309
• Prioritized Defaults: Implementation by TMS and Application to DiagnosisUlrich Junker. 310-317
• An Efficient Arc Consistency Algorithm for a Class of CSP ProblemsYves Deville, Pascal Van Hentenryck. 325-330
• Where the Really Hard Problems ArePeter Cheeseman, Bob Kanefsky, William M. Taylor. 331-340
• How Situated is Cognition?Jacobijn Sandberg, Bob J. Wielinga. 341-346
• Index Transformation Techniques for Facilitating Creative Use of Multiple CasesKatia P. Sycara, Dundee Navinchandra. 347-352
• Plan Debugging in an Intentional SystemGregg Collins, Lawrence Birnbaum, Bruce Krulwich, Michael Freed. 353-359
• Reasoning Visually about Spatial InteractionsN. Hari Narayanan, B. Chandrasekaran. 360-365
• A Cognitive Model of Figure SegregationAkira Shimaya, Isamu Yoroizawa. 366-372
• An MFIS for Computing a Raw Cognitive MapWai K. Yeap, Margaret E. Jefferies, P. S. Naylor. 373-380
• Nonmonotonic Databases and Epistemic QueriesVladimir Lifschitz. 381-386
• Commonsense Entailment: A Modal Tneory of Non-monotonic ReasoningNicholas Asher, Michael Morreau. 387-392
• Constructive Tightly Grounded Autoepistemic ReasoningIlkka Niemelä. 399-405
• A Unified View of Consequence Relation, Belief Revision and Conditional LogicHirofumi Katsuno, Ken Satoh. 406-412
• Inaccessible Worlds and Irrelevance: Preliminary ReportCraig Boutilier. 413-418
• Possibilistic Logic, Preferential Models, Non-monotonicity and Related IssuesDidier Dubois, Henri Prade. 419-425
• Query Answering in CircumscriptionNicolas Helft, Katsumi Inoue, David Poole. 426-431
• Circumscription and DefinabilityYves Moinard, Raymond Rolland. 432-437
• Circumscribing DefaultsZhaogang Qian, Keki B. Irani. 438-445
• Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological CyclesFranz Baader. 446-451
• A Scheme for Integrating Concrete Domains into Concept LanguagesFranz Baader, Philipp Hanschke. 452-457
• Tractable Concept LanguagesFrancesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt. 458-465
• A Correspondence Theory for Terminological Logics: Preliminary ReportKlaus Schild. 466-471
• Generalizing Term Subsumption Languages to Fuzzy LogicJohn Yen. 472-477
• A Skeptic s Menagerie: Conflictors, Preemptors, Reinstaters, and Zombies in Nonrnonotonic InheritanceDavid S. Touretzky, Richmond H. Thomason, John F. Horty. 478-485
• A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1Sukhamay Kundu. 486-491
• A Model of Decidable Introspective Reasoning with Quantifying-InGerhard Lakemeyer. 492-497
• A Model of Events and ProcessesPeriklis Belegrinos, Michael P. Georgeff. 506-511
• Parameter Structures for Parametrized Modal OperatorsHans Jürgen Ohlbach, Andreas Herzig. 512-517
• Measuring and Improving the Effectiveness of RepresentationsRussell Greiner, Charles Elkan. 518-524
• Propositional Non-Monotonic Reasoning and Inconsistency in Symrnetric Neural NetworksGadi Pinkas. 525-531
• Contextual Negations and Reasoning with ContradictionsWalter Alexandre Carnielli, Luis Fariñas del Cerro, Mamede Lima-Marques. 532-537
• Ex contradictione nihil sequiturGerd Wagner. 538-546
• The Role of Chess in Artificial Intelligence ResearchRobert Levinson, Feng-hsiung Hsu, T. Anthony Marsland, Jonathan Schaeffer, David E. Wilkins. 547-552
• Multiple Approaches to Multiple Agent Problem SolvingJames A. Hendler, Daniel G. Bobrow, Les Gasser, Carl Hewitt, Marvin Minsky. 553-554
• AI in TelecommunicationsAndrew Jennings, Adam E. Irgon, Akira Kurematsu, Greg Vessonder, Jon R. Wright. 555-556
• Massively Parallel Artificial IntelligenceHiroaki Kitano, James A. Hendler, Tetsuya Higuchi, Dan I. Moldovan, David L. Waltz. 557-562
• AI and DesignSaul Amarel, Alvin M. Despain, H. Penny Nii, Louis I. Steinberg, Marty Tenenbaum, Peter M. Will. 563-568
• Intelligence Without ReasonRodney A. Brooks. 569-595
• Quantitative Evaluation of Explanation-Based Learning as an Optimisation Tool for a Large-Scale Natural Language SystemChrister Samuelsson, Manny Rayner. 609-615
• An Augmented EBL and its Application to the Utility ProblemMasayuki Yamamura, Shigenobu Kobayashi. 623-629
• Concept Formation over Explanations and Problem-Solving ExperienceJungsoon P. Yoo, Douglas H. Fisher. 630-637
• Classifiers: A Theoretical and Empirical StudyWray L. Buntine. 638-644
• A Hybrid Genetic Algorithm for ClassificationJames D. Kelly Jr., Lawrence Davis. 645-650
• Learning Concept Classification Rules Using Genetic AlgorithmsKenneth A. De Jong, William M. Spears. 651-657
• Flexible Matching for Noisy Structural DescriptionsFloriana Esposito, Donato Malerba, Giovanni Semeraro. 658-664
• Theoretical Underpinnings of Version SpacesHaym Hirsh. 665-670
• Reduced Complexity Rule InductionSholom M. Weiss, Nitin Indurkhya. 678-684
• Semantic Model for Induction of First Order TheoriesCéline Rouveirol. 685-691
• A Scheme for Feature Construction and a Comparison of Empirical MethodsDer-Shung Yang, Larry A. Rendell, Gunnar Blix. 699-704
• Learning with a Helpful TeacherSteven Salzberg, Arthur L. Delcher, David G. Heath, Simon Kasif. 705-711
• Towards a Model of Grounded Concept FormationStefan Wrobel. 712-719
• Machine Discovery of Effective Admissible HeuristicsArmand Prieditis. 720-725
• Input Generalization in Delayed Reinforcement Learning: An Algorithm and Performance ComparisonsDavid Chapman, Leslie Pack Kaelbling. 726-731
• Learning to Classify Observed Motor BehaviorWayne Iba. 732-738
• Modelling Experiments in Scientific DiscoveryPeter C.-H. Cheng. 739-745
• Determinate Literals in Inductive Logic ProgrammingJ. Ross Quinlan. 746-750
• Inductive Learning from Good ExamplesCharles X. Ling. 751-756
• Refinement Strategies for Inductive Leaming of Simple Prolog ProgramsMarc Kirschenbaum, Leon Sterling. 757-763
• Overprvning Large Decision TreesJason Catlett. 764-769
• Learning Structural Decision Trees from ExamplesLarry Watanabe, Larry A. Rendell. 770-776
• Learning Nested Concept Classes with Limited StorageDavid G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan. 777-782
• Acquiring Knowledge by Efficient Query LearningAchim G. Hoffmann, Sunil Thakar. 783-789
• The Base Selection Task in Analogical PlanningDiane J. Cook. 790-795
• FGP: A Virtual Machine for Acquiring Knowledge from CasesScott Fertig, David Gelernter. 796-802
• CABOT: An Adaptive Approach to Case-Based SearchJames P. Callan, Tom Fawcett, Edwina L. Rissland. 803-809
• Constraints on Tree Structure in Concept FormationKathleen B. McKusick, Pat Langley. 810-816
• An Interactive Visual Language for Term Subsumption LanguagesBrian R. Gaines. 817-823
• Cooperative Hybrid SystemsMatthias Gutknecht, Rolf Pfeifer, Markus Stolze. 824-831
• Integration of Neural Networks and Expert Systems for Process Fault DiagnosisWarren R. Becraft, Peter L. Lee, Robert B. Newell. 832-837
• Analyzing Images Containing Multiple Sparse Patterns with Neural NetworksRangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka. 838-843
• The Utility of Feature Construcuon for Back-PropagationHarish Ragavan, Selwyn Piramuthu. 844-850
• Weak Equivalence for Constraint SetsSieger van Denneheuvel, Karen L. Kwast. 851-856
• Fitting Semantics for Conditional Term RewritingChilukuri K. Mohan. 857-862
• Derivation Procedures for Extended Stable ModelsLuís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes. 863-869
• An Architecture for Visualizing the Execution of Parallel Logic ProgramsMike Brayshaw. 870-876
• A Non-shared Binding Scheme for Parallel Prolog ImplementationKang Zhang, Ray Thomas. 877-883
• Programming in Autoepistemic LogicKienchung Kuo. 884-889
• Indefinite Reasoning with Definite RulesL. Thorne McCarty, Ron van der Meyden. 890-896
• The Incomplete DatabaseKaren L. Kwast. 897-902
• Compiling Integrity Checking into Update ProceduresMark Wallace. 903-910
• High Performance Natural Language Processing on Semantic Network Array ProcessorHiroaki Kitano, Dan I. Moldovan, Seungho Cha. 911-917
• Massively Parallel Memory-Based ParsingHiroaki Kitano, Tetsuya Higuchi. 918-924
• Incremental Syntactic and Semantic ProcessingEsther König. 925-930
• An Environment for Experimentation with Parsing StrategiesGregor Erbach. 931-937
• Resolving Plan Ambiguity for Cooperative Response GenerationPeter van Beek, Robin Cohen. 938-944
• Your Metaphor or Mine: Belief Ascription and Metaphor InterpretationYorick Wilks, John A. Barnden, Jin Wang. 945-950
• POST: Using Probabilities in Language ProcessingMarie Meteer, Richard M. Schwartz, Ralph M. Weischedel. 960-965
• The Re-use of Linguistic Resources across Languages in Multilingual Generation ComponentsJohn A. Bateman, Christian Matthiessen, Keizo Nanri, Licheng Zeng. 966-971
• Natural Language and Exploration of an Information Space: The ALFresco Interactive SystemOliviero Stock. 972-978
• Efficient Representation of Linguistic Knowledge for Continuous Speech UnderstandingPaolo Baggia, Elisabetta Gerbino, Egidio P. Giachin, Claudio Rullent. 979-985
• Organizational Issues Arising from the Integration of the Lexicon and Concept Network in a Text Understanding SystemPadraig Cunningham, Tony Veale. 986-991
• Logic and Feature StructuresMark Johnson. 992-996
• Interpretation of Definite Noun PhrasesLiliana Ardissono, Leonardo Lesmo, Paolo Pogliano, Paolo Terenziani. 997-1002
• Using Pattern-Action Rules for the Generation of GPSG Structures from MT-Oriented SemanticsStephan Busemann. 1003-1011
• Coordinated Morphological and Syntactic Analysis of Japanese LanguageTsunenori Mine, Rin-ichiro Taniguchi, Makoto Amamiya. 1012-1017
• A Parsing Method for Identifying Words in Mandarin Chinese SentencesLiang-Jyh Wang, Tzusheng Pei, Wei-Chuan Li, Lih-Ching R. Huang. 1018-1023
• X2MORF: A Morphological Component Based on Augmented Two-Level MorphologyHarald Trost. 1024-1030
• Parsing = Parsimonious Covering? (Abduction in Logical Form Generation)Venu Dasigi. 1031-1038
• The Philosophy of Automated Theorem ProvingFrancis Jeffry Pelletier. 1039-1045
• Generalised Inference and Inferential ModellingRaymond E. Jennings, Christine W. Chan, M. J. Dowad. 1046-1051
• The Implications of ParaconsistencyJohn K. Slaney. 1052-1059
• Actions and MovementsDavid J. Israel, John Perry, Syun Tutiya. 1060-1065
• In Defense of Hyper-Logicist AISelmer Bringsjord, Michael Zenzen. 1066-1072
• The Problem of Induction and Machine LearningFrancesco Bergadano. 1073-1080
• UMRAO: A Chess Endgame Tutor1081-1086
• Reasoning about Student Knowledge and ReasoningLuigia Carlucci Aiello, Maria Cialdea, Daniele Nardi. 1087-1093
• Integration-Kid: A Learning Companion SystemTak-Wai Chan. 1094-1099
• An Endorsement-based Approach to Student Modeling for Planner-controlled TutorsWilliam R. Murray. 1100-1108
• When Oscillators Stop OscillatingPhilippe Dague, Olivier Jehl, Philippe Deves, Pierre Luciani, Patrick Taillibert. 1109-1115
• Diagnosing Temporal MisbehaviorGerhard Friedrich, Franz Lackinger. 1116-1122
• Integrating Model-Based Monitoring and Diagnosis of Complex Dynamic SystemsFranz Lackinger, Wolfgang Nejdl. 1123-1128
• Representing Diagnostic Knowledge for Probabilistic Horn AbductionDavid Poole. 1129-1137
• The Hybrid Phenomena TheoryErling A. Woods. 1138-1143
• Extracting and Representing Qualitative Behaviors of Complex Systems in Phase SpacesFeng Zhao. 1144-1149
• A Geometric Approach to Total EnvisioningToyoaki Nishida, Shuji Doshita. 1150-1157
• Combining Qualitative and Quantitative Knowledge to Generate Models of Physical SystemsUlf Söderman, Jan-Erik Strömberg. 1158-1163
• Directed Constraint Networks: A Relational Framework for Causal ModelingRina Dechter, Judea Pearl. 1164-1170
• Computational and Physical CausalityJan L. Top, Hans Akkermans. 1171-1176
• Reified Temporal Theories and How to Unreify ThemAntony Galton. 1177-1183
• Characterizing Belief with Minimum CommitmentYen-Teh Hsia. 1184-1189
• On a Tool for Reasoning with Mass DistributionsRudolf Kruse, Erhard Schwecke, Frank Klawonn. 1190-1195
• Evidential ProbabilityHenry E. Kyburg Jr.. 1196-1203
• Propagation of Preference Relations in Qualitative Inference NetworksS. K. Michael Wong, Pawan Lingras, Yiyu Yao. 1204-1209
• Parallel Distributed Belief Networks That LearnWilson X. Wen, Andrew Jennings. 1210-1218
• Emergent Frame Recognition and Its Use in Artificial CreaturesLuc Steels. 1219-1224
• Integrating Reaction Plans and Layered Competences Through Synchronous ControlR. Peter Bonasso. 1225-1233
• Planning Robot Control Parameter Values with Qualitative ReasoningStephen F. Peters, Shigeoki Hirai, Toru Omata, Tomomasa Sato. 1234-1240
• Mobile Robot Navigation by an Active Control of the Vision SystemPatrick Stelmaszyk, Hiroshi Ishiguro, Saburo Tsuji. 1241-1246
• Determining Robot Egomotion from Motion Parallax Observed by an Active CameraMatthew Barth, Hiroshi Ishiguro, Saburo Tsuji. 1247-1256
• A Pictorial Approach to Object ClassificationYerucham Shapira, Shimon Ullman. 1257-1263
• Natural Object Recognition: A Theoretical Framework and Its ImplementationThomas M. Strat, Martin A. Fischler. 1264-1270
• On Seeing Spaghetti: A Novel Self-Adjusting Seven Parameter Hough Space for Analyzing Flexible Extruded ObjectsJohn R. Kender, Rick Kjeldsen. 1271-1277
• HyperBF Networks for Real Object RecognitionRoberto Brunelli, Tomaso Poggio. 1278-1285
• Shading-Based Two-View MatchingMichel Audette, Paul R. Cohen, Juyang Weng. 1286-1291
• Combining Stereo and Monocular Information to Compute Dense Depth Maps that Preserve Depth DiscontinuitiesPascal Fua. 1292-1298
• Visual Interpretation of Lambertian Surface DeformationR. Mike Cameron-Jones. 1299-1304
• Line Labeling and Junction Labeling: A Coupled System for Image InterpretationTerry Regier. 1305-1310
• Qualitative Model EvolutionAlen Varsek. 1311-1316