Inductive synthesis of functional programs: universal planning, folding of finite programs, and schema abstraction by analogical reasoning
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2003
|
| Schriftenreihe: | Lecture notes in computer science
2654 : Lecture notes in artificial intelligence |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XXII, 398 S. |
| ISBN: | 3540401741 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV017391752 | ||
| 003 | DE-604 | ||
| 005 | 20050609 | ||
| 007 | t| | ||
| 008 | 030805s2003 gw m||| 00||| eng d | ||
| 016 | 7 | |a 967573157 |2 DE-101 | |
| 020 | |a 3540401741 |9 3-540-40174-1 | ||
| 035 | |a (OCoLC)52728961 | ||
| 035 | |a (DE-599)BVBBV017391752 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-91G |a DE-29T |a DE-473 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA76.6 | |
| 082 | 0 | |a 005.1 |2 22 | |
| 084 | |a DAT 704f |2 stub | ||
| 100 | 1 | |a Schmid, Ute |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Inductive synthesis of functional programs |b universal planning, folding of finite programs, and schema abstraction by analogical reasoning |c Ute Schmid |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2003 | |
| 300 | |a XXII, 398 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 2654 : Lecture notes in artificial intelligence | |
| 500 | |a Includes bibliographical references and index | ||
| 650 | 4 | |a Génie logiciel | |
| 650 | 7 | |a Génie logiciel |2 rasuqam | |
| 650 | 4 | |a Intelligence artificielle | |
| 650 | 7 | |a Intelligence artificielle |2 rasuqam | |
| 650 | 4 | |a Programmation (Informatique) | |
| 650 | 7 | |a Programmation |2 rasuqam | |
| 650 | 7 | |a Raisonnement analogique |2 rasuqam | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Software engineering | |
| 650 | 0 | 7 | |a Automatische Programmierung |0 (DE-588)4143702-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Induktion |0 (DE-588)4026765-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmsynthese |0 (DE-588)4295513-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Automatische Programmierung |0 (DE-588)4143702-0 |D s |
| 689 | 0 | 1 | |a Funktionale Programmierung |0 (DE-588)4198740-8 |D s |
| 689 | 0 | 2 | |a Programmsynthese |0 (DE-588)4295513-0 |D s |
| 689 | 0 | 3 | |a Induktion |0 (DE-588)4026765-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 2654 : Lecture notes in artificial intelligence |w (DE-604)BV000000607 |9 2654 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010479331&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010479331 | |
Datensatz im Suchindex
| _version_ | 1820874925523599360 |
|---|---|
| adam_text |
YYUTE SCHMID
INDUCTIVE SYNTHESIS
OF FUNCTIONAL PROGRAMS
UNIVERSAL PLANNING, FOLDING OF FINITE PROGRAMS,
AND SCHEMA ABSTRACTION BY ANALOGICAL REASONING
I
H
YY
: ';YYYYYY.YYYYYY
.
SPRINGER
TABLE OF CONTENT
S
1. INTRODUCTIO
N 1
PART I. PLANNIN
G
2. STATE-BASE
D PLANNIN
G
13
2.1 STANDARD STRIPS 13
2.1.1 A BLOCKS-WORLD EXAMPLE 14
2.1.2 BASIC DEFINITIONS 14
2.1.3 BACKWARD OPERATOR APPLICATION 18
2.2 EXTENSIONS AND ALTERNATIVES TO STRIPS 20
2.2.1 THE PLANNING DOMAIN DEFINITION LANGUAGE 20
2.2.2 SITUATION CALCULUS 24
2.3 BASIC PLANNING ALGORITHMS 27
2.3.1 INFORMAL INTRODUCTION OF BASIC CONCEPTS 28
2.3.2 FORWARD PLANNING 29
2.3.3 FORMAL PROPERTIES OF PLANNING 32
2.3.4 BACKWARD PLANNING 35
2.4 PLANNING SYSTEMS 40
2.4.1 CLASSICAL APPROACHES 40
2.4.2 CURRENT APPROACHES 42
2.4.3 COMPLEX DOMAINS AND UNCERTAIN ENVIRONMENTS 44
2.4.4 UNIVERSAL PLANNING 45
2.4.5 PLANNING AND RELATED FIELDS 48
2.4.6 PLANNING LITERATURE 50
2.5 AUTOMATIC KNOWLEDGE ACQUISITION FOR PLANNING 51
2.5.1 PRE-PLANNING ANALYSIS 51
2.5.2 PLANNING AND LEARNING 51
3. CONSTRUCTIN
G COMPLET
E SET
S OF OPTIMA
L PLAN
S
55
3.1 INTRODUCTION TO DPLAN 55
3.1.1 DPLAN PLANNING LANGUAGE 56
3.1.2 DPLAN ALGORITHM 57
XII I TABLE OF CONTENTS
I
3.1.3 EFFICIENCY CONCERNS 58
3.1.4 EXAMPLE PROBLEMS 59
3.2 OPTIMAL FULL UNIVERSAL PLANS 64
3.3 TERMINATION, SOUNDNESS, COMPLETENESS 66
3.3.1 TERMINATION OF DPLAN 66
3.3.2 OPERATOR RESTRICTIONS 67
3.3.3 SOUNDNESS AND COMPLETENESS OF DPLAN 70
4
. INTEGRATIN
G FUNCTIO
N APPLICATIO
N IN PLANNIN
G
71
4.1 MOTIVATION 71
4.2 EXTENDING STRIPS T
O FUNCTION APPLICATIONS 74
4.3 EXTENSIONS OF FPLAN YY 79
4.3.1 BACKWARD OPERATOR APPLICATION 79
4.3.2 INTRODUCING USER-DEFINED FUNCTIONS 81
4.4 EXAMPLES 82
4.4.1 PLANNING WITH RESOURCE VARIABLES 83
4.4.2 PLANNING FOR NUMERICAL PROBLEMS 85
4.4.3 FUNCTIONAL PLANNING FOR STANDARD PROBLEMS 87
4.4.4 MIXING ADD/DEL EFFECTS AND UPDATES 88
4.4.5 PLANNING FOR PROGRAMMING PROBLEMS : 88
4.4.6 CONSTRAINT SATISFACTION AND PLANNING 90
5. CONCLUSION
S AND FURTHER RESEARC
H
93
5.1 COMPARING DPLAN WITH THE STATE OF THE ART 93
5.2 EXTENSIONS OF DPLAN 94
5.3 UNIVERSAL PLANNING VERSUS INCREMENTAL EXPLORATION 95
PAR
T II
. INDUCTIV
E PROGRA
M SYNTHESI
S
6. AUTOMATI
C PROGRAMMIN
G
99
6.1 OVERVIEW OF AUTOMATIC PROGRAMMING RESEARCH 100
6.1.1 AI AND SOFTWARE ENGINEERING 100
6.1.2 APPROACHES TO PROGRAM SYNTHESIS 102
6.1.3 POINTERS TO LITERATURE 109
6.2 DEDUCTIVE APPROACHES 110
6.2.1 CONSTRUCTIVE THEOREM PROVING 110
6.2.2 PROGRAM TRANSFORMATION 115
6.3 INDUCTIVE APPROACHES 124
6.3.1 FOUNDATIONS OF INDUCTION 124
6.3.2 GENETIC PROGRAMMING 134
6.3.3 INDUCTIVE LOGIC PROGRAMMING 140
6.3.4 INDUCTIVE FUNCTIONAL PROGRAMMING 150
TABLE OF CONTENTS XIII
/
6.4 FINAL COMMENTS 164
6.4.1 INDUCTIVE VERSUS DEDUCTIVE SYNTHESIS 164
6.4.2 INDUCTIVE FUNCTIONAL VERSUS LOGIC PROGRAMMING 165
7. FOLDING OF FINIT
E PROGRA
M TERMS
167
7.1 TERMINOLOGY AND BASIC CONCEPTS 168
7.1.1 TERMS AND TERM REWRITING 168
7.1.2 PATTERNS AND ANTI-UNIFICATION 171
7.1.3 RECURSIVE PROGRAM SCHEMES , 172
7.2 SYNTHESIS OF RPSS FROM INITIAL PROGRAMS 182
7.2.1 FOLDING AND FIXPOINT SEMANTICS 182
7.2.2 CHARACTERISTICS OF RPSS 182
7.2.3 THE SYNTHESIS PROBLEM 185
7.3 SOLVING THE SYNTHESIS PROBLEM 185
7.3.1 CONSTRUCTING SEGMENTATIONS 186
7.3.2 CONSTRUCTING A PROGRAM BODY 195
7.3.3 DEALING WITH FURTHER SUBPROGRAMS 198
7.3.4 FINDING PARAMETER SUBSTITUTIONS 206
7.3.5 CONSTRUCTING AN RPS 215
7.4 EXAMPLE PROBLEMS 220
7.4.1 TIME EFFORT OF FOLDING 220
7.4.2 RECURSIVE CONTROL RULES 222
8. TRANSFORMING PLAN
S INTO FINIT
E PROGRAM
S
227
8.1 OVERVIEW OF PLAN TRANSFORMATION 228
8.1.1 UNIVERSAL PLANS 228
8.1.2 INTRODUCING DATA TYPES AND SITUATION VARIABLES 228
8.1.3 COMPONENTS OF PLAN TRANSFORMATION 229
8.1.4 PLANS AS PROGRAMS 229
8.1.5 COMPLETENESS AND CORRECTNESS 231
8.2 TRANSFORMATION AND TYPE INFERENCE 231
8.2.1 PLAN DECOMPOSITION 231
8.2.2 DATA TYPE INFERENCE 233
8.2.3 INTRODUCING SITUATION VARIABLES 234
8.3 PLANS OVER SEQUENCES OF OBJECTS 235
8.4 PLANS OVER SETS OF OBJECTS 240
8.5 PLANS, OVER LISTS OF OBJECTS 246
8.5.1 STRUCTURAL AND SEMANTIC LIST PROBLEMS 246
8.5.2 SYNTHESIZING 'SELECTION-SORT' 248
8.5.3 CONCLUDING REMARKS ON LIST PROBLEMS 257
8.6 PLANS OVER COMPLEX DATA TYPES 259
8.6.1 VARIANTS OF COMPLEX FINITE PROGRAMS 259
8.6.2 THE 'TOWER' DOMAIN 260
8.6.3 TOWER OF HANOI 267
XIV TABLE OF CONTENTS
' I
9. CONCLUSION
S AND FURTHER RESEARCH
271
9.1 COMBINING PLANNING AND PROGRAM SYNTHESIS 271
9.2 ACQUISITION OF PROBLEM SOLVING STRATEGIES 272
9.2.1 LEARNING IN PROBLEM SOLVING AND PLANNING 272
9.2.2 THREE LEVELS OF LEARNING 273
PART III
. SCHEMA ABSTRACTIO
N
10. ANALOGICAL REASONIN
G AND GENERALIZATION
279
10.1 ANALOGICAL AND CASE-BASED REASONING 279
10.1.1 CHARACTERISTICS OF ANALOGY 279
10.1.2 SUB-PROCESSES OF ANALOGICAL REASONING 281
10.1.3 TRANSFORMATIONAL VERSUS DERIVATIONAL ANALOGY 282
10.1.4 QUANTITIVE AND QUALITATIVE SIMILARITY 283
10.2 MAPPING SIMPLE RELATIONS OR COMPLEX STRUCTURES 284
10.2.1 PROPORTIONAL ANALOGIES 284
10.2.2 CAUSAL ANALOGIES 286
10.2.3 PROBLEM SOLVING AND PLANNING BY ANALOGY 286
10.3 PROGRAMMING BY ANALOGY 288
10.4 POINTERS TO LITERATURE 290
11
. STRUCTURAL SIMILARITY IN ANALOGICAL TRANSFER
291
11.1 ANALOGICAL PROBLEM SOLVING 291
11.1.1 MAPPING AND TRANSFER 292
11.1.2 TRANSFER OF NON-ISOMORPHIC SOURCE PROBLEMS 293
11.1.3 STRUCTURAL REPRESENTATION OF PROBLEMS 294
11.1.4 NON-ISOMORPHIC VARIANTS IN A WATER REDISTRIBUTION
DOMAIN 296
11.1.5 MEASUREMENT OF STRUCTURAL OVERLAP 300
11.2 EXPERIMENT 1 300
11.2.1 METHOD 302
11.2.2 RESULTS AND DISCUSSION 303
11.3 EXPERIMENT 2 305
11.3.1 METHOD 306
11.3.2 RESULTS AND DISCUSSION 307
11.4 GENERAL DISCUSSION 309
12
. PROGRAMMIN
G BY ANALOG
Y
311
12.1 PROGRAM REUSE AND PROGRAM SCHEMES 311
12.2 RESTRICTED 2ND-ORDER ANTI-UNIFICATION ." 312
12.2.1 RECURSIVE PROGRAM SCHEMES REVISITED 312
12.2.2 ANTI-UNIFICATION OF PROGRAM TERMS 314
TABLE OF CONTENTS XV
/
12.3 RETRIEVAL USING TERM SUBSUMPTION 316
12.3.1 TERM SUBSUMPTION 316
12.3.2 EMPIRICAL EVALUATION 317
12.3.3 RETRIEVAL FROM HIERARCHICAL MEMORY 318
12.4 GENERALIZING PROGRAM SCHEMES 319
12.5 ADAPTATION OF PROGRAM SCHEMES 320
13. CONCLUSIONS AND FURTHER RESEARCH
323
13.1 LEARNING AND APPLYING ABSTRACT SCHEMES 323
13.2 A FRAMEWORK FOR LEARNING FROM PROBLEM SOLVING 324
13.3 APPLICATION PERSPECTIVE 325
BIBLIOGRAPHY
327
APPENDICES
A. IMPLEMENTATIO
N DETAIL
S
343
A.I SHORT HISTORY OF DPLAN 343
A.2 MODULES OF DPLAN 345
A.3 DPLAN SPECIFICATIONS 345
A.4 DEVELOPMENT OF FOLDING ALGORITHMS 347
A.5 MODULES OF TFOLD 348
A.6 TIME EFFORT OF FOLDING 349
A. 7 MAIN COMPONENTS OF PLAN-TRANSFORMATION 349
A.8 PLAN DECOMPOSITION 350
A.9 INTRODUCTION OF SITUATION VARIABLES 351
A.10 NUMBER OF MSTS IN A DAG 351
A. 11 EXTRACTING MINIMAL SPANNING TREES FROM A DAG 352
A.12 REGULARIZING A TREE 353
A. 13 PROGRAMMING BY ANALOGY ALGORITHMS 355
B. CONCEPT
S AND PROOFS
357
B.I FIXPOINT SEMANTICS 357
B.2 PROOF: MAXIMAL SUBPROGRAM BODY 360
B.3 PROOF: UNIQUENESS OF SUBSTITUTIONS 365
C. SAMPL
E PROGRAM
S AND PROBLEM
S
369
C.I FIBONACCI WITH SEQUENCE REFERENCING FUNCTION 369
C.2 INDUCING 'REVERSE' WITH GOLEM 370
C.3 FINITE PROGRAM FOR 'UNSTACK' 373
C.4 RECURSIVE CONTROL RULES FOR THE 'ROCKET' DOMAIN 375
C.5 THE 'SELECTION SORT' DOMAIN 376
C.6 RECURSIVE CONTROL RULES FOR THE 'TOWER' DOMAIN 377
XV
I TABL
E OF CONTENT
S
I.
C.7 WATER JUG PROBLEMS 383
C.8 EXAMPLE RPSS 388
INDE
X
391 |
| any_adam_object | 1 |
| author | Schmid, Ute |
| author_facet | Schmid, Ute |
| author_role | aut |
| author_sort | Schmid, Ute |
| author_variant | u s us |
| building | Verbundindex |
| bvnumber | BV017391752 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.6 |
| callnumber-search | QA76.6 |
| callnumber-sort | QA 276.6 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 704f |
| ctrlnum | (OCoLC)52728961 (DE-599)BVBBV017391752 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV017391752</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050609</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030805s2003 gw m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">967573157</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540401741</subfield><subfield code="9">3-540-40174-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)52728961</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017391752</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 704f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schmid, Ute</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Inductive synthesis of functional programs</subfield><subfield code="b">universal planning, folding of finite programs, and schema abstraction by analogical reasoning</subfield><subfield code="c">Ute Schmid</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 398 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2654 : Lecture notes in artificial intelligence</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Génie logiciel</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Génie logiciel</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intelligence artificielle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Intelligence artificielle</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Raisonnement analogique</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatische Programmierung</subfield><subfield code="0">(DE-588)4143702-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Induktion</subfield><subfield code="0">(DE-588)4026765-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmsynthese</subfield><subfield code="0">(DE-588)4295513-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatische Programmierung</subfield><subfield code="0">(DE-588)4143702-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Funktionale Programmierung</subfield><subfield code="0">(DE-588)4198740-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Programmsynthese</subfield><subfield code="0">(DE-588)4295513-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Induktion</subfield><subfield code="0">(DE-588)4026765-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">2654 : Lecture notes in artificial intelligence</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">2654</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010479331&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010479331</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV017391752 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:07:29Z |
| institution | BVB |
| isbn | 3540401741 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010479331 |
| oclc_num | 52728961 |
| open_access_boolean | |
| owner | DE-384 DE-91G DE-BY-TUM DE-29T DE-473 DE-BY-UBG DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-384 DE-91G DE-BY-TUM DE-29T DE-473 DE-BY-UBG DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | XXII, 398 S. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Schmid, Ute Verfasser aut Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning Ute Schmid Berlin [u.a.] Springer 2003 XXII, 398 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 2654 : Lecture notes in artificial intelligence Includes bibliographical references and index Génie logiciel Génie logiciel rasuqam Intelligence artificielle Intelligence artificielle rasuqam Programmation (Informatique) Programmation rasuqam Raisonnement analogique rasuqam Künstliche Intelligenz Artificial intelligence Computer programming Software engineering Automatische Programmierung (DE-588)4143702-0 gnd rswk-swf Induktion (DE-588)4026765-9 gnd rswk-swf Programmsynthese (DE-588)4295513-0 gnd rswk-swf Funktionale Programmierung (DE-588)4198740-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Automatische Programmierung (DE-588)4143702-0 s Funktionale Programmierung (DE-588)4198740-8 s Programmsynthese (DE-588)4295513-0 s Induktion (DE-588)4026765-9 s DE-604 Lecture notes in computer science 2654 : Lecture notes in artificial intelligence (DE-604)BV000000607 2654 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010479331&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Schmid, Ute Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning Lecture notes in computer science Génie logiciel Génie logiciel rasuqam Intelligence artificielle Intelligence artificielle rasuqam Programmation (Informatique) Programmation rasuqam Raisonnement analogique rasuqam Künstliche Intelligenz Artificial intelligence Computer programming Software engineering Automatische Programmierung (DE-588)4143702-0 gnd Induktion (DE-588)4026765-9 gnd Programmsynthese (DE-588)4295513-0 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| subject_GND | (DE-588)4143702-0 (DE-588)4026765-9 (DE-588)4295513-0 (DE-588)4198740-8 (DE-588)4113937-9 |
| title | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning |
| title_auth | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning |
| title_exact_search | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning |
| title_full | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning Ute Schmid |
| title_fullStr | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning Ute Schmid |
| title_full_unstemmed | Inductive synthesis of functional programs universal planning, folding of finite programs, and schema abstraction by analogical reasoning Ute Schmid |
| title_short | Inductive synthesis of functional programs |
| title_sort | inductive synthesis of functional programs universal planning folding of finite programs and schema abstraction by analogical reasoning |
| title_sub | universal planning, folding of finite programs, and schema abstraction by analogical reasoning |
| topic | Génie logiciel Génie logiciel rasuqam Intelligence artificielle Intelligence artificielle rasuqam Programmation (Informatique) Programmation rasuqam Raisonnement analogique rasuqam Künstliche Intelligenz Artificial intelligence Computer programming Software engineering Automatische Programmierung (DE-588)4143702-0 gnd Induktion (DE-588)4026765-9 gnd Programmsynthese (DE-588)4295513-0 gnd Funktionale Programmierung (DE-588)4198740-8 gnd |
| topic_facet | Génie logiciel Intelligence artificielle Programmation (Informatique) Programmation Raisonnement analogique Künstliche Intelligenz Artificial intelligence Computer programming Software engineering Automatische Programmierung Induktion Programmsynthese Funktionale Programmierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010479331&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT schmidute inductivesynthesisoffunctionalprogramsuniversalplanningfoldingoffiniteprogramsandschemaabstractionbyanalogicalreasoning |