Without a title - Contents

• 1. Introduction
• 2. 2. YAILS learning
  • 2.1 The main cycle of the program
  • 2.2 Modification of rules
  • 2.3 Invention of new rules
  • 2.4 2.4. Search transformations
    • 2.4.1 Generalization operators
      • 2.4.1.1 Drop-condition operator
      • 2.4.1.2 Enlarging intervals operator
    • 2.4.2 Specialization operators
      • 2.4.2.1 Add condition (numeric + symbolic) operator
      • 2.4.2.2 Restricting intervals operator
    • 2.4.3 Search Control
  • 2.5 Evaluation Function
  • 2.6 Incomplete information
    • 2.6.1 Unknown values
    • 2.6.2 Incomplete examples
• 3. 3. Classification strategies
  • 3.1 Redundancy
  • 3.2 Weighted flexible matching
  • 3.3 Conflict resolution
  • 3.4 "Normal", "only foreground" and "all" strategies
• 4. 4. Implementation considerations
  • 4.1 YAP-prolog
  • 4.2 Data-structures
  • 4.3 Efficiency problems
• 5. 5. Using YAILS
  • 5.1 5.1. Learning
  • 5.2 5.2. Classifying
  • 5.3 5.3. Testing
• 6. References