PAL: A Pattern-Based First-Order Inductive System

  • Authors:
  • Eduardo F. Morales

  • Affiliations:
  • ITESM –/ Campus Morelos, Apto. Postal C-99, Cuernavaca, Morelos, 62050, Mé/xico/ E-mail: emorales@campus.mor.itesm.mx

  • Venue:
  • Machine Learning - special issue on inductive logic programming
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has been argued that much of human intelligence can beviewed as the process of matching stored patterns. In particular, itis believed that chess masters use a pattern–based knowledge toanalyze a position, followed by a pattern–based controlled search toverify or correct the analysis. In this paper, a first–order system,called PAL, that can learn patterns in the form of Horn clauses fromsimple example descriptions and general purpose knowledge isdescribed. The learning model is based on (i) a constrained leastgeneral generalization algorithm to structure the hypothesis space andguide the learning process, and (ii) a pattern–based representation knowledge to constrain the construction of hypothesis.It is shown how PAL can learn chess patterns which are beyond thelearning capabilities of current inductive systems. The samepattern–based approach is used to learn qualitative models of simpledynamic systems and counterpoint rules for two–voice musical pieces.Limitations of PAL in particular, and first–order systems in general,are exposed in domains where a large number of background definitionsmay be required for induction. Conclusions and future researchdirections are given.