메뉴 건너뛰기




Volumn 1398, Issue , 1998, Pages 214-225

Induction of recursive program schemes

Author keywords

Analogy; Cognitive modelling; Inductive program synthesis; Planning and learning

Indexed keywords

MACHINE LEARNING; PATTERN MATCHING; PROBLEM ORIENTED LANGUAGES; SEMANTICS;

EID: 84946060415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0026692     Document Type: Conference Paper
Times cited : (9)

References (21)
  • 4
    • 85027407517 scopus 로고
    • BMWk revisited: Generalization and formalization of an algorithm for detecting recursive relations in term sequences
    • G. Le Blanc. BMWk revisited: Generalization and formalization of an algorithm for detecting recursive relations in term sequences. In F. Bergadano and L. de Raedt, editors, Machine Learning, Proc. of ECML-94, pages 183-197, 1994.
    • (1994) Machine Learning, Proc.ECML-94 , pp. 183-197
    • Le Blanc, G.1    Bergadano, F.2    De Raedt, L.3
  • 5
    • 8344255981 scopus 로고
    • Desiderata for generaization-to-n algorithms
    • Springer
    • W. W. Cohen. Desiderata for generaization-to-n algorithms. In Int. Workshop All '92, Dagstuhl Castle, Germany, volume LNAI 642, pages 140-150. Springer, 1992.
    • (1992) Int. Workshop All '92, Dagstuhl Castle, Germany , vol.642 , pp. 140-150
    • Cohen, W.W.1
  • 9
    • 84957075848 scopus 로고    scopus 로고
    • Inductive synthesis of recursive logic programs: Achievements and prospects. to appear
    • P. Flener and S. Yilmaz. Inductive synthesis of recursive logic programs: Achievements and prospects. to appear.
    • Flener, P.1    Yilmaz, S.2
  • 10
    • 0024885107 scopus 로고
    • Universal planning: An (almost) universally bad idea
    • M. Ginsberg. Universal planning: An (almost) universally bad idea. Al Magazine, 10(4):40-44, 1989.
    • (1989) Al Magazine , vol.10 , Issue.4 , pp. 40-44
    • Ginsberg, M.1
  • 11
    • 84957070823 scopus 로고
    • Characterization of a class of functions synthesized from examples by a summers like method using a `B.M.W.' matching technique. In IJCAI
    • J. P. Jouannaud and Y. Kodratoff. Characterization of a class of functions synthesized from examples by a summers like method using a `B.M.W.' matching technique. In IJCAI, pages 440-447, 1979.
    • (1979) , pp. 440-447
    • Jouannaud, J.P.1    Kodratoff, Y.2
  • 12
  • 13
  • 17
    • 0001871991 scopus 로고
    • Universal plans for reactive robots in unpredictable environments
    • M.J. Schoppers. Universal plans for reactive robots in unpredictable environments. In IJCAI '87, pages 1039-1046, 1987.
    • (1987) IJCAI '87 , pp. 1039-1046
    • Schoppers, M.J.1
  • 18
    • 0017417778 scopus 로고
    • A methodology for LISP program construction from examples
    • P. D. Summers. A methodology for LISP program construction from examples. Journal ACM, 24(1):162-175, 1977.
    • (1977) Journal ACM , vol.24 , Issue.1 , pp. 162-175
    • Summers, P.D.1
  • 20
    • 0020928280 scopus 로고
    • Representation and induction of infinite concepts and recursive action sequences
    • F. Wysotzki. Representation and induction of infinite concepts and recursive action sequences. In Proc. of the 8th IJCAI, Karlsruhe, 1983.
    • (1983) Proc. Of the 8Th IJCAI, Karlsruhe
    • Wysotzki, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.