Inferring answers to queries

One focus of inductive inference is to infer a program for a function f from observations or queries about f. We propose a new line of research which examines the question of inferring the answers to queries. For a given class of computable functions, we consider the learning (in the limit) of properties of these functions that can be captured by queries formulated in a logical language L. We study the inference types that arise in this context. Of particular interest is a comparison between the learning of properties and the learning of programs. Our results suggest that these two types of learning are incomparable. In addition, our techniques can be used to prove a general lemma about query inference [19]. We show that I J ) QI(L) QJ(L) for many standard inference types I, J and many query languages L. Hence any separation that holds between these inference types also holds between the corresponding query inference types. One interesting consequence is that [24,49]QEX0 ([Succ,<] 2 ) [2,4]QEX0 ([Succ,<] 2 )6;.

[1]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[2]  Robert I. Soare,et al.  Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.

[3]  Robert P. Daley.  On the Error Correcting Power of Pluralism in BC-Type Inductive Inference , 1983, Theoretical Computer Science.

[4]  H. Putnam,et al.  The Decision Problem for Exponential Diophantine Equations , 1961 .

[5]  Efim Kinber,et al.  On the Classification of Computable Languages , 1997, STACS.

[6]  William I. Gasarch,et al.  Reductions for learning via queries , 1995, COLT '95.

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

[8]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[9]  J. Case,et al.  Subrecursive Programming Systems: Complexity & Succinctness , 1994 .

[10]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  James S. Royer,et al.  Subrecursive Programming Systems , 1994, Progress in Theoretical Computer Science.

[12]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[13]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[14]  John Case,et al.  Machine Learning of Higher-Order Programs , 1994, J. Symb. Log..

[15]  Frank Stephan.  Learning via queries and oracles , 1995, COLT '95.

[16]  Martin D. Davis.  Hilbert's Tenth Problem is Unsolvable , 1973 .

[17]  William I. Gasarch,et al.  Learning via queries , 1992, COLT '88.

[18]  Carl H. Smith,et al.  A Recursive Introduction to the Theory of Computation , 1994, Graduate Texts in Computer Science.

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

[20]  J. Case,et al.  Subrecursive programming systems - complexity and succinctness , 1994 .

[21]  Carl H. Smith,et al.  Generalization versus classification , 1992, COLT '92.

[22]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[23]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[24]  J. R. Büchi,et al.  The monadic second order theory of all countable ordinals , 1973 .

[25]  John Case,et al.  Machine learning of higher-order programs , 1994 .

[26]  Carl H. Smith,et al.  Learning via queries , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[27]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[28]  Bala Kalyanasundaram,et al.  Breaking the probability ½ barrier in FIN-type learning , 1992, COLT '92.

[29]  Bala Kalyanasundaram,et al.  Breaking the Probability 1/2 Barrier in FIN-Type Learning , 1995, J. Comput. Syst. Sci..

[30]  Calvin C. Elgot,et al.  Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.

[31]  Yaacov Choueka,et al.  Theories of Automata on omega-Tapes: A Simplified Approach , 1974, J. Comput. Syst. Sci..

[32]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[33]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[34]  Rolf Wiehagen,et al.  Classification of predicates and languages , 1994 .

[35]  Carl H. Smith,et al.  Generalization versus classification , 1995, J. Exp. Theor. Artif. Intell..

[36]  John Case,et al.  On learning limiting programs , 1992, COLT '92.

[37]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .