The Logic of Learning: A Basis for Pattern Recognition and for Improvement of Performance

Publisher Summary This chapter discusses the logic of learning. It defines the phenomenon of pattern recognition. The two initial concepts in a theory of pattern recognition are illustrated by the set of states of a problem and the subsets of it required by the search reduction techniques. In considerations of language, one can describe certain subsets of the universe other than the elementary concepts: any logical statement involving the names of the elementary concepts defines subsets of the universe. Moreover, one can define relations between objects by specifying that the two satisfy two related statements. The chapter classifies the programs along a number of different parameters. One will be according to the language used. There are two aspects to this: One is the nature of the atoms in the language, that is, whether the predicates take only one variable (and thus define classes) or can also define relations by using more than one variable. The other aspect that distinguishes the languages used in different programs is in the nature of the Horn clauses themselves. The chapter concludes that the study of learning has been directed to specific tasks and accordingly many basic problems have been clarified. As this understanding deepens, the field, likened to artificial intelligence, will develop into two branches, applied and pure.

[1]  Philip J. Stone,et al.  Experiments in induction , 1966 .

[2]  Ranan B. Banerji Some linguistic and statistical problems in pattern recognition , 1970, Pattern Recognit..

[3]  Judea Pearl,et al.  Heuristic Search Theory: Survey of Recent Results , 1981, IJCAI.

[4]  David J. Winter,et al.  Formal Aspects of Cognitive Processes , 1975, Lecture Notes in Computer Science.

[5]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[6]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[7]  Ryszard S. Michalski,et al.  Pattern Recognition as Rule-Guided Inductive Inference , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  S. Vere Induction of concepts in the predicate calculus , 1975, IJCAI 1975.

[9]  Carl,et al.  PROGRAMMING A MODEL OF HUMAN CONCEPT , 2022 .

[10]  Tom M. Mitchell,et al.  Learning and Problem Solving , 1983, IJCAI.

[11]  Ranan B. Banerji Theory of problem solving - an approach to artificial intelligence , 1969, Modern analytic and computational methods in science and mathematics.

[12]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[13]  Ryszard S. Michalski,et al.  Discovering Classification Rules Using variable-Valued Logic System VL1 , 1973, IJCAI.

[14]  Ranan B. Banerji,et al.  Artificial Intelligence: A Theoretical Approach , 1980 .

[15]  Allen Newell,et al.  Report on a general problem-solving program , 1959, IFIP Congress.

[16]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[17]  Manfred Kochen An Experimental Program for the Selection of Disjunctive Hypotheses , 1899 .

[18]  Frederick Hayes-Roth,et al.  Collected papers on the learning and recognition of structured patterns , 1975 .

[19]  R.B. Banerji Theory of problem solving: A branch of artificial intelligence , 1982, Proceedings of the IEEE.

[20]  Ranan B. Banerji,et al.  A Theory for the Complete Mechanization of a GPS-Type Problem Solver , 1977, IJCAI.

[21]  Brian L. Cohen,et al.  A Powerful and Efficient Structural Pattern Recognition System , 1977, Artif. Intell..

[22]  J. Bruner,et al.  A study of thinking , 1956 .

[23]  John Craig Comfort A Flexible Efficient Computer System to Answer Human Questions , 1975, Interdisciplinary System Research / Interdisziplinäre Systemforschung.

[24]  Judea Pearl,et al.  Capacity and Error Estimates for Boolean Classifiers with Limited Complexity , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  Tom M. Mitchell,et al.  Version Spaces: A Candidate Elimination Approach to Rule Learning , 1977, IJCAI.

[26]  David Rothenberg,et al.  Predicate Calculus Feature Generation , 1972, Formal Aspects of Cognitive Processes.

[27]  Barr and Feigenbaum Edward A. Avron,et al.  The Handbook of Artificial Intelligence , 1981 .

[28]  George W. Ernst,et al.  Mechanical Discovery of Classes of Problem-Solving Strategies , 1982, JACM.

[29]  Daniel Chester A flexible efficient computer system to answer human questions: John Craig Comfort. Birkhäuser, Basel, 1975, 137 pages, Sfr.24.- , 1976 .

[30]  Thomas G. Dietterich,et al.  Learning and Inductive Inference , 1982 .

[31]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[32]  Steven A. Vere,et al.  Multilevel Counterfactuals for Generalizations of Relational Concepts and Productions , 1980, Artif. Intell..