Artificial intelligence methods and applications /

This volume is the first in a series which deals with the challenge of AI issues, gives updates of AI methods and applications, and promotes high quality new ideas, techniques and methodologies in AI. This volume contains articles by 38 specialists in various AI subfields covering theoretical and ap...

Full description

Saved in:
Bibliographic Details
Other Authors: Bourbakis, Nikolaos G.
Format: eBook
Language:English
Published: Singapore ; River Edge, N.J. : World Scientific, ©1992.
Series:Advanced series on artificial intelligence ; vol. 1.
Subjects:
Online Access:CONNECT
CONNECT
Table of Contents:
  • ""CONTENTS""; ""INTRODUCTION TO ADVANCED SERIES ON ARTIFICIAL INTELLIGENCE""; ""A BRIEF INTRODUCTION OF AI""; ""FOREWORD TO THE SERIES""; ""PROLOGUE""; ""CONTRIBUTORS""; ""SECTION 1 LOGIC""; ""FUNDAMENTAL METHODS FOR HORN LOGIC AND ARTIFICIAL INTELLIGENCE APPLICATIONS""; ""1 INTRODUCTION""; ""1.1 The Scope and Motivation of this Chapter""; ""1.2 The Character of Rewrite Methods""; ""1.3 Some History and Relations to Other Approaches""; ""1.4 Layout of the Chapter""; ""2 HORN LOGIC""; ""2.1 The Subsumption Lattice of First-OrderTerms""; ""2.2 Atoms and Horn Formulas""
  • ""3 REWRITING METHODS FOR HORN LOGIC""""3.1 Overview of Rewriting Concepts""; ""3.2 Rewriting for Horn Logic""; ""4 APPLICATIONS""; ""4.1 Automated Theorem Proving""; ""4.2 Learning""; ""43 Program Synthesis""; ""4.4 Diagnosis""; ""5 BIBLIOGRAPHY""; ""SECTION 2 SEARCHING""; ""CHAPTER 2 On Optimizing a Search Problem1""; ""1 Introduction""; ""2 Basic Search Techniques""; ""3 Optimization for a Search Problem""; ""3.1 The Optimization Problem""; ""3.2 Local Optimization""; ""3.3 Optimizing a Search Problem""; ""4 The Satisfiability (SAT) Problem""
  • ""5 A Discrete Local Search Algorithm for the Satisfiability Problem""""6 Average Time Analysis""; ""7 UniSAT: A Universal SAT Problem Model""; ""8 A Quantitative Local Search Algorithm for the Satisfiability Problem""; ""9 Experimental Results""; ""9.1 Performance of the SAT1 algorithm""; ""9.2 Performance of the SAT14.2 algorithm""; ""10 Conclusion""; ""Acknowledgements""; ""APPENDIX A: The Average Time Complexities of Several SAT1 Algorithms""; ""A.1 Preliminaries""; ""A.2 The Average Time Complexity of the SAT1.1 Algorithm""; ""A.3 The Average Time Complexity of the SAT1.2 Algorithm""
  • ""A.4 The Average Time Complexity of the SAT1.3 Algorithm""""References""; ""CHAPTER 3 APPLICATION OF GENETIC ALGORITHMS TO PERMUTATION PROBLEMS""; ""1. Introduction""; ""2. Background""; ""2.1. Basic Definitions""; ""2.2. The GA Recombination Operators""; ""2.3. The Schema Theorem""; ""3. Permutation Problems""; ""4. Analysis of Order Crossover""; ""5. Experimental Results""; ""6. Conclusions""; ""References""; ""Appendix A. Problem Data""; ""Appendix B. Crossover Rules""; ""B.1. Interleaving Crossover Using a Fixed Number of Crossover Sites""
  • ""B.2. Interleaving Using a Random Number of Crossing Sites""""B.3. Permutation Crossover Rules""; ""SECTION 3 LEARNING""; ""CHAPTER 4 A LOGICAL BASIS FOR LEARNING""; ""1. INTRODUCTION""; ""1.1. The Problem of Concept Learning""; ""1.2. The Aims of the Present Chapter""; ""1.3. Layout of the Chapter""; ""2. OVERVIEW OF THE APPROACH: TWO EXAMPLES""; ""2.1. Example 1: Block World""; ""2.2. Example 2: Elementary Number Theory""; ""3. THE BASIC NOTIONS""; ""3.1. Terms, Atoms and Substitutions""; ""3.2. Some Horn Logic""; ""4. A LOGICAL BASIS FOR LEARNING""; ""4.1. Defining Learnable Concepts""