The logic programming paradigm: a 25 year perspective
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1999
|
| Schriftenreihe: | Artificial intelligence
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVI, 456 S. graph. Darst. |
| ISBN: | 3540654631 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012457785 | ||
| 003 | DE-604 | ||
| 005 | 20170717 | ||
| 007 | t | ||
| 008 | 990309s1999 gw d||| |||| 00||| eng d | ||
| 020 | |a 3540654631 |c Pp. : DM 98.00 |9 3-540-65463-1 | ||
| 035 | |a (OCoLC)40813396 | ||
| 035 | |a (DE-599)BVBBV012457785 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-739 |a DE-824 |a DE-473 |a DE-384 |a DE-526 |a DE-634 |a DE-83 |a DE-91G | ||
| 050 | 0 | |a QA76.63 | |
| 082 | 0 | |a 005.1/15 |2 21 | |
| 084 | |a ST 230 |0 (DE-625)143617: |2 rvk | ||
| 084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a DAT 706f |2 stub | ||
| 245 | 1 | 0 | |a The logic programming paradigm |b a 25 year perspective |c K. R. Apt ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1999 | |
| 300 | |a XVI, 456 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Artificial intelligence | |
| 650 | 7 | |a Kennisrepresentatie |2 gtt | |
| 650 | 7 | |a Logisch programmeren |2 gtt | |
| 650 | 4 | |a Programmation logique | |
| 650 | 7 | |a Programmation logique |2 ram | |
| 650 | 7 | |a analyse programme |2 inriac | |
| 650 | 7 | |a apprentissage machine |2 inriac | |
| 650 | 7 | |a programmation avec contrainte |2 inriac | |
| 650 | 7 | |a programmation déclarative |2 inriac | |
| 650 | 7 | |a programmation en logique |2 inriac | |
| 650 | 7 | |a programme concurrent |2 inriac | |
| 650 | 7 | |a traitement langage naturel |2 inriac | |
| 650 | 4 | |a Logic programming | |
| 650 | 0 | 7 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehragentensystem |0 (DE-588)4389058-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Logische Programmierung |0 (DE-588)4195096-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Nebenläufigkeit |0 (DE-588)4115352-2 |D s |
| 689 | 2 | 1 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Mehragentensystem |0 (DE-588)4389058-1 |D s |
| 689 | 3 | 1 | |a Logische Programmierung |0 (DE-588)4195096-3 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Apt, Krzysztof R. |d 1949- |e Sonstige |0 (DE-588)110139763 |4 oth | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008453926&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008453926 | ||
Datensatz im Suchindex
| _version_ | 1804127096561205248 |
|---|---|
| adam_text | K.R.APT VW.MAREK M. TRUSZCZYNSKI D. S. WARREN (EDS.) THE LOGIC
PROGRAMMING PARADIGM A 25-YEAR PERSPECTIVE WITH 57 FIGURES SPRINGER
CONTENTS PART I. COMPUTING AND PROGRAMMING 1 CONCURRENT AND AGENT
PROGRAMMING 3 LOGIC PROGRAMMING AND MULTI-AGENT SYSTEMS: A SYNERGIC
COMBINATION FOR APPLICATIONS AND SEMANTICS 5 MARCO BOZZANO, GIORGIO
DELZANNO, MAURIZIO MARTELLI, VIVIANA MASCARDI, FLORIANO ZINI 1
INTRODUCTION 5 2 WHY AND WHICH LP LANGUAGES FOR MAS DEVELOPMENT? 6 3 A
GENERAL MULTI-AGENT SYSTEM ARCHITECTURE 10 4 A MULTI-AGENT SYSTEM
SPECIFICATION LANGUAGE , 15 5 TOWARDS A SPECIFICATION METHODOLOGY 19 6
CONCLUSIONS AND FUTURE WORK 27 INFERENCE AND COMPUTATION MOBILITY WITH
JINNI 33 PAUL TARAU 1 INTRODUCTION 33 2 THE WORLD OF JINNI 34 3 JINNI AS
A LOGIC PROGRAMMING JAVA COMPONENT 34 4 BASIC AGENT PROGRAMMING WITH
JINNI 35 5 WHAT S NEW IN JINNI 37 6 JINNI S LOGICAL ENGINE 44 7 A
META-CIRCULAR INTERPRETER FOR JINNI 46 8 MUTUAL AGENT/HOST SECURITY: THE
BRING YOUR OWN WINE PRINCIPLE 47 9 APPLICATION DOMAINS . 48 10
CONCLUSION 48 CONCURRENT LOGIC/CONSTRAINT PROGRAMMING: THE NEXT 10 YEARS
53 KAZUNORI UEDA 1 GRAND CHALLENGES 53 2 TWO APPROACHES TO ADDRESSING
NOVEL APPLICATIONS 56 XII CONTENTS 3 LOGIC PROGRAMMING VS. CONCURRENT
LOGIC PROGRAMMING 57 4 AN APPLICATION DOMAIN: PARALLEL/NETWORK
PROGRAMMING 59 5 EXPERIENCES WITH GUARDED HORN CLAUSES AND KL1 61 6 SOME
FAILURES AND PROBLEMS 65 7 CONCLUSIONS 67 2 PROGRAM ANALYSIS AND
METHODOLOGY 73 FORMULAS AS PROGRAMS 75 KRZYSZTOF R. APT, MARC BEZEM 1
INTRODUCTION 75 2 COMPUTATION MECHANISM 79 3 SOUNDNESS AND COMPLETENESS
85 4 EXTENSIONS 86 5 RELATION TO OTHER. APPROACHES 90 6 ALMA-0 95 7
EXAMPLE: PARTITIONING A RECTANGLE INTO SQUARES 96 8 CURRENT AND FUTURE
WORK 99 9 APPENDIX 102 LINK-TIME OPTIMIZATION OF MULTI-LANGUAGE PROGRAMS
109 SAUMYA DEBRAY 1 INTRODUCTION 109 2 CHALLENGES IN LINK TIME
OPTIMIZATION 112 3 SYSTEM ORGANIZATION 113 4 PROGRAM OPTIMIZATION 114 5
PERFORMANCE RESULTS 119 6 DISCUSSION 123 7 CONCLUSIONS 124 HORN LOGIC
DENOTATIONS AND THEIR APPLICATIONS 127 GOPAL GUPTA 1 INTRODUCTION 127 2
LOGICAL DENOTATIONS 129 3 PROVABLY CORRECT COMPILATION 137 4 PROGRAM
DENOTATION AND VERIFICATION 140 5 SPECIFICATION, IMPLEMENTATION AND
VERIFICATION OF DSL PROGRAMS ... 146 6 SEMANTIC PORTING 151 7 OTHER
APPLICATIONS 153 8 RELATED WORK 155 9 CONCLUSIONS 156 CONTENTS XIII
GLOBAL ANALYSIS, PARTIAL SPECIFICATIONS, AND ASSERTIONS 161 MANUEL
HERMENEGILDO, GERMAN PUEBLA, FRANCISCO BUENO 1 INTRODUCTION 161 2
OVERALL FRAMEWORK ARCHITECTURE AND OPERATION 163 3 THE ASSERTION
LANGUAGE 167 4 DEFINING PROPERTIES 170 5 A SIMPLE RUN-TIME CHECKING
SCHEME 174 6 COMPILE-TIME CHECKING 175 7 A SAMPLE DEBUGGING SESSION WITH
THE CIAO SYSTEM 178 8 SOME PRACTICAL HINTS ON DEBUGGING WITH ASSERTIONS
183 9 A PRELIMINARY EXPERIMENTAL EVALUATION 185 10 DISCUSSION 186 A CODE
FOR RUN-TIME CHECKING 190 3 FUTURE OF DECLARATIVE PROGRAMMING 193
ASSESSMENT OF SOME ISSUES IN CL-THEORY AND PROGRAM DEVELOPMENT 195 DANNY
DE SCHREYE AND MARC DENECKER 1 INTRODUCTION: ON ASSESSMENT 195 2
IMPLEMENTATION, ANALYSIS AND TRANSFORMATION 197 3 ALGORITHM = LOGIC +
CONTROL REVISITED 200 4 CONCLUSIONS: FUTURE DIRECTIONS 204 HOW
ENTERPRISES USE FUNCTIONAL LANGUAGES, AND WHY THEY DON T 209 PHILIP
WADLER 1 AN ANGRY HALF DOZEN 209 2 WHY NO ONE USES FUNCTIONAL LANGUAGES
217 3 FUNCTIONAL AND LOGIC PROGRAMMING 224 4 CONTINUOUS MATHEMATICS 229
CONTINUOUS MODELS OF COMPUTATION FOR LOGIC PROGRAMS 231 HOWARD A. BLAIR,
FRED DUSHIN, DAVID W. JAKEL, ANGEL J. RIVERA, METIN SEZGIN 1 ORIENTATION
231 2 THE CONTENTION AND A CAUTION 233 3 LONG-TERM EXPECTATIONS 235 4
RELATIONSHIP TO PRIOR WORK 239 5 CONTINUALIZING PROPOSITIONAL
CONNECTIVES 241 6 A CONTINUOUS-TIME EXAMPLE 244 7 A FUNDAMENTAL
DISCRETE-TIME SYSTEM 248 8 EMERGENT PHENOMENA FROM TUNING 250 XIV
CONTENTS THE LOGIC PROGRAMMING PARADIGM IN NUMERICAL COMPUTATION 257
MAARTEN H. VAN EMDEN 1 INTRODUCTION 257 2 NUMERICAL PROGRAMS NEED
VERIFICATION 260 3 FROM PROLOG TO CLP(R) 263 4 SOUND CLP(R) 266 5
PROVING ND/ID FORMULAS 267 6 RELATED WORK 272 7 CONCLUSIONS 273 PART II.
KNOWLEDGE REPRESENTATION AND MODELING 5 CONSTRAINTS 279 COMPUTATIONAL
MOLECULAR BIOLOGY: A PROMISING APPLICATION USING LP AND ITS EXTENSIONS
281 JACQUES COHEN 1 INTRODUCTION 281 2 A MINIMALIST INTRODUCTION TO DNA
AND PROTEIN GENERATION 282 3 TOP-DOWN DESCRIPTION OF PROTEIN GENERATION
FROM DNA 285 4 GRAMMARS DEFINING DNA COMPONENTS 287 5 MOTIVATION FOR
INTRODUCING DAGS 289 6 OBTAINING DAGS FROM NDFSA 293 7 CHROMATIC NDFSA
AND DAGS 294 8 INTRODUCING CRITERIA 294 9 ALTERNATION OF INTRONS AND
EXONS USING NDFSA 296 10 RELATED APPROACHES 298 11 OTHER PROBLEMS IN
COMPUTATIONAL MOLECULAR BIOLOGY 301 12 AREAS IN CS THAT ARE APPLICABLE
IN MOLECULAR BIOLOGY 304 13 SOME COMMENTS ABOUT DNA COMPUTING 304 14
FINAL REMARKS 306 ADDING CONSTRAINTS TO LOGIC-BASED FORMALISMS 313
MICHAEL J. MAHER 1 INTRODUCTION 313 2 LOGIC FORMALISMS 314 3 CONSTRAINTS
315 4 ADDING CONSTRAINTS TO LOGIC FORMALISMS 318 5 CONSTRAINTS IN LOGIC
FORMALISMS 320 6 CONCLUSION 327 CONTENTS XV 6 MACHINE LEARNING 333 A
PERSPECTIVE ON INDUCTIVE LOGIC PROGRAMMING 335 LUC DE RAEDT 1
INTRODUCTION 335 2 INDUCTIVE LOGIC PROGRAMMING 335 3 THE METHODOLOGY OF
INDUCTIVE LOGIC PROGRAMMING 337 4 THE RELATION BETWEEN INDUCTIVE LOGIC
PROGRAMMING AND LOGIC PROGRAMMING 340 5 RESEARCH DIRECTIONS FOR
INDUCTIVE LOGIC PROGRAMMING 343 FROM DEDUCTION TO INDUCTION: LOGICAL
PERSPECTIVE 347 KOICHI FURUKAWA 1 INTRODUCTION 347 2 INVERSE ENTAILMENT
348 3 SUBSUMPTION AND ENTAILMENT 350 4 COMPLETION OF THE ALGORITHM 351 5
ABDUCTIVE INFERENCE IN ILP 352 6 CONCLUSION AND FUTURE RESEARCH
DIRECTIONS 353 7 ANSWER SET PROGRAMMING 355 ACTION LANGUAGES, ANSWER
SETS, AND PLANNING 357 VLADIMIR LIFSCHITZ 1 INTRODUCTION 357 2
INCOMPLETE INFORMATION 359 3 ACTION LANGUAGE A 360 4 ANSWER SETS AND
HISTORIES 361 5 COMPUTING ANSWER SETS 362 6 CAUSAL REASONING 363 7
ACTION LANGUAGE C 364 8 FROM C TO LOGIC PROGRAMMING 367 9 PLANNING FOR
DOMAINS DESCRIBED IN C 369 10 TOPICS FOR FUTURE WORK 370 11 CONCLUSION
371 STABLE MODELS AND AN ALTERNATIVE LOGIC PROGRAMMING PARADIGM 375
VICTOR W. MAREK, MIROSLAW TRUSZCZYNSKI 1 INTRODUCTION 375 2 HORN LOGIC
PROGRAMMING 378 3 NEGATION IN LOGIC PROGRAMMING 380 4 STABLE LOGIC
PROGRAMMING 382 5 EXPRESSIVE POWER OF SLP 384 6 RECURSION VERSUS
CONSTRAINTS 386 XVI CONTENTS 7 UNIFORM CONTROL IN SLP 392 8 CONCLUSIONS
AND FUTURE DIRECTIONS 394 8 DATABASE SYSTEMS 399 LOGIC-BASED
USER-DEFINED AGGREGATES FOR THE NEXT GENERATION OF DATABASE SYSTEMS 401
CARLO ZANIOLO, HAIXUN WANG 1 INTRODUCTION 401 2 NEW APPLICATIONS REQUIRE
NEW AGGREGATES 402 3 USER-DEFINED AGGREGATES: THE STATE OF THE ART 406 4
AGGREGATES WITH EARLY RETURNS 409 5 FORMAL SEMANTICS 411 6 MONOTONIC
AGGREGATION 413 7 IMPLEMENTATION OF EXTENDED AGGREGATES 416 8
APPLICATIONS OF MONOTONE AGGREGATION 417 9 APPLICATIONS TO SQL DATABASES
421 10 CONCLUSIONS 424 9 NATURAL LANGUAGE PROCESSING 427 THE LOGIC OF
LANGUAGE 429 VERONICA DAHL 1 INTRODUCTION 429 2 SOME BASIC PROBLEMS IN
NATURAL LANGUAGE PROCESSING 431 3 THE OMNIPRESENCE OF LOGIC IN LANGUAGE
432 4 LINGUISTICALLY PRINCIPLED APPROACHES TO NATURAL LANGUAGE
PROCESSING 432 5 A COMPUTATIONAL LINGUIST S WISHLIST FOR PROLOG 437 6
WHAT FASHION OF THE DAY ARE WE LOSING TO? 439 7 HOW CAN LOGIC
PROGRAMMING BENEFIT FROM REGAINING THE MARKET? 440 8 ASSUMPTIVE LOGIC
PROGRAMMING AND GRAMMARS 441 9 CONTROLLING VIRTUAL WORLDS AND ROBOTS
THROUGH NATURAL LANGUAGE 442 10 CONCEPT BASED RETRIEVAL THROUGH NATURAL
LANGUAGE 444 11 DATABASE INITIALIZATION FROM NATURAL LANGUAGE 445 12
CONCLUSION 451
|
| any_adam_object | 1 |
| author_GND | (DE-588)110139763 |
| building | Verbundindex |
| bvnumber | BV012457785 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.63 |
| callnumber-search | QA76.63 |
| callnumber-sort | QA 276.63 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 230 ST 240 ST 300 |
| classification_tum | DAT 706f |
| ctrlnum | (OCoLC)40813396 (DE-599)BVBBV012457785 |
| dewey-full | 005.1/15 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1/15 |
| dewey-search | 005.1/15 |
| dewey-sort | 15.1 215 |
| 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>02735nam a2200685 c 4500</leader><controlfield tag="001">BV012457785</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170717 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">990309s1999 gw d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540654631</subfield><subfield code="c">Pp. : DM 98.00</subfield><subfield code="9">3-540-65463-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)40813396</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012457785</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.63</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1/15</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 230</subfield><subfield code="0">(DE-625)143617:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The logic programming paradigm</subfield><subfield code="b">a 25 year perspective</subfield><subfield code="c">K. R. Apt ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 456 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kennisrepresentatie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Logisch programmeren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation logique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation logique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse programme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">apprentissage machine</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation avec contrainte</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation déclarative</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation en logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programme concurrent</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">traitement langage naturel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Nebenläufigkeit</subfield><subfield code="0">(DE-588)4115352-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Logische Programmierung</subfield><subfield code="0">(DE-588)4195096-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</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=008453926&sequence=000001&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-008453926</subfield></datafield></record></collection> |
| genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
| genre_facet | Aufsatzsammlung |
| id | DE-604.BV012457785 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:27:55Z |
| institution | BVB |
| isbn | 3540654631 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008453926 |
| oclc_num | 40813396 |
| open_access_boolean | |
| owner | DE-29T DE-739 DE-824 DE-473 DE-BY-UBG DE-384 DE-526 DE-634 DE-83 DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-739 DE-824 DE-473 DE-BY-UBG DE-384 DE-526 DE-634 DE-83 DE-91G DE-BY-TUM |
| physical | XVI, 456 S. graph. Darst. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Springer |
| record_format | marc |
| series2 | Artificial intelligence |
| spelling | The logic programming paradigm a 25 year perspective K. R. Apt ... (eds.) Berlin [u.a.] Springer 1999 XVI, 456 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Artificial intelligence Kennisrepresentatie gtt Logisch programmeren gtt Programmation logique Programmation logique ram analyse programme inriac apprentissage machine inriac programmation avec contrainte inriac programmation déclarative inriac programmation en logique inriac programme concurrent inriac traitement langage naturel inriac Logic programming Nebenläufigkeit (DE-588)4115352-2 gnd rswk-swf Mehragentensystem (DE-588)4389058-1 gnd rswk-swf Constraint-logische Programmierung (DE-588)4382849-8 gnd rswk-swf Logische Programmierung (DE-588)4195096-3 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Logische Programmierung (DE-588)4195096-3 s DE-604 Constraint-logische Programmierung (DE-588)4382849-8 s Nebenläufigkeit (DE-588)4115352-2 s Mehragentensystem (DE-588)4389058-1 s Apt, Krzysztof R. 1949- Sonstige (DE-588)110139763 oth HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008453926&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | The logic programming paradigm a 25 year perspective Kennisrepresentatie gtt Logisch programmeren gtt Programmation logique Programmation logique ram analyse programme inriac apprentissage machine inriac programmation avec contrainte inriac programmation déclarative inriac programmation en logique inriac programme concurrent inriac traitement langage naturel inriac Logic programming Nebenläufigkeit (DE-588)4115352-2 gnd Mehragentensystem (DE-588)4389058-1 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd Logische Programmierung (DE-588)4195096-3 gnd |
| subject_GND | (DE-588)4115352-2 (DE-588)4389058-1 (DE-588)4382849-8 (DE-588)4195096-3 (DE-588)4143413-4 |
| title | The logic programming paradigm a 25 year perspective |
| title_auth | The logic programming paradigm a 25 year perspective |
| title_exact_search | The logic programming paradigm a 25 year perspective |
| title_full | The logic programming paradigm a 25 year perspective K. R. Apt ... (eds.) |
| title_fullStr | The logic programming paradigm a 25 year perspective K. R. Apt ... (eds.) |
| title_full_unstemmed | The logic programming paradigm a 25 year perspective K. R. Apt ... (eds.) |
| title_short | The logic programming paradigm |
| title_sort | the logic programming paradigm a 25 year perspective |
| title_sub | a 25 year perspective |
| topic | Kennisrepresentatie gtt Logisch programmeren gtt Programmation logique Programmation logique ram analyse programme inriac apprentissage machine inriac programmation avec contrainte inriac programmation déclarative inriac programmation en logique inriac programme concurrent inriac traitement langage naturel inriac Logic programming Nebenläufigkeit (DE-588)4115352-2 gnd Mehragentensystem (DE-588)4389058-1 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd Logische Programmierung (DE-588)4195096-3 gnd |
| topic_facet | Kennisrepresentatie Logisch programmeren Programmation logique analyse programme apprentissage machine programmation avec contrainte programmation déclarative programmation en logique programme concurrent traitement langage naturel Logic programming Nebenläufigkeit Mehragentensystem Constraint-logische Programmierung Logische Programmierung Aufsatzsammlung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008453926&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT aptkrzysztofr thelogicprogrammingparadigma25yearperspective |