Inductive Inference: Theory and Methods
Tóm tắt
Từ khóa
Tài liệu tham khảo
AN 6 LUIN , D. 1978 . On the complexity of minimum inference of regular sets . Inf. Control 39 , 337 - 350 . AN6LUIN, D. 1978. On the complexity of minimum inference of regular sets. Inf. Control 39, 337-350.
ANCLU l N, D . 1980 a. Inductive inference of formal languages from positive data. In{ . Control 45 , 117 - 135 . ANCLUlN, D. 1980a. Inductive inference of formal languages from positive data. In{. Control 45, 117- 135.
ANGLUIN , D. 1980 b. Finding patterns common to a set of strings . J. Cornput. Syst. Sci. 21 , 46 - 62 . ANGLUIN, D. 1980b. Finding patterns common to a set of strings. J. Cornput. Syst. Sci. 21, 46-62.
ANGLUIN , D. 1982 a. A note on the number of queries needed to identify regular languages. In{ . Control 51 , 76 - 87 . ANGLUIN, D. 1982a. A note on the number of queries needed to identify regular languages. In{. Control 51, 76-87.
BARZDIN , J. M. 1972 . Prognostication of automata and functions. In Information Processing 71, B. Gilchrist , Ed. Elsevier North-Holland , New York , pp. 81 - 84 . BARZDIN, J. M. 1972. Prognostication of automata and functions. In Information Processing 71, B. Gilchrist, Ed. Elsevier North-Holland, New York, pp. 81-84.
BARZO t N, J . M. 1974a. On synthesizing programs given by examples . In Lecture Notes in Cornpurer Science , vol. 5 . Springer-Verlag , New York , pp. 53 - 63 . BARZOtN, J. M. 1974a. On synthesizing programs given by examples. In Lecture Notes in Cornpurer Science, vol. 5. Springer-Verlag, New York, pp. 53-63.
BARZ m~, J. M. 1974 b. Two theorems on the limiting synthesis of functions . Latv. Gos. Univ. Uch. Zapiski 210 , 82 - 88 (in Russian). BARZm~, J. M. 1974b. Two theorems on the limiting synthesis of functions. Latv. Gos. Univ. Uch. Zapiski 210, 82-88 (in Russian).
B~zI~I~ J. M. ANO FREIVALD R. V. 1972. On the prediction of general recursive functions. Soy. Math. Dokl I3 1224-1228. B~zI~I~ J. M. ANO FREIVALD R. V. 1972. On the prediction of general recursive functions. Soy. Math. Dokl I3 1224-1228.
BARZOIN , J. M. , ANO POONIEKS , K. M. 1973 . The theory of inductive inference (in Russian) . In Proceedings of the }st Conference on the Mathematical Foundations of Computer Science (High Tetras, Czechoslovakia). Math. inst. of the Sloyak Academy of Sciences , pp. 9 - 15 . BARZOIN, J. M., ANO POONIEKS, K. M. 1973. The theory of inductive inference (in Russian). In Proceedings of the }st Conference on the Mathematical Foundations of Computer Science (High Tetras, Czechoslovakia). Math. inst. of the Sloyak Academy of Sciences, pp. 9-15.
BERGER , J. , AND PAIR , C. 1978 . Inference for regular bilanguages . J. Comput. Sys. Sci. 16 , 100 - 122 . BERGER, J., AND PAIR, C. 1978. Inference for regular bilanguages. J. Comput. Sys. Sci. 16, 100-122.
BIERMANN , A. W. 1972 . On the inference of Turing machines from sample computations. Arti{ . Intell. 3 , 181 - 198 . BIERMANN, A. W. 1972. On the inference of Turing machines from sample computations. Arti{. Intell. 3, 181-198.
BIERMANN , A. W. 1975 . The inference of regular LISP programs from examples . IEEE Trans. Syst. Man Cybern. SMC-8 , 585 - 600 . BIERMANN, A. W. 1975. The inference of regular LISP programs from examples. IEEE Trans. Syst. Man Cybern. SMC-8, 585-600.
BIERMANI~ , A. W. , AND FELDMAN , J. A. 1972a. A survey of results in grammatical inference . In Frontiers of Pattern Recognition . Academic Press , New York . BIERMANI~, A. W., AND FELDMAN, J. A. 1972a. A survey of results in grammatical inference. In Frontiers of Pattern Recognition. Academic Press, New York.
BIERMANN , A. W. , AND FELDMAN , J. A. 1972 b. On the synthesis of finite-state machines from samples of their behavior . IEEE Trans. Comput. C- 21 , 592 - 597 . BIERMANN, A. W., AND FELDMAN, J. A. 1972b. On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. C- 21, 592-597.
BIERMANN , A. W. , AND KRISHNASWAMY , R. 1976 . Constructing programs from example computations . IEEE Trans. Sofiw. Eng. SE-2 , 141 - 153 . BIERMANN, A. W., AND KRISHNASWAMY, R. 1976. Constructing programs from example computations. IEEE Trans. Sofiw. Eng. SE-2, 141-153.
BIERMANN , A. W. , AND SMIW~ , D. R. 1977 . The hierarchical synthesis of LISP scanning functions. In Information Processing 77, B. Gilchrist , Ed. Elsevier North-Holland , New York , pp. 41 - 45 . BIERMANN, A. W., AND SMIW~, D. R. 1977. The hierarchical synthesis of LISP scanning functions. In Information Processing 77, B. Gilchrist, Ed. Elsevier North-Holland, New York, pp. 41- 45.
BIERMANN , A. W. , BAUM , R. I. , ^No PETRY , F. E. 1975 . Speeding up the synthesis of programs from traces . IEEE Trans. Comput. C-24 , 122 - 136 . BIERMANN, A. W., BAUM, R. I., ^No PETRY, F. E. 1975. Speeding up the synthesis of programs from traces. IEEE Trans. Comput. C-24, 122-136.
BLUM , L. , AND BLUM , M. 1975 . Toward a mathematical theory of inductive inference . Inf. Control 28 , 125 - 155 . BLUM, L., AND BLUM, M. 1975. Toward a mathematical theory of inductive inference. Inf. Control 28, 125-155.
BLUM , M. 1967 a. On the size of machines. In{ . Control 11 , 257 - 265 . BLUM, M. 1967a. On the size of machines. In{. Control 11, 257-265.
BRANDT U. 1981. A characterization of identifiable sets. Preprint Technische Hochschule Darmstadt F.R.G. BRANDT U. 1981. A characterization of identifiable sets. Preprint Technische Hochschule Darmstadt F.R.G.
BRAYER , J. M. , AND FU , K. S. 1977 . A note on the k-tall method of tree grammar inference . IEEE Trans. Syst. Man Cybern. SMC-7 , 293 - 300 . BRAYER, J. M., AND FU, K. S. 1977. A note on the k-tall method of tree grammar inference. IEEE Trans. Syst. Man Cybern. SMC-7, 293-300.
BUCHANAN B. G. AND FEIGENBAUM E. A. 1978. Dendral and Meta-Dendral: Their applications dimension. Artif lnteU. 11 5-24. BUCHANAN B. G. AND FEIGENBAUM E. A. 1978. Dendral and Meta-Dendral: Their applications dimension. Artif lnteU. 11 5-24.
CAS~ ., J., Argo LVN r S, C . 1982 . inductive inference and language identification . In Proceedings of the International Colloquium on Algorithms, Languages, and Programming (ICALP) 82 , (Barcelona, Spain; June). Springer-Verlag, New York , pp. 107 - 115 . CAS~., J., Argo LVNrS, C. 1982. inductive inference and language identification. In Proceedings of the International Colloquium on Algorithms, Languages, and Programming (ICALP) 82, (Barcelona, Spain; June). Springer-Verlag, New York, pp. 107-115.
CASE , J. , AND SMITH , C. 1978 . Anomaly hierarchies of mechanized inductive inference . In Proceedings of the l Oth A CM Symposium on Theory of Computing ( San Diego, Calif., May 1-3). ACM, New York , pp. 314 - 319 . 10.1145/800133.804360 CASE, J., AND SMITH, C. 1978. Anomaly hierarchies of mechanized inductive inference. In Proceedings of the l Oth A CM Symposium on Theory of Computing (San Diego, Calif., May 1-3). ACM, New York, pp. 314-319. 10.1145/800133.804360
CASE , J. , A~D SM rr H, C . 1983 . Comparison of identification criteria for machine inductive inference . Theor. Comput. Sci. 25 , 193 - 220 . CASE, J., A~D SMrrH, C. 1983. Comparison of identification criteria for machine inductive inference. Theor. Comput. Sci. 25, 193-220.
CHAITIN , G. J. 1976 . Information-theoretic characterizations of recursive infinite strings . Theor. Comput. ScL 2 , 45 - 48 . CHAITIN, G. J. 1976. Information-theoretic characterizations of recursive infinite strings. Theor. Comput. ScL 2, 45-48.
Cn EN , K. J. 1982 . Tradeoffs in the inductive inference of nearly minimal size programs . Int. Control 52 , 68 - 86 . CnEN, K. J. 1982. Tradeoffs in the inductive inference of nearly minimal size programs. Int. Control 52, 68-86.
COOK , C. M. , ROSENFELD , A. , AND ARONSON , A. R. 1976 . Grammatical inference by hill-climbing. In{ . Sci. 10 , 59 - 80 . COOK, C. M., ROSENFELD, A., AND ARONSON, A. R. 1976. Grammatical inference by hill-climbing. In{. Sci. 10, 59-80.
COULON , D. , AND KAYSER , D. 1979 . Construction of natural language sentence acceptors by a supervised learning technique . IEEE Trans. Pattern Anal. Mach. lntelL PAMI-1 , 94 - 99 . COULON, D., AND KAYSER, D. 1979. Construction of natural language sentence acceptors by a supervised learning technique. IEEE Trans. Pattern Anal. Mach. lntelL PAMI-1, 94-99.
Cg ESPI -Rr~(~HIZ Zl, S . 1972 . An effective model for grammar inference. In Information Processing 71, B. Gilchrist , Ed. Elsevier North-Holland , New York , pp. 524 - 529 . CgESPI-Rr~(~HIZZl, S. 1972. An effective model for grammar inference. In Information Processing 71, B. Gilchrist, Ed. Elsevier North-Holland, New York, pp. 524-529.
CRESrI-Rr. Gt!IZZl S. AND MANORIOLI D. 1980b. Inferring grammars by means of pro~des: a unifying view. Internal report Ist. di Elettrotechnica ed Elettronica de{ Politechnico di Milano Milan Italy. CRESrI-Rr. Gt!IZZl S. AND MANORIOLI D. 1980b. Inferring grammars by means of pro~des: a unifying view. Internal report Ist. di Elettrotechnica ed Elettronica de{ Politechnico di Milano Milan Italy.
DALP . Y, R . 1977 . On the inference of optimal descriptions . Theor. Comput. Sci. 4 , 301 - 319 . DALP. Y, R. 1977. On the inference of optimal descriptions. Theor. Comput. Sci. 4, 301-319.
DALE~ , R. 1983 . On the error correcting power of pluralism in inductive inference . Theor. Comput. Sci. 24 , 95 - 104 . DALE~, R. 1983. On the error correcting power of pluralism in inductive inference. Theor. Comput. Sci. 24, 95-104.
DALE~ R. AND SMITH C. 1983. On the complexity of inductive inference. Tech. Pep. 83-4 Dept. of Computer Science Univ. of Pittsburgh. DALE~ R. AND SMITH C. 1983. On the complexity of inductive inference. Tech. Pep. 83-4 Dept. of Computer Science Univ. of Pittsburgh.
DIETI'ERIC lt, T. G., AND MICHALSKI , R. S. 1979 . Learning and generalization of characteristic descriptions: Evaluation criteria and comparative review of selected methods . In Proceedings of the 6th International Joint Con/erence on Artificial Intelligence ( Tokyo, Aug.). International Joint Council on Artificial Intelligence , pp. 223 - 231 . DIETI'ERIClt, T. G., AND MICHALSKI, R. S. 1979. Learning and generalization of characteristic descriptions: Evaluation criteria and comparative review of selected methods. In Proceedings of the 6th International Joint Con/erence on Artificial Intelligence (Tokyo, Aug.). International Joint Council on Artificial Intelligence, pp. 223-231.
DIETI'ERICH , T. G. , LONDON , R. , CLARKSON , K. , AND DROME~ , R. 1982. Learning and inductive inference . In The Handbook of Arti{icial Intelligence , P. Cohen and E. Feigenbaum Eds. Kaufman, Los Altos , Calif ., pp. 323 - 512 . DIETI'ERICH, T. G., LONDON, R., CLARKSON, K., AND DROME~, R. 1982. Learning and inductive inference. In The Handbook of Arti{icial Intelligence, P. Cohen and E. Feigenbaum Eds. Kaufman, Los Altos, Calif., pp. 323-512.
DOUCET , P. G. 1974. The syntactic inference problem for D0L sequences . In L-Systems , G. Rozenberg and A. Salomaa, Eds. Springer Lecture Notes on Computer Science, vol. 15 . Springer- Verlag , New York, pp. 146 - 161 . DOUCET, P. G. 1974. The syntactic inference problem for D0L sequences. In L-Systems, G. Rozenberg and A. Salomaa, Eds. Springer Lecture Notes on Computer Science, vol. 15. Springer- Verlag, New York, pp. 146-161.
FEL t) MAN , J. A. 1972 . Some decidability results in grammatical inference. In{ . Control 20 , 244 - 262 . FELt)MAN, J. A. 1972. Some decidability results in grammatical inference. In{. Control 20, 244-262.
FELOMAN , J. A. , AND Sm ELOS , P. 1977 . Total complexity and the inference of best programs. Math. $yst . Theory. 10 , 181 - 191 . FELOMAN, J. A., AND SmELOS, P. 1977. Total complexity and the inference of best programs. Math. $yst. Theory. 10, 181-191.
FELICIANGELI , H. , AND HERMAN , G. 1977 . Algorithms for producing grammars from sample derivations: A common problem of formal language theory and developmental biology . J. Cornput. Syst. Sci. 7 , 97 - 118 . FELICIANGELI, H., AND HERMAN, G. 1977. Algorithms for producing grammars from sample derivations: A common problem of formal language theory and developmental biology. J. Cornput. Syst. Sci. 7, 97-118.
FREDK i N, E . 1964. Techniques using LISP for automatically discovering interesting relations in data . In The Programming Language LISP, Berkey, Ed. M.I.T. Press , Cambridge, Mass ., pp. 108 - 124 . FREDKiN, E. 1964. Techniques using LISP for automatically discovering interesting relations in data. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 108- 124.
FREIVALD , R. V. 1974 . On the limit synthesis of numbers of general recursive functions in various computable numerations. Soy . Math. Dokl. 15 , 1681 - 1683 . FREIVALD, R. V. 1974. On the limit synthesis of numbers of general recursive functions in various computable numerations. Soy. Math. Dokl. 15, 1681-1683.
Fttt ~IVALO , R. V. 1975a. Minimal Godel numbers and their identification in the limit . In Lecture Notes in Computer Science, voL 32 . Springer-Verlag , New York , pp. 219 - 225 . Fttt~IVALO, R. V. 1975a. Minimal Godel numbers and their identification in the limit. In Lecture Notes in Computer Science, voL 32. Springer-Verlag, New York, pp. 219-225.
FP . EI VALD , R. V. 1975 b. On the complexity and optimality of computation in the limit . Latv. Gos. Univ. Uch. Zapiski 233 , 155 - 173 (in Russian). FP. EIVALD, R. V. 1975b. On the complexity and optimality of computation in the limit. Latv. Gos. Univ. Uch. Zapiski 233, 155-173 (in Russian).
FREWALD , R. V. 1979 . Finite identification of general recursive functions by probabilistic strategies . In Proceedings o{ the Conference on Algebraic, Arithmetic, and Categorial Methods in Cornputation Theory ( Berlin , Sept. 1979). L. Budach, Ed. Akademie-Verlag, Berlin, DDR, pp. 138 - 145 . FREWALD, R. V. 1979. Finite identification of general recursive functions by probabilistic strategies. In Proceedings o{ the Conference on Algebraic, Arithmetic, and Categorial Methods in Cornputation Theory (Berlin, Sept. 1979). L. Budach, Ed. Akademie-Verlag, Berlin, DDR, pp. 138-145.
FREIVALO , R. V. , AND WIEHAOEN , R. 1979 . Inductive inference with additional information. E/ectron . Informationsverarb. Kybern. (EIK) 18 , 179 - 185 . FREIVALO, R. V., AND WIEHAOEN, R. 1979. Inductive inference with additional information. E/ectron. Informationsverarb. Kybern. (EIK) 18, 179- 185.
F!t EIVALD , R. V. , KINBEP ,, E. B., AN t) WIi~ttA GP-N , R. 1982 . Inductive inference and computable oneone numberings . Z. Logik Grundlag. Math. 23 , 463 - 479 . F!tEIVALD, R. V., KINBEP,, E. B., ANt) WIi~ttAGP-N, R. 1982. Inductive inference and computable oneone numberings. Z. Logik Grundlag. Math. 23, 463-479.
FRIEDBERG , R , 1958 . Three theorems on recursive enumeration . J. Symb. Logic 23 , 309 - 316 . FRIEDBERG, R, 1958. Three theorems on recursive enumeration. J. Symb. Logic 23, 309-316.
Fu, K. S. 1975. Syntactic Methods in Pattern Recognition . Academic Press , New York . Fu, K. S. 1975. Syntactic Methods in Pattern Recognition. Academic Press, New York.
Fu K. S. 1977. Syntactic Pattern Recognition , Applications . Springer-Verlag , New York . Fu K. S. 1977. Syntactic Pattern Recognition, Applications. Springer-Verlag, New York.
Fu, K. S. 1982. Syntactic Pattern Recognition and Applications . Prentice-Hall , New York . Fu, K. S. 1982. Syntactic Pattern Recognition and Applications. Prentice-Hall, New York.
Fu, K. S., At ~O BOOTH , T. L. 1975 . Grammatical inference: introduction and survey, parts 1 and 2 . IEEE Trans. Syst. Man Cybern. SMC-5 , 95-111 , 409 - 423 . Fu, K. S., At~O BOOTH, T. L. 1975. Grammatical inference: introduction and survey, parts 1 and 2. IEEE Trans. Syst. Man Cybern. SMC-5, 95-111, 409-423.
GACS P. 1983. On the relationship between descriptional complexity and algorithmic probability. Theor. Comput. ScL 22 1 2 71-93. GACS P. 1983. On the relationship between descriptional complexity and algorithmic probability. Theor. Comput. ScL 22 1 2 71-93.
GAINES , B. R. 1976 . Behavior/structure transformations under uncertainty . Int. J. Man-Math. Stud. 8 , 337 - 365 . GAINES, B. R. 1976. Behavior/structure transformations under uncertainty. Int. J. Man-Math. Stud. 8, 337-365.
GAINES , B. R. 1978 . Maryanski's grammatical inferencer . IEEE Trans. Comput. C-28 , 62 - 64 . GAINES, B. R. 1978. Maryanski's grammatical inferencer. IEEE Trans. Comput. C-28, 62-64.
GOLD E. M. 1967. Language identification in the limit. Inf. Control lO 447-474. GOLD E. M. 1967. Language identification in the limit. Inf. Control lO 447-474.
GOLD , E. M. 1972 . System identification via state characterization . AuWmatica 8 , 621 - 636 . GOLD, E. M. 1972. System identification via state characterization. AuWmatica 8, 621-636.
GOLD , E. M. 1978 . Complexity of automaton identification from given data . Inf. Control. 37 , 302 - 320 . GOLD, E. M. 1978. Complexity of automaton identification from given data. Inf. Control. 37, 302- 320.
GONZALEZ , R. C. , A~D TnOM ASON , M. G. 1978. Syntactic Pattern Recognition , An Introduction . Addison-Wesley , Reading, Mass . GONZALEZ, R. C., A~D TnOMASON, M. G. 1978. Syntactic Pattern Recognition, An Introduction. Addison-Wesley, Reading, Mass.
GONZALEZ , R. C. , EDWARDS , J. J. , AND THOMASON , M. G. 1976 . An algorithm for the inference of tree grammars . Int. J. Comput. Inf. ScL 5 , 145 - 164 . GONZALEZ, R. C., EDWARDS, J. J., AND THOMASON, M. G. 1976. An algorithm for the inference of tree grammars. Int. J. Comput. Inf. ScL 5, 145- 164.
HANDY , S. 1975 . Synthesis of LISP programs from examples . In Proceedings of the 4th International Joint Conference on Artificial Intelligence ( Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence , pp. 268 - 273 . HANDY, S. 1975. Synthesis of LISP programs from examples. In Proceedings of the 4th International Joint Conference on Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 268-273.
JANTKE , K. P. 1979 . Natural properties of strategies identifying recursive functions. Elektron. In{ormationsverarb . Kybern. (EIK) 15 , 487 - 496 . JANTKE, K. P. 1979. Natural properties of strategies identifying recursive functions. Elektron. In{ormationsverarb. Kybern. (EIK) 15, 487-496.
JANTKE , K. P. , AND BEICK , H. R. 1981 . Combining postulates of naturalness in inductive inference . Elektron. Informationsverarb. Kybern. (ELK) 17 , 465 - 484 . JANTKE, K. P., AND BEICK, H. R. 1981. Combining postulates of naturalness in inductive inference. Elektron. Informationsverarb. Kybern. (ELK) 17, 465-484.
JOUANNAUD , J. P. , AND GUIHO , G. t979. Inference of functions with an interactive system . In Machine Intelligence 9 , J. E. Hayes, D. Michie, and L. I. Mikulich, Eds. Wiley , New York , pp. 227 - 250 . JOUANNAUD, J. P., AND GUIHO, G. t979. Inference of functions with an interactive system. In Machine Intelligence 9, J. E. Hayes, D. Michie, and L. I. Mikulich, Eds. Wiley, New York, pp. 227- 250.
JOUANNAUD , J. P. , AND KoDsavorr, Y. 1979 . Characterization of a class of functions synthesized by a Summers-like method using a B.M.W. matching technique . In Proceedings of the 6th International Joint Conference on Artificial lnteltigence ( Tokyo, Aug.). international Joint Council on Artificial Intelligence , pp. 440 - 447 . JOUANNAUD, J. P., AND KoDsavorr, Y. 1979. Characterization of a class of functions synthesized by a Summers-like method using a B.M.W. matching technique. In Proceedings of the 6th International Joint Conference on Artificial lnteltigence (Tokyo, Aug.). international Joint Council on Artificial Intelligence, pp. 440-447.
JOUANNAUD , J. P. , ANO KOORATOFF , Y. 1980 . An automatic construction of LISP programs by transformations of functions synthesized from their input-output behavior . Int. J. Policy Analy. Inf. Syst. 4 , 331 - 358 . JOUANNAUD, J. P., ANO KOORATOFF, Y. 1980. An automatic construction of LISP programs by transformations of functions synthesized from their input-output behavior. Int. J. Policy Analy. Inf. Syst. 4, 331-358.
JOUANNAUD , J. P. , GU i HO, G ., ANO TREUIL , T. P. 1977 . S{SP/1, an interactive system able to synthesize functions from examples . In Proceedings of the 5th International Joint Conference on Artificial Intelligence ( Cambridge, Mass., Aug.). International Joint Council on Artificial Intelligence , pp. 412 - 418 . JOUANNAUD, J. P., GUiHO, G., ANO TREUIL, T. P. 1977. S{SP/1, an interactive system able to synthesize functions from examples. In Proceedings of the 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass., Aug.). International Joint Council on Artificial Intelligence, pp. 412-418.
KLETTE , R. , AND WIEHAGEN , R. 1980 . Research in the theory of inductive inference by GDR mathematicians--A survey. Inf . Sc~ 22 , 149 - 169 . KLETTE, R., AND WIEHAGEN, R. 1980. Research in the theory of inductive inference by GDR mathematicians--A survey. Inf. Sc~ 22, 149-169.
KN ong, B., ANO KNOSR , K. 1976 . A method for inferring context-free grammars. In{ . Control 31 , 129 - 146 . KNong, B., ANO KNOSR, K. 1976. A method for inferring context-free grammars. In{. Control 31, 129-146.
KODRATOFF , Y. 1979 . A class of functions synthesized from a finite number of examples and a LISP program scheme . Int. J. Comput. Inf. Sci. 8 , 489 - 521 . KODRATOFF, Y. 1979. A class of functions synthesized from a finite number of examples and a LISP program scheme. Int. J. Comput. Inf. Sci. 8, 489-521.
KODRATOFF , Y. , AN n FAR GUES , J. 1978 . A sane algorithm for the synthesis of LISP functions from example problems . In Proceedings of the AISB/ G~ Conference on Artificial Intelligence (Hamburg, July). Society for the Study of Artificial Intelligence and Simulation of Behavior/Gesellschaft for informatik , pp. 169 - 175 . KODRATOFF, Y., ANn FARGUES, J. 1978. A sane algorithm for the synthesis of LISP functions from example problems. In Proceedings of the AISB/ G~ Conference on Artificial Intelligence (Hamburg, July). Society for the Study of Artificial Intelligence and Simulation of Behavior/Gesellschaft for informatik, pp. 169-175.
KOLMOGOROV , A. N. 1965 . Three approaches to the quantitative definition of information . ProbL In/. Transm. 1 , 1 - 7 . KOLMOGOROV, A. N. 1965. Three approaches to the quantitative definition of information. ProbL In/. Transm. 1, 1-7.
KUOEL , P. 1977 . Induction, pure and simple . Inf. Control 35 , 276 - 336 . KUOEL, P. 1977. Induction, pure and simple. Inf. Control 35, 276-336.
LAUOAN , L. 1977. Progress and Its Problems . University of California Press , Berkeley, Calif . LAUOAN, L. 1977. Progress and Its Problems. University of California Press, Berkeley, Calif.
LEV~NE , B. 1981 . Derivatives of tree sets with applications to grammatical inference . IEEE Trans. Pattern Anal. Mach. lntell. PAMI-3 , 285 - 293 . LEV~NE, B. 1981. Derivatives of tree sets with applications to grammatical inference. IEEE Trans. Pattern Anal. Mach. lntell. PAMI-3, 285-293.
L~V l NE, B . 1982 . The use of tree derivatives and a sample support parameter for inferring tree systerns . IEEE Trans. Pattern Anal. Mach. InteU. PAM{-4 , 25 - 34 . L~VlNE, B. 1982. The use of tree derivatives and a sample support parameter for inferring tree systerns. IEEE Trans. Pattern Anal. Mach. InteU. PAM{-4, 25-34.
LINONER R. 1972. Algorithmische Erkennung. Ph.D. dissertation Friedrich-Schiller-Universitat Jena G.D.R. LINONER R. 1972. Algorithmische Erkennung. Ph.D. dissertation Friedrich-Schiller-Universitat Jena G.D.R.
MAC~ t TE~ , M., AND YOONO , P. 1978. An Introduction to the General Theory of Algorithms . Elsevier North-Holland , New York . MAC~tTE~, M., AND YOONO, P. 1978. An Introduction to the General Theory of Algorithms. Elsevier North-Holland, New York.
M~TIN-LOF , P. 1966 . The definition of random sequences . Inf. Control 9 , 602 -- 619 . M~TIN-LOF, P. 1966. The definition of random sequences. Inf. Control 9, 602--619.
M~TIN-LOF , P. 1971 . Complexity oscillations in infinite binary strings . Z. Wahrscheinlichkeitstheor. Verw. Geb. 19 , 225 - 230 . M~TIN-LOF, P. 1971. Complexity oscillations in infinite binary strings. Z. Wahrscheinlichkeitstheor. Verw. Geb. 19, 225-230.
MARYANSKI , F. J. , AND BOOTH , T. L. 1977 . Inference of finite-state probabilistic grammars . IEEE Trans. Comput. C-26 , 521 - 536 . MARYANSKI, F. J., AND BOOTH, T. L. 1977. Inference of finite-state probabilistic grammars. IEEE Trans. Comput. C-26, 521-536.
MICHALSKI , R. 1980 . Pattern recognition as rule guided inductive inference . IEEE Trans. Pattern Anal. Mach. Intell. PAMI-2 , 349 - 361 . MICHALSKI, R. 1980. Pattern recognition as rule guided inductive inference. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-2, 349-361.
MICHALSKi R. CARBONELL J. ANO MITCHELL T. Eds. 1983. Machine Learning. Tioga Publ. Palo Alto Calif. MICHALSKi R. CARBONELL J. ANO MITCHELL T. Eds. 1983. Machine Learning. Tioga Publ. Palo Alto Calif.
MICLET , L. 1980 . Regular inference with a tail-clustering method . IEEE Tram. Syst. Man Cybern. SMC- 10 , 737 - 743 . MICLET, L. 1980. Regular inference with a tail-clustering method. IEEE Tram. Syst. Man Cybern. SMC- 10, 737-743.
MINICOZZ l, E. 1976 . Some natural properties of strong identification in inductive inference . Theor. Comput. ScL 2 , 345 - 360 . MINICOZZl, E. 1976. Some natural properties of strong identification in inductive inference. Theor. Comput. ScL 2, 345-360.
MITCHELL , T. M. 1982 . Generalization as search. Arti{ . IntelL 18 , 203 - 226 . MITCHELL, T. M. 1982. Generalization as search. Arti{. IntelL 18, 203-226.
NIX , R. 1984 . Editing by example . In Proceedings of the 1 l th A CM Symposium on Principjes of Programming Languages , ( Salt Lake City, Utah, Jan. 15-18). ACM, New York , pp. 186 - 195 . 10.1145/800017.800530 NIX, R. 1984. Editing by example. In Proceedings of the 1 l th A CM Symposium on Principjes of Programming Languages, (Salt Lake City, Utah, Jan. 15-18). ACM, New York, pp. 186-195. 10.1145/800017.800530
OSHERSON , D. N. , AND WE iNS TEIN , $. 1982 . Criteria of language learning . Inf. Control 52 , 123 - 138 . OSHERSON, D. N., AND WEiNSTEIN, $. 1982. Criteria of language learning. Inf. Control 52, 123-138.
PA o, T. W., AND CARR , J. W. , III. 1978 . A solution of the syntactical induction-inference problem for regular languages . Comput. Lang. 3 , 53 - 64 . PAo, T. W., AND CARR, J. W., III. 1978. A solution of the syntactical induction-inference problem for regular languages. Comput. Lang. 3, 53-64.
PIVAR , M. , AND FINKELSTEIN , M. 1964. Automation , using LISP, of inductive inference on sequences . In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge , Mass ., pp. 125 - 136 . PIVAR, M., AND FINKELSTEIN, M. 1964. Automation, using LISP, of inductive inference on sequences. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 125-136.
PIVAR , M. , ANO GOAD , E. 1964. The LISP program for inductive inference on sequences . In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge , Mass ., pp. 260 - 289 . PIVAR, M., ANO GOAD, E. 1964. The LISP program for inductive inference on sequences. In The Programming Language LISP, Berkey, Ed. M.I.T. Press, Cambridge, Mass., pp. 260-289.
PLOTKI~ , G. D. 1970. A note on inductive generalization , in Machine intelligence 5 . Elsevier North- Holland , New York , pp. 153 - 163 . PLOTKI~, G. D. 1970. A note on inductive generalization, in Machine intelligence 5. Elsevier North- Holland, New York, pp. 153-163.
PLOTK m, G. D. 1971b. A further note on inductive generalization . In Machine Intelligence 6 . Elsevier Notch-Holland , New York , pp. 101 - 124 . PLOTKm, G. D. 1971b. A further note on inductive generalization. In Machine Intelligence 6. Elsevier Notch-Holland, New York, pp. 101-124.
PODN } EgS , K. M. 1974 . Comparing various concepts of function prediction, Part {. LaW . Gosudar~t. Univ. Uch. Zapiski 210 , 68 - 81 (in Russian). PODN}EgS, K. M. 1974. Comparing various concepts of function prediction, Part {. LaW. Gosudar~t. Univ. Uch. Zapiski 210, 68-81 (in Russian).
PODNIEKS , K. M. 1975 a. Probabilistic synthesis of enumerated classes of functions. Sou . Math. Doki. 16 , 1042 - 1045 . PODNIEKS, K. M. 1975a. Probabilistic synthesis of enumerated classes of functions. Sou. Math. Doki. 16, 1042-1045.
POON { EKS , K. M. 1975 1). Comparing various concepts of function prediction , Part II. LaW. Gosudarst. Univ. Uch. Zapiski 233 , 33 - 44 . (in Russian). POON{EKS, K. M. 19751). Comparing various concepts of function prediction, Part II. LaW. Gosudarst. Univ. Uch. Zapiski 233, 33-44. (in Russian).
PUTNAM , H. 1975. Probability and confirmation . In Mathematics, Matter and Method . Cambridge Univ. Press, Cambridge , England . PUTNAM, H. 1975. Probability and confirmation. In Mathematics, Matter and Method. Cambridge Univ. Press, Cambridge, England.
REYNOLDS , J. C. 1970. Transformational systems and the algebraic structure of atomic formulas . In Machine Intelligence 5 . Elsevier North-Holland , New York , pp. 135 - 151 . REYNOLDS, J. C. 1970. Transformational systems and the algebraic structure of atomic formulas. In Machine Intelligence 5. Elsevier North-Holland, New York, pp. 135-151.
Sn AP m O, E . 1981 b. A general incremental algorithm that infers theories from facts . In Proceedings o{ ~he 7th International Joint Conference on Artificial Intelligence ( Vancouver, B.C., Canada, Aug.). international Joint Council on Artificial Intelligence , pp. 446 - 451 . SnAPmO, E. 1981b. A general incremental algorithm that infers theories from facts. In Proceedings o{ ~he 7th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Canada, Aug.). international Joint Council on Artificial Intelligence, pp. 446-451.
SHAPIRO , E. Y. 1982 a. Algorithmic program diagnosis , in Proceedings o{ the 9th ACM Symposium on Principles o{ Programming Languages ( Albuquerque, N. Mex.). ACM, New York , pp. 299 - 308 . 10.1145/582153.582185 SHAPIRO, E. Y. 1982a. Algorithmic program diagnosis, in Proceedings o{ the 9th ACM Symposium on Principles o{ Programming Languages (Albuquerque, N. Mex.). ACM, New York, pp. 299- 308. 10.1145/582153.582185
SHAW , D. , SWARTOUT , W. , AND GREEN , C. 1975 . inferring LISP programs from example problems . In Proceedings o{ the 4th International Joint Con- /erence on Artificial Intelligence ( Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence , pp. 260 - 267 . SHAW, D., SWARTOUT, W., AND GREEN, C. 1975. inferring LISP programs from example problems. In Proceedings o{ the 4th International Joint Con- /erence on Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 260-267.
SHINOHARA , T. 1982 a. Polynomial time inference of extended regular pattern languages . In Proceedings, So{tware Science and Engineering , Kyoto, Japan. SHINOHARA, T. 1982a. Polynomial time inference of extended regular pattern languages. In Proceedings, So{tware Science and Engineering, Kyoto, Japan.
SHINOHARA , T. 1982 b. Polynomial time inference of pattern languages and its applications . In Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science. SHINOHARA, T. 1982b. Polynomial time inference of pattern languages and its applications. In Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science.
SmLoss~, L., AN o S YKES , D. 1975 . Automatic program synthesis for example problems . In Proceedings o{ the 4th International Joint Con{erence on Artificial Intelligence ( Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence , pp. 268 - 273 . SmLoss~, L., ANo SYKES, D. 1975. Automatic program synthesis for example problems. In Proceedings o{ the 4th International Joint Con{erence on Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). International Joint Council on Artificial Intelligence, pp. 268-273.
SIMON , H. A. , A~O KOTOVSK~ , K. 1963 . Human acquisition of concepts for sequential patterns . Psych. Rev. 70 , 534 - 546 . SIMON, H. A., A~O KOTOVSK~, K. 1963. Human acquisition of concepts for sequential patterns. Psych. Rev. 70, 534-546.
SMITH , D. R. 1982. A survey of the synthesis of LISP programs from examples . In Automatic Program Construction Techinques, A. W. Biermann, G. Guiho, and Y. Kodratoff, Eds. Macmillan, New York. SMITH, D. R. 1982. A survey of the synthesis of LISP programs from examples. In Automatic Program Construction Techinques, A. W. Biermann, G. Guiho, and Y. Kodratoff, Eds. Macmillan, New York.
SOLOMONOFF , R. J. 1964 . A formal theory of inductive inference. In{ . Control 7 , 1 - 22 , 224-254. SOLOMONOFF, R. J. 1964. A formal theory of inductive inference. In{. Control 7, 1-22, 224-254.
SOLOMONOFF , R. J. 1975 . Inductive inference theory--A unified approach to problems in pattern recognition and artificial intelligence . In Proceedings o{ the 4th International Con{erence Artificial Intelligence ( Tibilsi, Georgia, USSR, Sept.). international Joint Council on Artificial Intelligence , pp. 274 - 280 . SOLOMONOFF, R. J. 1975. Inductive inference theory--A unified approach to problems in pattern recognition and artificial intelligence. In Proceedings o{ the 4th International Con{erence Artificial Intelligence (Tibilsi, Georgia, USSR, Sept.). international Joint Council on Artificial Intelligence, pp. 274-280.
SOLOMONOFF , R. J. 1978 . Complexity.based induction systems: comparisons and convergence theorems . IEEE Trans. in{. Theor. IT-24 , 422 - 432 . SOLOMONOFF, R. J. 1978. Complexity.based induction systems: comparisons and convergence theorems. IEEE Trans. in{. Theor. IT-24, 422-432.
STOLFO , S. J. , AND HARRISON , M. C. 1979. Automatic discovery of heuristics for nondeterministlc programs. Tech. Pep. 7 , Computer Science Dept. , New York University . STOLFO, S. J., AND HARRISON, M. C. 1979. Automatic discovery of heuristics for nondeterministlc programs. Tech. Pep. 7, Computer Science Dept., New York University.
THIELE , H. 1973 . Lernverfahren zur Erkennung formaler Sprachen . Kyberr~ Forsch. 3 , 11 - 93 . THIELE, H. 1973. Lernverfahren zur Erkennung formaler Sprachen. Kyberr~ Forsch. 3, 11-93.
TH{ELP. H. 1975. Zur Charakterisierung yon grkennungssytemen mit einbettendem Konvergenzbegriff. Kornpliziertheit Lern Erkennungsprozessen 2. 188--207. Jena G.D.R. TH{ELP. H. 1975. Zur Charakterisierung yon grkennungssytemen mit einbettendem Konvergenzbegriff. Kornpliziertheit Lern Erkennungsprozessen 2. 188--207. Jena G.D.R.
VAN DER MUDE , A. , AND WALKER , A. 1978 . On the inference of stochastic regular grammars . Inf. Control 38 , 310 - 329 . VAN DER MUDE, A., AND WALKER, A. 1978. On the inference of stochastic regular grammars. Inf. Control 38, 310-329.
VEELENTURF , L. P. J. 1978 . Inference of sequential machines from sample computations . IEEE Trans. Comput. C-27 , 167 - 170 . VEELENTURF, L. P. J. 1978. Inference of sequential machines from sample computations. IEEE Trans. Comput. C-27, 167-170.
VERE S. A. 1980. Multilevel counterfactuals for generalizations of relational concepts and productions. Artif {ntell~ I4 139-164. VERE S. A. 1980. Multilevel counterfactuals for generalizations of relational concepts and productions. Artif {ntell~ I4 139-164.
VERE S. A. 1981. Constrained N-to-1 generalization. Preprint Jet Propulsion Laboratory Pasadena Calif. VERE S. A. 1981. Constrained N-to-1 generalization. Preprint Jet Propulsion Laboratory Pasadena Calif.
WATANA~E , S. 1960 . Information-theoreticalaspects of inductive and deductive inference . IBM J. Res. Devel. 4 , 208 - 231 . WATANA~E, S. 1960. Information-theoreticalaspects of inductive and deductive inference. IBM J. Res. Devel. 4, 208-231.
WEXLER , K. , AND CUL tC OVER , P. 1980. Formal Principles of Language Acquisition . M.I.T. Press , Cambridge, Mass . WEXLER, K., AND CULtCOVER, P. 1980. Formal Principles of Language Acquisition. M.I.T. Press, Cambridge, Mass.
WHARTON , R. M. 1974 . Approximate language identification . Inf. Control 26 , 236 - 255 . WHARTON, R. M. 1974. Approximate language identification. Inf. Control 26, 236-255.
WHARTO n, R. M. 1977 . Grammar enumeration and inference . Inf. Control 33 , 253 - 272 . WHARTOn, R. M. 1977. Grammar enumeration and inference. Inf. Control 33, 253-272.
WIEHAGEN , R. 1976 . Limes-erkennung rekursiver Funktionen durch spezielle Stratigen. Elektron. lnforma~ionsverarbeit . Kybern. (ELK) 12 , 93 - 99 . WIEHAGEN, R. 1976. Limes-erkennung rekursiver Funktionen durch spezielle Stratigen. Elektron. lnforma~ionsverarbeit. Kybern. (ELK) 12, 93-99.
W{~. HAGEN , R. 1977. Identification of formal languages . In Lecture Notes in Computer Science , vol. 53 . Springer-Verlag , New York , pp. 571 - 579 . W{~.HAGEN, R. 1977. Identification of formal languages. In Lecture Notes in Computer Science, vol. 53. Springer-Verlag, New York, pp. 571-579.
WIEHAGEN , R. 1978. Characterization problems in the theory of inductive inference . In Proceedings of the 5th Colloquium on Automata, Languages, and Programming (Udine, Italy, July) , Lecture Notes on Computer Science , vol. 62 . Springer- Verlag , New York , pp. 494 - 508 . WIEHAGEN, R. 1978. Characterization problems in the theory of inductive inference. In Proceedings of the 5th Colloquium on Automata, Languages, and Programming (Udine, Italy, July), Lecture Notes on Computer Science, vol. 62. Springer- Verlag, New York, pp. 494-508.
WIEHA (~ EN, R ., A~O L}~ . PE , W. 1976 . Charakteristche Eigenschaften yon erkennbaren Klassen rekursiver Funktionen. Elektrotr Inforrna. tionsverarbeit . Kybern. (EIK) 12 , 421 - 438 . WIEHA(~EN, R., A~O L}~.PE, W. 1976. Charakteristche Eigenschaften yon erkennbaren Klassen rekursiver Funktionen. Elektrotr Inforrna. tionsverarbeit. Kybern. (EIK) 12, 421-438.
WINSTON , P. 1975. Learning Structural Descriptions from Examples . McGraw-Hill , New York . WINSTON, P. 1975. Learning Structural Descriptions from Examples. McGraw-Hill, New York.
ZLOOF , M. 1977 . Query-by-Example: A data base language . IBM Syst. J. 16 , 324 - 343 . ZLOOF, M. 1977. Query-by-Example: A data base language. IBM Syst. J. 16, 324-343.
ZVO~K t N, A . K., A~D LP .v{ N, L . A. 1970 . The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms . Russian Math. Rev. 25 , 83 - 124 . ZVO~KtN, A. K., A~D LP.v{N, L. A. 1970. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Rev. 25, 83-124.