Abstract
It has been argued that much of human intelligence can be viewed as the process of matching stored patterns. In particular, it is believed that chess masters use a pattern–based knowledge to analyze a position, followed by a pattern–based controlled search to verify or correct the analysis. In this paper, a first–order system, called PAL, that can learn patterns in the form of Horn clauses from simple example descriptions and general purpose knowledge is described. The learning model is based on (i) a constrained least general generalization algorithm to structure the hypothesis space and guide 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 the learning capabilities of current inductive systems. The same pattern–based approach is used to learn qualitative models of simple dynamic 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 definitions may be required for induction. Conclusions and future research directions are given.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Berliner, H.J. (1977). “A representation and some mechanisms for a problem-solving chess program”. In M.R.B. Clarke (Eds.), Advances in Computer Chess 1, Edinburgh: Edinburgh University Press.
Bramer, M. A. (1977). “Representation of knowledge for chess endgames: Towards a self-improving system”. PhD ThesisOpen University, Milton Keynes.
Bratko, I. (1982). “Knowledge-based problem-solving in AL3”. In J.E. Hayes, D. Michie, & Y.H. Pao (Eds.), Machine Intelligence 10, Horwood.
Bratko, I., Muggleton, S., & Varsek, A. (1992). “Learning qualitative models of dynamic systems”. In S. Muggleton (Eds.), Inductive Logic Programming, London: Academic Press.
Buntine, W. (1988). “Generalized subsumption and its applications to induction and redundancy”, Artificial Intelligence, 36(2), 149-176.
Campbell, D. T. (1966). Pattern Matching as an Essential in Distal Knowing, New York: Holt, Rinehart and Winston.
Charness, N. (1977). “Chess skill in man and machine”, In P.W. Frey (Eds.), Human chess skill, Springer-Verlag.
Cohen, W. (1992) “Compiling prior knowledge into an explicit bias”, Proceedings of the Eighth International Workshop on Machine Learning (pp. 485-489). San Mateo: CA: Morgan Kaufman.
Coiera, E. (1989) “Generating qualitative models from example behaviors”, DCS Report No. 8901, School of Electrical Engineering and Computer Science, University of New South Wales, Sydney, Australia.
de Groot, A. (1965). Thought and Choice in Chess, The Hague: Mouton.
de Jong, G. & Mooney, R. (1986). “Explanation-based learning: an alternative view”, Machine Learning, 1(2), 145-176.
de Raedt, L. & Bruynooghe, M. (1988). “On interactive concept-learning and assimilation”, Proceedings of the Third European Working Session on Learning, (167-176), London: Pitman.
de Raedt, L. & Bruynooghe, M. (1990). “Indirect relevance and bias in inductive concept-learning”, Knowledge Acquisition, 2(4), 365-390.
Dzeroski, S. & Bratko, I. (1992). “Handling noise in inductive logic programming”, Proceedings of the Seciond International Workshop on Inductive Progamming, (pp. XX–YY), Tokyo, Japan, ICOT TM-1181, Institute for New Generation Computer Technology.
Flann, N. S. & Dietterich, T. G. (1989). “A study of explanation-based methods for inductive learning”, Machine Learning, 4(2), 187-226.
Huberman, B. J. (1968). “A program to play chess end games”, CS-106, Computer Science Department, Stanford University, Stanford, CA.
Kuipers, B. (1986). “Qualitative simulation”, Artificial Intelligence, 29 (3), 289-338.
Lavrac, N., Dzeroski, S., & Grobelnik, M. (1991). “Learning nonrecursive definitions of relations with linus”, Proceedings of the European Working Session on Learning, (265-281), Berlin: Springer-Verlag.
Levinson, R. & Snyder, R. (1991) “Adaptive Pattern-Oriented Chess”, Proceedings of the Ninth National Conference on Artifical Intelligence, (601-606), Boston: AAAI Press-The MIT Press
Lorenz, K. (1973) Behind the Mirror, New York: Harcourt Brace Jovanovich.
Man, A. (1971) The study of counterpoint from Johann Joseph Fux's Gradus ad Parnassum, W.W. Norton & Company.
Minton, S. (1984). “Constraint-based generalization: learning game-playing plans from single examples”, Proceedings of the National Conference on Artificial Intelligence, (251-254), Menlo Park, CA: Kaufmann.
Mitchell, T. M., Keller, R. M. & Kedar-Cabelli, S. T. (1986). “Explanation-based generalization: a unifying view”, Machine Learning, 1(1), 47-80.
Morales, E. (1992) “First order induction of patterns in Chess”, PhD Thesis, The Turing Institute-University of Strathclyde, Glasgow.
Morales, E. (1994). “Learning patterns for playing strategies”, ICCA Journal, 17(1), 15-26.
Muggleton, S. (1995) New Generation Computing Journal 13: 245-286.
Muggleton, S. (1992) Inductive Logic Programming, London: Academic Press.
Muggleton, S. & Feng, C. (1990). “Efficient Induction of Logic Programs”, In S. Muggleton (Eds.), Inductive Logic Programming, London: Academic Press.
Niblett, T. (1988). “A study of generalisation in logic programs”, Proceedings of the Third European Working Session on Learning, (131-138), London: Pitman.
Pitrat, J. (1977). “A chess combination program which uses plans”, Artificial Intelligence, 8, 275-321.
Plotkin, G. D. (1969). “A note on inductive generalization”, In B. Meltzer & D. Michie (Eds.), Machine Intelligence 5, Edinburgh: Edinburgh University Press.
Plotkin, G. D. (1971a). “A further note of inductive generalization”, In B. Meltzer & D. Michie (Eds.), Machine Intelligence 6, Edinburgh: Edinburgh University Press.
Plotkin, G. D. (1971b). “Automatic methods of inductive inference”, PhD Thesis, University of Edinburgh, Edinburgh.
Quinlan, J. R. (1983). “Learning efficient classification procedures and their application to chess end games”, In R.S. Michalski, J.G. Carbonell, & T.M. Mitchell (Eds.), Machine Learning: an artificial intelligence approach, Palo Alto, CA: Tioga.
Quinlan, J. R. (1990). “Learning logical definitions from relations”, Machine Learning, 5(3), 239-266.
Rouveurol, C. (1991) “ITOU: Induction of first order theories”, In S. Muggleton (Eds.), Proceedings of the International Workshop of Logic Programming, Viana de Castelo, Portugal.
Shapiro, E.Y. (1983) Algorithmic program debugging. MIT Press.
Shapiro, A. D. (1987) Structured induction in expert systems, Wokingham: Turing Institute Press in association with Addison-Wesley.
Tadepalli, P. (1989) “Planning in games using approximately learned macros”, In B. Spatz (Eds.), Proceedings of the Sixth International Workshop on Machine Learning, (221-223), San Mateo, CA: Morgan Kaufmann.
Widmer, G. (1992). “The importance of basic musical knowledge for effective learning”, In M. Balaban, J. Ebcioğlu & O. Laske (Eds.), Understandig Musica with AI: Perspectives on Music Cognition, Cambridge-Menlo Park: AAAI Press/MIT Press.
Wilkins, D. E. (1979) “Using patterns and plans to solve problems and control search”, ( AIM-329; STAN-CS-79-747), Stanford University, Artificial Intelligence Laboratory, Stanford, CA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Morales, E.F. PAL: A Pattern-Based First-Order Inductive System. Machine Learning 26, 227–252 (1997). https://doi.org/10.1023/A:1007373508948
Issue Date:
DOI: https://doi.org/10.1023/A:1007373508948