A Model for Generalization Based on Confirmatory Induction

Confirmatory induction is based on the assumption that unknown individuals are similar to known ones, i.e. they satisfy the properties shared by known individuals. This assumption can be represented inside a non-monotonic logical framework. Accordingly, existing approaches to confirmatory induction take advantage of the machinery developed so far for non-monotonic inference. However, they are based on completion policies that are unnecessary strong for the induction purpose. The contribution of this paper is twofold: some basic requirements that any model for generalization based on confirmatory induction should satisfy are proposed. Then, a model for generalization based on Hempel's notion of confirmation is introduced. This model is rational in the sense that it satisfies the rationality postulates we exhibit; moreover, the completion principle on which this model is based captures exactly the similarity assumption, hence the model can be considered minimal as well.

[1]  Carl G. Hempel,et al.  I.—STUDIES IN THE LOGIC OF CONFIRMATION (II.) , 1945 .

[2]  Ron Rymon,et al.  Search through Systematic Set Enumeration , 1992, KR.

[3]  Luc De Raedt,et al.  First-Order jk-Clausal Theories are PAC-Learnable , 1994, Artif. Intell..

[4]  Peter A. Flach.  Rationality Postulates for Induction , 1996, TARK.

[5]  P. Flach.  Conjectures: an inquiry concerning the logic of induction , 1995 .

[6]  Luc De Raedt,et al.  A Theory of Clausal Discovery , 1993, IJCAI.

[7]  Nicolas Helft,et al.  Induction as Nonmonotonic Inference , 1989, KR.

[8]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[9]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[10]  Pierre Siegel,et al.  Saturation, Nonmonotonic Reasoning and the Closed-World Assumption , 1985, Artif. Intell..

[11]  Pierre Marquis.  Building up Inductive Generalizations from Facts , 1992, ECAI.

[12]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[13]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[14]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[15]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[16]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[17]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[18]  Carl G. Hempel,et al.  A purely syntactical definition of confirmation , 1943, Journal of Symbolic Logic.