rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Inductive Synthesis of Functional Programs
    sub title: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning
  name:
    name part: Schmid, Ute.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2003
    edition: 1st ed. 2003.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXII, 402 p. online resource.
  abstract: Because of its promise to support human programmers in developing correct and efficient program code and in reasoning about programs, automatic program synthesis has attracted the attention of researchers and professionals since the 1970s. This book focusses on inductive program synthesis, and especially on the induction of recursive functions; it is organized into three parts on planning, inductive program synthesis, and analogical problem solving and learning. Besides methodological issues in inductive program synthesis, emphasis is placed on its applications to control rule learning for planning. Furthermore, relations to problem solving and learning in cognitive psychology are discussed.
  table of contents: 1. Introduction -- 1. Introduction -- I. Planning -- 2. State-Based Planning -- 3. Constructing Complete Sets of Optimal Plans -- 4. Integrating Function Application in State-Based Planning -- 5. Conclusions and Further Research -- II. Inductive Program Synthesis -- 6. Automatic Programming -- 7. Folding of Finite Program Terms -- 8. Transforming Plans into Finite Programs -- 9. Conclusions and Further Research -- III. Schema Abstraction -- 10. Analogical Reasoning and Generalization -- 11. Structural Similarity in Analogical Transfer -- 12. Programming by Analogy -- 13. Conclusions and Further Research.
  note: by Ute Schmid.
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer programming
  subject:
    topic: Software engineering
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Artificial Intelligence
  subject:
    topic: Science, Humanities and Social Sciences, multidisciplinary
  subject:
    topic: Programming Techniques
  subject:
    topic: Software Engineering
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: Q334-342
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Artificial Intelligence ; 2654
  identifier: 9783540448464
  identifier: https://doi.org/10.1007/b12055
  record info:
    record creation date: 121227
    record change date: 20191022032137.0
    record identifier: 978-3-540-44846-4