Introducing new predicates to model scientific revolution

Abstract The notion of necessary new terms (predicates) is proposed. It is shown that necessary new predicates in first‐order logic must be directly, recursively defined. I present a first‐order inductive learning algorithm that introduces new necessary predicates to model scientific revolution in which a new language is adopted. I demonstrate that my learning system can learn a genetic theory with theoretical terms which, after being induced by my system, can be interpreted as either types of genetic properties (dominant or recessive) or genes, depending on the representation of the hypotheses of the same theoretical terms.

[1]  Clark Glymour.  Inductive inference in the limit , 1985 .

[2]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[3]  Daniel N. Osherson,et al.  A reason for theoretical terms , 1990 .

[4]  Stephen Muggleton,et al.  Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.

[5]  Marin Marinov,et al.  A Symbolic Model of the Nonconscious Acquisition of Information , 1994, Cogn. Sci..

[6]  Stan Matwin,et al.  Learning Recursive Relations with Randomly Selected Small Training Sets , 1994, ICML.

[7]  K. Popper,et al.  The Logic of Scientific Discovery , 1960 .

[8]  Larry A. Rendell,et al.  Learning hard concepts through constructive induction: framework and rationale , 1990, Comput. Intell..

[9]  Daniel N. Osherson,et al.  On Advancing Simple Hypotheses , 1990, Philosophy of Science.

[10]  Tyrone Lai.  Discovery as a Problem for the Inventor , 1991, The British Journal for the Philosophy of Science.

[11]  S. C. Kleene,et al.  Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols , 1952 .

[12]  Stan Matwin,et al.  Constructive Inductive Logic Programming , 1993, International Joint Conference on Artificial Intelligence.

[13]  Larry A. Rendell,et al.  Constructive Induction On Decision Trees , 1989, IJCAI.

[14]  Leon Sterling,et al.  Refinement Strategies for Inductive Leaming of Simple Prolog Programs , 1991, IJCAI.

[15]  Ehud Shapiro,et al.  Inductive Inference of Theories from Facts , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[16]  T. Kuhn,et al.  The Structure of Scientific Revolutions. , 1964 .

[17]  Herbert A. Simon.  Scientific discovery as problem solving , 1992 .

[18]  Herbert A. Simon,et al.  Rule Creation and Rule Learning Through Environmental Exploration , 1989, IJCAI.

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

[20]  Charles X. Ling,et al.  Inductive Learning from Good Examples , 1991, IJCAI.

[21]  Lyle H. Ungar,et al.  Inventing theoretical terms in inductive learning , 1989 .

[22]  Daniel N. Osherson,et al.  Identification in the limit of first order structures , 1986, Journal of Philosophical Logic.

[23]  H. Simon,et al.  Fitness Requirements for Scientific Theories Containing Recursive Theoretical Terms , 1993, The British Journal for the Philosophy of Science.

[24]  Stephen Muggleton,et al.  Efficient Induction of Logic Programs , 1990, ALT.

[25]  Daniel N. Osherson,et al.  Paradigms of truth detection , 1989, J. Philos. Log..

[26]  Stan Matwin,et al.  Inverting Implication with Small Training Sets , 1994, ECML.

[27]  C. Ling,et al.  Answering the connectionist challenge: a symbolic model of learning the past tenses of English verbs , 1993, Cognition.

[28]  Herbert A. Simon,et al.  Scientific discovery: compulalional explorations of the creative process , 1987 .