Advanced programming in PROLOG for computational linguistics and artificial intelligence:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Muenchen
LINCOM Europa
2007
|
| Schriftenreihe: | LINCOM studies in computational linguistics
01 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | V, 238 S. graph. Darst. 25 cm |
| ISBN: | 9783895863592 3895863599 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV023042019 | ||
| 003 | DE-604 | ||
| 005 | 20080110 | ||
| 007 | t | ||
| 008 | 071210s2007 d||| |||| 00||| eng d | ||
| 015 | |a 07,N14,0086 |2 dnb | ||
| 015 | |a 07,A50,0055 |2 dnb | ||
| 016 | 7 | |a 983430160 |2 DE-101 | |
| 020 | |a 9783895863592 |c Pp. : EUR 98.00 (DE, freier Pr.), EUR 108.00 (AT, freier Pr.), sfr 157.00 (freier Pr.) |9 978-3-89586-359-2 | ||
| 020 | |a 3895863599 |c Pp. : EUR 98.00 (DE, freier Pr.), EUR 108.00 (AT, freier Pr.), sfr 157.00 (freier Pr.) |9 3-89586-359-9 | ||
| 024 | 3 | |a 9783895863592 | |
| 035 | |a (OCoLC)166213984 | ||
| 035 | |a (DE-599)DNB983430160 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-19 | ||
| 050 | 0 | |a QA76.73.P76 | |
| 082 | 0 | |a 005.1 |2 22/ger | |
| 082 | 1 | |a 005.1 |2 22//ger | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a DAT 366f |2 stub | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a DAT 710f |2 stub | ||
| 100 | 1 | |a Mompelat, Rodrigue Sabin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Advanced programming in PROLOG for computational linguistics and artificial intelligence |c Rodrigue Sabin Mompelat |
| 264 | 1 | |a Muenchen |b LINCOM Europa |c 2007 | |
| 300 | |a V, 238 S. |b graph. Darst. |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a LINCOM studies in computational linguistics |v 01 | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence |x Data processing | |
| 650 | 4 | |a Computational linguistics |x Data processing | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 650 | 0 | 7 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computerlinguistik |0 (DE-588)4035843-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |D s |
| 689 | 0 | 1 | |a Computerlinguistik |0 (DE-588)4035843-4 |D s |
| 689 | 0 | 2 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a LINCOM studies in computational linguistics |v 01 |w (DE-604)BV023042010 |9 1 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016245533&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016245533 | ||
Datensatz im Suchindex
| _version_ | 1804137270903570432 |
|---|---|
| adam_text | CONTENTS
I. Terms and Characters 2
1. Terms (I): Syntax 3
1.1 Simpleterms 3
1.2 Compound terms 4
2. Input and Output in Prolog 6
2.1 Input and Output in Prolog 6
2.2 Reading of terms 7
2.3 File manipulation (I): see / tell 8
2.4 Program : PROCESSJLIST 8
2.5 File manipulation (II): open / close 10
Exercise 2.1 12
Solution 13
2.6 Reading of characters 13
Exercise 2.2 14
2.7 Program : GETJSENTENCE 15
2.7.1 Strategy 15
2.7.2 Rules 15
2.7.3 Reading ftom files 18
2.7.4 Summary: How to combine characters into atoms ? .... 20
Exercises 2.3, 2.4,2.5, 2.6 22
3. Terms (II): Comparison of Terms 23
Exercises 3.1 27
4. Sorting 28
4.1 Sorting strategies 28
4.2 BUBBLESORT 29
4.2.1 Sorting strategy 29
4.2.2 The Program 30
4.2.3 Sorting with BUBBLESORT 30
4.3 INSERTION 32
4.3.1 Sorting strategy 32
4.3.2 The program 33
4.3.3 Sorting with INSERTION 34
4.4 QUICKSORT 35
4.4.1 Sorting strategy 35
4.4.2 The Program 35
4.4.3 Sorting with QUICKSORT 36
4.5SORTMERGE 38
4.5.1 Sorting strategy 38
4.4.2 The Program 39
4.4.3 Sorting with SORTMERGE 40
Exercises 4.1,4.2,4.3 42
4.6 Program : SORT_FILE 42
4.6.1 TheStrategy 42
ii
4.6.2 The Program 43
Exercise 4.4 46
II. Programs of Text Analysis 47
5. Terms (III): Control and Analysis of Terms 48
5.1 Control of terms 48
5.2 Analysis and Construction of terms 50
5.2.1 UNIV 50
5.2.1 functor/3 51
5.2.3 arg/3 52
5.2.4 Summary: constructing and decomposing terms 52
Exercises 5.1 53
6. Frequency Lists 54
6.1 Strategy 54
6.2 Program : FREQUENCY 55
6.2.1 Only one verbal occurrence 55
6.2.2 Frequency Calculation 56
6.2.3 Procedure : tokensfType) 57
6.3 Frequency lists by downward frequency 60
6.3.1 Find highest frequency 61
6.3.2 Writing out by downward frequency 62
6.3.3 Program : DOWNFREQUENCY 63
Exercises 6.1,6.2,6.3,6.4 64
7. Index 65
7.1 Strategy 65
7.2 Procedure trivial/3 68
7.3 Procedure index/3 69
7.4Procedure build list/2 70
7.5 Procedure indexout/2 71
7.6 The module build_index/ 3 72
Exercise 7.1 72
8. KWIC_index 73
8.1 WhatisaKWICJndex? 73
8.2 Strategy 74
8.3 Input 74
8.4 Reading with checklist/ 6 75
8.5 Where is the keyword : check_position / 2 76
8.6 Writing out: kwic_out / 5 77
Important Solved Exercise 8.1 79
III. Finite State Automata and Networks 85
9. Automata 86
9.1 What is a Finite State Automaton? 86
9.2 The structure of an automaton 86
9.3 FSA 1 87
9.4 Deterministic vs non deterministic automata 89
iii
Exercises 9.1,9.2 89
10. Networks 90
10.1 What is a network ? 90
10.2 Networks and automata 91
10.3 Specifying the arcs in a network 91
10.4 A formal representation of a network 95
10.5 Encoding NATR 96
10.6Itinerancies inaFSTN 97
10.6.1 TheStart 97
10.6.2 The End 98
10.6.3 The itinerancy 98
10.7 Jump arc 100
10.8 Using abbreviation symbols 101
10.9 Implementation of abbreviation symbols 101
Exercises 10.1,10.2 103
11. Automaton : WORD DIVIDER 104
11.1 Rules and Strategies for word division 104
11.2 The network module 106
11.3 The word division module 108
11.3.1 Procedure: hyphen/2 109
11.3.2Procedure:structure/2 110
11.3.3 Procedure :write_s/2 112
Exercises 11.1,11.2,11.3 113
12 Two track Automata 114
12.1 A Transducer 114
12.2 Automaton TRANSLATOR 114
12.3 The Transduction 115
12.4 The Implementation 116
12.4.1 The Net 116
12.4.2 The Dictionary 117
12.4.3 The itinerancy 117
12.4.4 Procedure mapping/5 118
12.4.5 jump arcs 119
12.4.6 The program 120
13. Automaton : TRANSMORF 122
13.1 Functioning and capacity 122
13.2 Morphological description 122
13.3 Strategy 124
13.4 Implementation 125
13.4.1 Dictionary 126
13.4.2 Reference in a dictionary 126
13.4.3 The Start and output 127
13.4.4 The Net 128
13.4.5 The Transduction 130
13.4.6 The itinerancy 130
13.4.7 The program 131
Exercises 13.1,13.2 134
Exercise 13.3 135
iv
IV. Databases 136
14. The DANLOG Sytem 137
14.1 DANTERM in Prolog 137
14.2 The architecture 137
14.3 Moduledesign 138
14.3 The main modules 140
14.4.1 Interface 140
14.4.2 Db generator 143
14.4.3 The Database 143
14.4.4 DataLex 145
15. Communication and Reliability 147
15.1 Interface : the main menu 147
15.1.1 Architecture 148
15.1.2 Performance and Code 148
15.2 The type modules 151
15.2.1 Strategy and Structure 151
15.2.2 Procedure: choose/2 152
15.2.3 Procedure: go/2 153
16. Operations in the Database 156
16.1 Searching 156
16.1.1 Procedure : show_attribute 156
16.1.2 Procedure : show relation 157
16.1.3 Procedure :show_table 158
16.2 Updating 160
16.2.1 Strategy 161
16.2.2 Procedure: change 161
16.2.3 Procedure : show_entry 162
16.2.4 Procedure: upgrade and store 163
16.2.5 Procedure : confirm 164
16.2.6 Procedure :save_table 166
Addendum 1: Proposals of solutions to Exercises 169
Addendum 2 : Programs 188
The DANLOG system 188
Printout ofan execution with DANLOG 204
KWICINDEX 211
LINEINDEX 215
WORDPART 217
PAGEINDEX 222
RUNINDEX 224
TOTALFREQUENCY 226
TRANSMORF 228
References 234
v
|
| adam_txt |
CONTENTS
I. Terms and Characters 2
1. Terms (I): Syntax 3
1.1 Simpleterms 3
1.2 Compound terms 4
2. Input and Output in Prolog 6
2.1 Input and Output in Prolog 6
2.2 Reading of terms 7
2.3 File manipulation (I): see / tell 8
2.4 Program : PROCESSJLIST 8
2.5 File manipulation (II): open / close 10
Exercise 2.1 12
Solution 13
2.6 Reading of characters 13
Exercise 2.2 14
2.7 Program : GETJSENTENCE 15
2.7.1 Strategy 15
2.7.2 Rules 15
2.7.3 Reading ftom files 18
2.7.4 Summary: How to combine characters into atoms ? . 20
Exercises 2.3, 2.4,2.5, 2.6 22
3. Terms (II): Comparison of Terms 23
Exercises 3.1 27
4. Sorting 28
4.1 Sorting strategies 28
4.2 BUBBLESORT 29
4.2.1 Sorting strategy 29
4.2.2 The Program 30
4.2.3 Sorting with BUBBLESORT 30
4.3 INSERTION 32
4.3.1 Sorting strategy 32
4.3.2 The program 33
4.3.3 Sorting with INSERTION 34
4.4 QUICKSORT 35
4.4.1 Sorting strategy 35
4.4.2 The Program 35
4.4.3 Sorting with QUICKSORT 36
4.5SORTMERGE 38
4.5.1 Sorting strategy 38
4.4.2 The Program 39
4.4.3 Sorting with SORTMERGE 40
Exercises 4.1,4.2,4.3 42
4.6 Program : SORT_FILE 42
4.6.1 TheStrategy 42
ii
4.6.2 The Program 43
Exercise 4.4 46
II. Programs of Text Analysis 47
5. Terms (III): Control and Analysis of Terms 48
5.1 Control of terms 48
5.2 Analysis and Construction of terms 50
5.2.1 UNIV 50
5.2.1 functor/3 51
5.2.3 arg/3 52
5.2.4 Summary: constructing and decomposing terms 52
Exercises 5.1 53
6. Frequency Lists 54
6.1 Strategy 54
6.2 Program : FREQUENCY 55
6.2.1 Only one verbal occurrence 55
6.2.2 Frequency Calculation 56
6.2.3 Procedure : tokensfType) 57
6.3 Frequency lists by downward frequency 60
6.3.1 Find highest frequency 61
6.3.2 Writing out by downward frequency 62
6.3.3 Program : DOWNFREQUENCY 63
Exercises 6.1,6.2,6.3,6.4 64
7. Index 65
7.1 Strategy 65
7.2 Procedure trivial/3 68
7.3 Procedure index/3 69
7.4Procedure build list/2 70
7.5 Procedure indexout/2 71
7.6 The module build_index/ 3 72
Exercise 7.1 72
8. KWIC_index 73
8.1 WhatisaKWICJndex? 73
8.2 Strategy 74
8.3 Input 74
8.4 Reading with checklist/ 6 75
8.5 Where is the keyword : check_position / 2 76
8.6 Writing out: kwic_out / 5 77
Important Solved Exercise 8.1 79
III. Finite State Automata and Networks 85
9. Automata 86
9.1 What is a Finite State Automaton? 86
9.2 The structure of an automaton 86
9.3 FSA 1 87
9.4 Deterministic vs non deterministic automata 89
iii
Exercises 9.1,9.2 89
10. Networks 90
10.1 What is a network ? 90
10.2 Networks and automata 91
10.3 Specifying the arcs in a network 91
10.4 A formal representation of a network 95
10.5 Encoding NATR 96
10.6Itinerancies inaFSTN 97
10.6.1 TheStart 97
10.6.2 The End 98
10.6.3 The itinerancy 98
10.7 Jump arc 100
10.8 Using abbreviation symbols 101
10.9 Implementation of abbreviation symbols 101
Exercises 10.1,10.2 103
11. Automaton : WORD DIVIDER 104
11.1 Rules and Strategies for word division 104
11.2 The network module 106
11.3 The word division module 108
11.3.1 Procedure: hyphen/2 109
11.3.2Procedure:structure/2 110
11.3.3 Procedure :write_s/2 112
Exercises 11.1,11.2,11.3 113
12 Two track Automata 114
12.1 A Transducer 114
12.2 Automaton TRANSLATOR 114
12.3 The Transduction 115
12.4 The Implementation 116
12.4.1 The Net 116
12.4.2 The Dictionary 117
12.4.3 The itinerancy 117
12.4.4 Procedure mapping/5 118
12.4.5 jump arcs 119
12.4.6 The program 120
13. Automaton : TRANSMORF 122
13.1 Functioning and capacity 122
13.2 Morphological description 122
13.3 Strategy 124
13.4 Implementation 125
13.4.1 Dictionary 126
13.4.2 Reference in a dictionary 126
13.4.3 The Start and output 127
13.4.4 The Net 128
13.4.5 The Transduction 130
13.4.6 The itinerancy 130
13.4.7 The program 131
Exercises 13.1,13.2 134
Exercise 13.3 135
iv
IV. Databases 136
14. The DANLOG Sytem 137
14.1 DANTERM in Prolog 137
14.2 The architecture 137
14.3 Moduledesign 138
14.3 The main modules 140
14.4.1 Interface 140
14.4.2 Db generator 143
14.4.3 The Database 143
14.4.4 DataLex 145
15. Communication and Reliability 147
15.1 Interface : the main menu 147
15.1.1 Architecture 148
15.1.2 Performance and Code 148
15.2 The type modules 151
15.2.1 Strategy and Structure 151
15.2.2 Procedure: choose/2 152
15.2.3 Procedure: go/2 153
16. Operations in the Database 156
16.1 Searching 156
16.1.1 Procedure : show_attribute 156
16.1.2 Procedure : show relation 157
16.1.3 Procedure :show_table 158
16.2 Updating 160
16.2.1 Strategy 161
16.2.2 Procedure: change 161
16.2.3 Procedure : show_entry 162
16.2.4 Procedure: upgrade and store 163
16.2.5 Procedure : confirm 164
16.2.6 Procedure :save_table 166
Addendum 1: Proposals of solutions to Exercises 169
Addendum 2 : Programs 188
The DANLOG system 188
Printout ofan execution with DANLOG 204
KWICINDEX 211
LINEINDEX 215
WORDPART 217
PAGEINDEX 222
RUNINDEX 224
TOTALFREQUENCY 226
TRANSMORF 228
References 234
v |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Mompelat, Rodrigue Sabin |
| author_facet | Mompelat, Rodrigue Sabin |
| author_role | aut |
| author_sort | Mompelat, Rodrigue Sabin |
| author_variant | r s m rs rsm |
| building | Verbundindex |
| bvnumber | BV023042019 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.P76 |
| callnumber-search | QA76.73.P76 |
| callnumber-sort | QA 276.73 P76 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 250 |
| classification_tum | DAT 366f DAT 710f |
| ctrlnum | (OCoLC)166213984 (DE-599)DNB983430160 |
| 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 |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02437nam a2200577 cb4500</leader><controlfield tag="001">BV023042019</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080110 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071210s2007 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,N14,0086</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">07,A50,0055</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">983430160</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783895863592</subfield><subfield code="c">Pp. : EUR 98.00 (DE, freier Pr.), EUR 108.00 (AT, freier Pr.), sfr 157.00 (freier Pr.)</subfield><subfield code="9">978-3-89586-359-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3895863599</subfield><subfield code="c">Pp. : EUR 98.00 (DE, freier Pr.), EUR 108.00 (AT, freier Pr.), sfr 157.00 (freier Pr.)</subfield><subfield code="9">3-89586-359-9</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783895863592</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)166213984</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB983430160</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.73.P76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="1" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22//ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 366f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 710f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Mompelat, Rodrigue Sabin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Advanced programming in PROLOG for computational linguistics and artificial intelligence</subfield><subfield code="c">Rodrigue Sabin Mompelat</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Muenchen</subfield><subfield code="b">LINCOM Europa</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">V, 238 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">25 cm</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">LINCOM studies in computational linguistics</subfield><subfield code="v">01</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</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><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational linguistics</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">PROLOG</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4047464-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Computerlinguistik</subfield><subfield code="0">(DE-588)4035843-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</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">LINCOM studies in computational linguistics</subfield><subfield code="v">01</subfield><subfield code="w">(DE-604)BV023042010</subfield><subfield code="9">1</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=016245533&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016245533</subfield></datafield></record></collection> |
| id | DE-604.BV023042019 |
| illustrated | Illustrated |
| index_date | 2024-07-02T19:20:57Z |
| indexdate | 2024-07-09T21:09:38Z |
| institution | BVB |
| isbn | 9783895863592 3895863599 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016245533 |
| oclc_num | 166213984 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-19 DE-BY-UBM |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-19 DE-BY-UBM |
| physical | V, 238 S. graph. Darst. 25 cm |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | LINCOM Europa |
| record_format | marc |
| series | LINCOM studies in computational linguistics |
| series2 | LINCOM studies in computational linguistics |
| spelling | Mompelat, Rodrigue Sabin Verfasser aut Advanced programming in PROLOG for computational linguistics and artificial intelligence Rodrigue Sabin Mompelat Muenchen LINCOM Europa 2007 V, 238 S. graph. Darst. 25 cm txt rdacontent n rdamedia nc rdacarrier LINCOM studies in computational linguistics 01 Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing Computational linguistics Data processing Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd rswk-swf Computerlinguistik (DE-588)4035843-4 gnd rswk-swf Künstliche Intelligenz (DE-588)4033447-8 gnd rswk-swf PROLOG Programmiersprache (DE-588)4047464-1 s Computerlinguistik (DE-588)4035843-4 s Künstliche Intelligenz (DE-588)4033447-8 s DE-604 LINCOM studies in computational linguistics 01 (DE-604)BV023042010 1 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016245533&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Mompelat, Rodrigue Sabin Advanced programming in PROLOG for computational linguistics and artificial intelligence LINCOM studies in computational linguistics Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing Computational linguistics Data processing Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
| subject_GND | (DE-588)4047464-1 (DE-588)4035843-4 (DE-588)4033447-8 |
| title | Advanced programming in PROLOG for computational linguistics and artificial intelligence |
| title_auth | Advanced programming in PROLOG for computational linguistics and artificial intelligence |
| title_exact_search | Advanced programming in PROLOG for computational linguistics and artificial intelligence |
| title_exact_search_txtP | Advanced programming in PROLOG for computational linguistics and artificial intelligence |
| title_full | Advanced programming in PROLOG for computational linguistics and artificial intelligence Rodrigue Sabin Mompelat |
| title_fullStr | Advanced programming in PROLOG for computational linguistics and artificial intelligence Rodrigue Sabin Mompelat |
| title_full_unstemmed | Advanced programming in PROLOG for computational linguistics and artificial intelligence Rodrigue Sabin Mompelat |
| title_short | Advanced programming in PROLOG for computational linguistics and artificial intelligence |
| title_sort | advanced programming in prolog for computational linguistics and artificial intelligence |
| topic | Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing Computational linguistics Data processing Prolog (Computer program language) PROLOG Programmiersprache (DE-588)4047464-1 gnd Computerlinguistik (DE-588)4035843-4 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
| topic_facet | Datenverarbeitung Künstliche Intelligenz Artificial intelligence Data processing Computational linguistics Data processing Prolog (Computer program language) PROLOG Programmiersprache Computerlinguistik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016245533&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV023042010 |
| work_keys_str_mv | AT mompelatrodriguesabin advancedprogramminginprologforcomputationallinguisticsandartificialintelligence |