


Остановите войну!
for scientists:


default search action
11th IJCAI 1989: Detroit, Michigan, USA
- N. S. Sridharan:
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, MI, USA, August 1989. Morgan Kaufmann 1989, ISBN 1-55860-094-9 - Marcello Frixione, Giuseppe Spinelli, Salvatore Gaglio:
Symbols and Subsymbols for Representing Knowledge: A Catalogue Raisonné. 3-7 - Nils Dahlbäck:
A Symbol Is Not a Symbol. 8-14 - Stuart J. Russell:
Execution Architectures and Compilation. 15-22 - Shie-rei Huang, Larry S. Davis:
Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm. 23-29 - Rosanne M. Fulcomer, William E. Ball:
Correct Parallel Status Assignment for the Reason Maintenance System. 30-35 - Curt Powley, Richard E. Korf:
Single-Agent Parallel Window Search: A Summary of Results. 36-41 - Subir Bhattacharya, Amitava Bagchi:
Searching Game Trees in Parallel Using SSS. 42-47 - William S. Havens, Paul Stephen Rehfuss:
Platypus: A Constraint-Based Reasoning System. 48-53 - Paul R. Cooper, Michael J. Swain:
Domain Dependence in Parallel Constraint Satisfaction. 54-59 - Hans W. Guesgen:
A Universal Programming Language. 60-65 - Leon Sterling, L. Ümit Yalçinalp:
Explaining Prolog Based Expert Systems Using a Layered Meta-Interpreter. 66-71 - Thomas Graf, Pascal Van Hentenryck, Claudine Pradelles, Laurent Zimmer:
Simulation of Hybrid Circuits in Constraint Logic Programming. 72-77 - Z. I. Markov:
A Framework for Network Modeling in Prolog. 78-83 - Michael A. Kelly, Rudolph E. Seviora:
An Evaluation of DRete on CUPlD for OPSS Matching. 84-90 - Chinh-Chi Hsu, Feng-Hsu Wang:
The Search Ahead Conflict Resolution for Parallel Firing of Production Systems. 91-96 - Lisiane Goffaux, Robert Mathonet:
A Technique for Customizing Object-Oriented Knowledge Representation Systems, With An Application to Network Problem Management. 97-103 - Sanjaya Addanki, Roberto Cremonini, J. Scott Penberthy:
Contexts: Dynamic Identification of Common Parameters in Distributed Analysis of Complex Devices. 104-109 - Premkumar T. Devanbu, Peter G. Selfridge, Bruce W. Ballard, Ronald J. Brachman:
A Knowledge-Based Software Information System. 110-115 - Rudi Lutz:
Chart Parsing of Flowgraphs. 116-121 - Mark Perlin:
Call-Graph Caching: Transforming Programs into Networks. 122-128 - John Domingue, Marc Eisenstadt:
A New Metaphor for the Graphical Explanation of Forward-Chaining Rule Execution. 129-134 - Michael R. Wick, William B. Thompson:
Reconstructive Explanation: Explanation as Complex Problem Solving. 135-140 - Alex Kass:
Adaptation-Based Explanation: Extending Script/Frame Theory to Handle Novel Input. 141-150 - Yasusi Kanada, Masahiro Sugaya:
A Vectorization Technique for Prolog without Explosion. 151-156 - Nikos Drakos:
Unrestricted And-Parallel Execution of Logic Programs with Dependency Directed Backtracking. 157-162 - Bernd Schend:
A Sequential View of AND-Parallelism Through Partial AND-Processes. 163-169 - Tomas Hrycej:
Unsupervised Learning by Backward Inhibition. 170-175 - Chung-Jen Ho:
On Multi-Layered Connectionist Models: Adding Layers vs. Increasing Width. 176-179 - Hideto Tomabechi, Hiroaki Kitano:
Beyond PDP: The Frequency Modulation Neural Network Architecture. 186-192 - David Handelman, Stephen H. Lane, Jack Gelfand:
Integrating Knowledge-Based System and Neural Network Techniques for Robotic Skill Acquisition. 193-198 - Edward Rothberg, Anoop Gupta:
Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor. 199-205 - Stephen S. Wilson:
Neural Computing on a One Dimensional SIMD Array. 206-211 - James Rice:
The ELINT Application on Poligon: The Architecture and Performance of a Concurrent Blackboard System. 212-220 - John K. Debenham:
The Implementation of Expert, Knowledge-Based Systems. 221-226 - F. D. Highland, Christine T. Iwaskiw:
Knowledge Base Compilation. 227-232 - Richard H. Stottler, Andrea L. Henke, James A. King:
Rapid Retrieval Algorithms for Case-Based Reasoning. 233-237 - Shashi Shekhar, Soumitra Dutta:
Minimizing Response Times in Real Time Planning and Search. 238-242 - Barbara Hayes-Roth, Richard Washington, Rattikorn Hewett, Micheal Hewett, Adam Seiver:
Intelligent Monitoring and Control. 243-249 - Richard Washington, Barbara Hayes-Roth:
Input Data Management in Real-Time AI Systems. 250-255 - Rajendra T. Dodhiawala, N. S. Sridharan, Peter Raulefs, Cynthia Pickering:
Real-Time AI Systems: A Definition and An Architecture. 256-264 - Kuo-Chu Chang, Robert M. Fung:
Node Aggregation for Distributed Inference in Bayesian Networks. 265-270 - Rina Dechter, Itay Meiri:
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. 271-277 - Eugene C. Freuder:
Partial Constraint Satisfaction. 278-283 - Igor Rivin, Ramin Zabih:
An Algebraic Approach to Constraint Satisfaction Problems. 284-289 - Johan de Kleer:
A Comparison of ATMS and CSP Techniques. 290-296 - Anup K. Sen, Amitava Bagchi:
Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. 297-302 - Henry W. Davis, Anna Bramanti-Gregor, Xiaoteng Chen:
Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New Technique. 303-308 - Mark S. Fox, Norman M. Sadeh, Can A. Baykan:
Constrained Heuristic Search. 309-315 - Peter C. Nelson, Lawrence J. Henschen:
Multi-Dimensional Heuristic Searching. 316-321 - Anton Scheucher, Hermann Kaindl:
The Reason for the Benefits of Minimax Search. 322-327 - Richard E. Korf:
Generalized Game Trees. 328-333 - Stuart Russell, Eric Wefald:
On Optimal Game-Tree Search using Rational Meta-Reasoning. 334-340 - Charles Elkan:
Conspiracy Numbers and Caching for Searching And/Or Trees and Theorem-Proving. 341-348 - Qiang Yang, Dana S. Nau:
Preprocessing Search Spaces for Branch and Bound Search. 349-353 - Vincent J. Digricoli, James J. Lu, V. S. Subrahmanian:
And-Or Graphs Applied to RUE Resolution. 354-358 - Alan Bundy, Frank van Harmelen, Jane Hesketh, Alan Smaill, Andrew Stevens:
A Rational Reconstruction and Extension of Recursion Analysis. 359-365 - Fausto Giunchiglia, Toby Walsh:
Abstract Theorem Proving. 372-377 - Christoph Lingenfelder:
Structuring Computer Generated Proofs. 378-383 - M. J. Shensa:
A Computational Structure for the Propositional Calculus. 384-388 - Mehdi T. Harandi, Sanjay Bhansali:
Program Derivation Using Analogy. 389-394 - Marco A. Casanova, Ramiro A. de T. Guerreiro, Andrea Silva:
Logic Programming with General Clauses and Defaults Based on Model Elimination. 395-400 - Rolf Socher-Ambrosius:
Reducing the Derivation of Redundant Clauses in Reasoning Systems. 401-406 - Maurice Bruynooghe, Luc De Raedt, Danny De Schreye:
Explanation Based Program Transformation. 407-412 - Peter Madden:
The Specialization and Transformation of Constructive Existence Proofs. 413-418 - Dongming Wang:
On Wu's Method for Proving Constructive Geometric Theorems. 419-424 - Domenico Cantone, Eugenio G. Omodeo:
On the Decidability of Formulae Involving Continuous and Closed Functions. 425-430 - Elisha Sacks:
An Approximate Solver for Symbolic Equations. 431-434 - Xuhua Liu:
Lock, Linear Lambda-Paramodulation in Operator Fuzzy Logic. 435-440 - Yves Auffray, Patrice Enjalbert:
Modal Theorem Proving: An Equational Viewpoint. 441-445 - Timothy M. Lownie:
Extending Reflective Architectures. 446-451 - Thomas B. Kane:
Maximum Entropy in Nilsson's Probabilistic Logic. 452-457 - Bijan Arbab:
How to Represent Opaque Sentences in First Order Logic. 458-462 - Andrew B. Baker, Matthew L. Ginsberg:
A Theorem Prover for Prioritized Circumscription. 463-467 - Peter K. Rathmann, Marianne Winslett:
Circumscribing Equality. 468-476 - Jim E. Greer, Gordon I. McCalla:
A Computational Framework for Granularity and its Application to Educational Diagnosis. 477-482 - Rick Evertsz:
The Generation of 'Critical Problems' by Abstract Interpretations of Student Models. 483-488 - Sarah A. Douglas, Zheng-Yang Liu:
Generating Causal Explanation from a Cardio-Vascular Simulation. 489-496 - Victor R. Lesser, Daniel D. Corkill, Robert Whitehair, J. A. Hernandez:
Focus of Control Through Goal Relationships. 497-503 - Kristian J. Hammond:
Opportunistic Memory. 504-510 - Gregg Collins, Lawrence Birnbaum, Bruce Krulwich:
An Adaptive Model of Decision-Making in Planning. 511-516 - Katia P. Sycara:
Argumentation: Planning Other Agents' Plans. 517-523 - Edwina L. Rissland, David B. Skalak:
Combining Case-Based and Rule-Based Reasoning: A Heuristic Approach. 524-530 - Martin Thost:
Generating Facts From Opinions with Information Source Models. 531-536 - Kevin D. Ashley:
Defining Salience in Case-Based Arguments. 537-542 - James C. Spohrer, Elliot Soloway:
Simulating Student Programmers. 543-549 - Alex Quilici:
The Correction Machine: Formulating Explanations for User Misconceptions. 550-555 - Jayant Kalagnanam, Eswaran Subrahmanian:
Learning to Diagnose by Doing. 556-561 - Joel D. Martin:
Focusing Attention for Observational Learning: The Importance of Context. 562-567 - John A. Barnden:
Neural-Net Implementation of Complex Symbol-Processing in a Mental Model Approach to Syllogistic Reasoning. 568-573 - Dekai Wu:
A Probabilistic Approach to Marker Propagation. 574-582 - Wesley Braudaway, Chris Tong:
Automated Synthesis of Constrained Generators. 583-589 - Steve A. Chien:
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains. 590-595 - Peter Shell, Jaime G. Carbonell:
Towards a General Framework for Composing Disjunctive and Iterative Macro-operators. 596-602 - Seiji Yamada, Sabinro Tsuji:
Selective Learning of Macro-operators with Perfect Causality. 603-608 - David Ruby, Dennis F. Kibler:
Learning Subgoal Sequences for Planning. 609-614 - Larry A. Rendell:
A Study of Empirical Learning for an Involved Problem. 615-620 - Gregg Yost, Allen Newell:
A Problem Space Approach to Expert System Specification. 621-627 - Jitu Patel:
On the Road to Automatic Knowledge Engineering. 628-632 - Brian R. Gaines, Mildred L. G. Shaw:
Comparing the Conceptual Systems of Experts. 633-638 - Giulia Pagallo:
Learning DNF by Decision Trees. 639-644 - Christopher J. Matheus, Larry A. Rendell:
Constructive Induction On Decision Trees. 645-650 - Pankaj Mehra, Larry A. Rendell, Benjamin W. Wah:
Principled Constructive Induction. 651-656 - James Wogulis, Pat Langley:
Improving Efficiency by Learning Intermediate Concepts. 657-662 - Kenneth Basye, Thomas L. Dean, Jeffrey Scott Vitter:
Coping With Uncertainty in Map Learning. 663-668 - Paul D. Scott, Shaul Markovitch:
Learning Novel Domains Through Curiosity and Conjecture. 669-674 - Wei-Min Shen, Herbert A. Simon:
Rule Creation and Rule Learning Through Environmental Exploration. 675-680 - Amy Unruh, Paul S. Rosenbloom:
Abstraction in Problem Solving and Learning. 681-687 - Jude W. Shavlik:
Acquiring Recursive Concepts with Explanation-Based Learning. 688-693 - Prasad Tadepalli
:
Lazy ExplanationBased Learning: A Solution to the Intractable Theory Problem. 694-700 - Jack Mostow, Armand Prieditis:
Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach. 701-707 - George Drastal, Gabor Czako, Stan Raatz:
Induction in an Abstraction Space: A Form of Constructive Induction. 708-712 - Michael J. Pazzani:
Detecting and Correcting Errors of Omission After Explanation-Based Learning. 713-718 - Roberto Gemello, Franco Mana:
An Integrated Characterization and Discrimination Scheme to Improve Learning Efficiency in Large Data Sets. 719-724 - Raymond J. Mooney:
The Effect of Rule Use on the Utility of Explanation-Based Learning. 725-730 - Milind Tambe, Paul S. Rosenbloom:
Eliminating Expensive Chunks by Restricting Expressiveness. 731-737 - Shaul Markovitch, Paul D. Scott:
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge. 738-743 - Russell Greiner, J. Likuski:
Incorporating Redundant Learned Rules: A Preliminary Formal Analysis of EBL. 744-749 - Rich Caruana, Larry J. Eshelman, J. David Schaffer:
Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover. 750-755 - Gunar E. Liepins, Mike R. Hilliard, Mark R. Palmer, Gita Rangarajan:
Alternatives for Classifier System Credit Assignment. 756-761 - David J. Montana, Lawrence Davis:
Training Feedforward Neural Networks Using Genetic Algorithms. 762-767 - John R. Koza:
Hierarchical Genetic Algorithms Operating on Populations of Computer Programs. 768-774 - Raymond J. Mooney, Jude W. Shavlik, Geoffrey G. Towell, Alan Gove:
An Experimental Comparison of Symbolic and Connectionist Learning Algorithms. 775-780 - Sholom M. Weiss, Ioannis Kapouleas:
An Empirical Comparison of Pattern Recognition, Neural Nets, and Machine Learning Classification Methods. 781-787 - Douglas H. Fisher, Kathleen B. McKusick:
An Empirical Comparison of ID3 and Back-propagation. 788-793 - David W. Aha, Dennis F. Kibler:
Noise-Tolerant Instance-Based Learning Algorithms. 794-799 - Steven W. Norton:
Generating Better Decision Trees. 800-805 - David K. Tcheng, Bruce L. Lambert, Stephen C. Y. Lu, Larry A. Rendell:
Building Robust Learning Systems by Combining Induction and Optimization. 806-812 - Robert C. Holte, Liane Acker, Bruce W. Porter:
Concept Learning and the Problem of Small Disjuncts. 813-818 - Paul Thagard, Dawn M. Cohen, Keith J. Holyoak:
Chemical Analogies: Two Kinds of Explanation. 819-824 - Douglas H. Fisher:
Noise-Tolerant Conceptual Clustering. 825-830 - Mirsad Hadzikadic, David Y. Y. Yun:
Concept Formation by Incremental Conceptual Clustering. 831-836 - Wray L. Buntine:
A Critique of the Valiant Model. 837-842 - Qiong Gao, Ming Li:
The Minimum Description Length Principle and Its Application to Online Learning of Handprinted Characters. 843-848 - Luc De Raedt, Maurice Bruynooghe:
Towards Friendly Concept-Learners. 849-858 - Marianne Winslett:
Sometimes Updates Are Circumscription. 859-863 - Vladimir Lifschitz, Arkady Rabinov:
Things That Change by Themselves. 864-867 - Yves Lespérance:
A Formal Account of Self-Knowledge and Action. 868-874