|
|
|
|
LEADER |
03813nam a2200577 4500 |
001 |
978-3-540-44846-4 |
003 |
DE-He213 |
005 |
20191022032137.0 |
007 |
cr nn 008mamaa |
008 |
121227s2003 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540448464
|9 978-3-540-44846-4
|
024 |
7 |
|
|a 10.1007/b12055
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
072 |
|
7 |
|a UYQ
|2 thema
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Schmid, Ute.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Inductive Synthesis of Functional Programs
|h [electronic resource] :
|b Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning /
|c by Ute Schmid.
|
250 |
|
|
|a 1st ed. 2003.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2003.
|
300 |
|
|
|a XXII, 402 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Artificial Intelligence ;
|v 2654
|
505 |
0 |
|
|a 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.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
650 |
2 |
4 |
|a Science, Humanities and Social Sciences, multidisciplinary.
|0 http://scigraph.springernature.com/things/product-market-codes/A11007
|
650 |
2 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
650 |
2 |
4 |
|a Software Engineering.
|0 http://scigraph.springernature.com/things/product-market-codes/I14029
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|0 http://scigraph.springernature.com/things/product-market-codes/I1603X
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|0 http://scigraph.springernature.com/things/product-market-codes/I16048
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662211618
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540401742
|
830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 2654
|
856 |
4 |
0 |
|u https://doi.org/10.1007/b12055
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|