Adding bottom-up evaluation to Prolog:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
1996
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | München, Techn. Univ., Diss., 1996 |
| Beschreibung: | 169 S. Ill., graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011233766 | ||
| 003 | DE-604 | ||
| 005 | 19970714 | ||
| 007 | t | ||
| 008 | 970306s1996 gw ad|| m||| 00||| engod | ||
| 016 | 7 | |a 949868329 |2 DE-101 | |
| 035 | |a (OCoLC)645851219 | ||
| 035 | |a (DE-599)BVBBV011233766 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91 |a DE-91G |a DE-12 | ||
| 084 | |a DAT 366d |2 stub | ||
| 084 | |a DAT 706d |2 stub | ||
| 100 | 1 | |a Wunderwald, Jens E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Adding bottom-up evaluation to Prolog |c Jens E. Wunderwald |
| 264 | 1 | |c 1996 | |
| 300 | |a 169 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a München, Techn. Univ., Diss., 1996 | ||
| 650 | 0 | 7 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bottom-up-Prinzip |0 (DE-588)4243684-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Bottom-up-Prinzip |0 (DE-588)4243684-9 |D s |
| 689 | 0 | 1 | |a PROLOG |g Programmiersprache |0 (DE-588)4047464-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 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=007538699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007538699 | |
Datensatz im Suchindex
| _version_ | 1812453348594417664 |
|---|---|
| adam_text |
CONTENTS
H
4W B
N
1 INTRODUCTION 1
1.1 OVERVIEW OF THE THESIS. 3
1.2 NOTATIONAL CONVENTIONS. 4
2 MIXING EVALUATION DIRECTIONS 5
2.1 BOTTOM-UP VERSUS TOP-DOWN. 5
2.1.1 TOP-DOWN EVALUATION. 6
2.1.2 BOTTOM-UP EVALUATION. 8
2.1.3 COMBINING THE TWO EVALUATION STYLES . 11
2.2 DESIGN OF COMBINING. 12
2.2.1 TOP-DOWN AND BOTTOM-UP RULES. 12
2.2.2 INTERACTION. 14
2.2.3 SIMPLE SYNTACTIC EXTENSIONS. 16
3 PROPAGATION 17
3.1 FROM SEMI-NAIVE TO MP. 17
3.1.1 SEMI-NAIVE ALGORITHM. 17
3.1.2 PARTITIONING DELTA SETS. 18
3.1.3 RECURSION REPLACES THE LOOP. 19
3.1.4 IMMEDIATE PROPAGATION. 20
3.1.5 EARLY UPDATE. 20
3.1.6 PROPAGATE TUPLES. 21
3.1.7 ELEMENT TEST. 22
3.1.8 ENUMERATE SUBSTITUTIONS. 22
3.2 COMPILING THE INTERPRETER AWAY. 24
3.2.1 PRECOMPILING PROPAGATION ENTRY POINTS. 24
3.2.2 RELATION-SPECIFIC PROCEDURES. 25
3.2.3 UPDATE PROCEDURES. 25
3.3 PROLOG IMPLEMENTATION. 28
3.3.1 WHY PROLOG ?. 28
3.3.2 INTERPRETER. 29
3.3.3 COMPILER. 31
3.4 BOTTOM-UP-TOP-DOWN-INTERACTION. 35
I
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/949868329
II
CONTENTS
3.4.1 BUILT-IN (PROLOG) SUBGOALS. 35
3.4.2 OTHER SYNTACTIC ELEMENTS. 36
3.4.3 THE FINAL TRANSFORMATION. 37
3.5 ALTERNATIVE DESIGN DECISIONS. 37
3.5.1 LAZY EVALUATION. 39
3.5.2 AVOIDING NON-DECLARATIVE CONSTRUCTS. 40
3.5.3 PARALLELISM. 42
4 CORRECTNESS AND COMPLETENESS 43
4.1 BASIC NOTIONS. 43
4.2 CORRECTNESS. 47
4.3 TERMINATION. 48
4.4 COMPLETENESS. 49
5 MATERIALIZATION 51
5.1 MATERIALIZATION INTERFACE . . ;.
-T. 51
5.2 CRITERIA FOR MATERIALIZATION TECHNIQUES. 51
5.2.1 ACCESS FREQUENCIES. 51
5.2.2 FUNCTIONAL DEPENDENCIES AND ENUMERATION. 52
5.2.3 STORAGE EFFICIENCY. 52
5.2.4 ORDER PRESERVATION. 52
5.2.5 LOGICAL UPDATE VIEW. 53
5.2.6 COLLECTING A RELATION IN A STRUCTURE. 53
5.2.7 NON-GROUND TUPLES. 53
5.2.8 RETRIEVAL BINDING PATTERNS. 54
5.3 COUPLING WITH RELATIONAL DATABASES. 54
5.4 MATERIALIZATION IN LOGIC PROGRAMMING. 55
6 OPTIMIZATIONS 57
6.1 OMITTING SUPERFLUOUS EVALUATION STEPS. 57
6.1.1 OMITTING THE DUPLICATE TEST. 57
6.1.2 NON-MATERIALIZED BOTTOM-UP RELATIONS. 60
6.1.3 OMITTING PROPAGATIONS. 61
6.2 DEDUCTIVE DATABASES OPTIMIZATIONS. 63
6.2.1 FACTORING. 63
6.2.2 EXISTENTIAL OPTIMIZATION. 63
6.3 JOIN OPTIMIZATION. 64
6.3.1 AUXILIARY RELATIONS. 64
6.3.2 REORDERING SUBGOALS (GENERAL SIPS). 64
6.4 PARTIAL MATERIALIZATION. 66
CONTENTS
UI
7 EXTENSIONS
7.1 NEGATION.
7.1.1 IMPLEMENTATION: NEGATION AS FAILURE .
7.1.2 ENFORCING STRATIFIED EVALUATION .
7.2 PUSHING ORDER THROUGH RECURSION.
7.3 PUSHING EQUIVALENCE THROUGH RECURSION .
7.4 AGGREGATES.
7.4.1 USING PROLOG'S ALL-SOLUTION PREDICATES
7.4.2 ACCUMULATOR BOTTOM-UP RELATIONS . .
7.4.3 ORDER RELATIONS FOR AGGREGATE SELECTION
7.5 CUTS.
69
69
69
70
71
72
74
75
75
75
76
8 MSMP TABLING
8.1 TABLING EVALUATION OF LOGIC PROGRAMS.
8.1.1 REASONS FOR TABLING A PREDICATE.
8.2 THE INPUT LANGUAGE.
8.3 GENERALIZED MAGIC SETS.
8.3.1 BASIC CONCEPT.
8.3.2 TRANSFORMATION RULES.
8.3.3 CORRECTNESS AND COMPLETENESS OF MSMP TABLING WITH GMS
8.3.4 A NOTE ON LEFT RECURSION.
8.4 MAGIC SETS WITH BINDING ENVIRONMENTS.
8.4.1 MOTIVATION AND BASIC IDEA.
8.4.2 TRANSFORMATION RULES.
8.4.3 CORRECTNESS AND COMPLETENESS OF MSMP TABLING WITH MSBE
8.4.4 OPTIMIZATIONS.
8.4.5 TAILORED MATERIALIZATION.
8.4.6 DISCOURSE: COMPILING MODED TOP-DOWN LANGUAGES .
8.5 JUST LEMMAS.
8.5.1 "UP-DOWN" TABULATION. YY YY
8.5.2 NAIVE TABLING.
8.6 EXTENSIONS.
8.6.1 NEGATION AND AGGREGATION.
8.6.2 SPARSE TABLING.
8.6.3 TABLED MULTI-HEADS.
8.6.4 CUTS.
8.6.5 ASSETS INHERITED FROM MP EVALUATION.
8.7 AUTOMATIC GENERATION OF TABLING DIRECTIVES.
8.7.1 SELECTING PREDICATES FOR TABULATION.
8.7.2 MODE ANALYSIS .
8.8 DISCUSSION. YY YY
8.8.1 TABLING, BOTTOM-UP EVALUATION AND EASE OF PROGRAMMING
8.8.2 COMPARISON TO WAM TABLING.
77
77
79
81
82
82
82
85
85
86
86
87
90
94
96
98
100
101
101
103
103
107
109
109
110
111
111
111
112
112
112
IV
CONTENTS
9 PREPROCESSORS 115
9.1 CONSTRAINT HANDLING RULES.116
9.2 DATALOG GRAMMARS.118
10 TEMPORAL RULES 121
10.1 MOTIVATION: GRAPHICAL USER INTERFACES.121
10.2 SYNTAX AND INTUITIVE SEMANTICS. 122
10.2.1 TYPES OF TEMPORAL RULES.122
10.2.2 REPLACEMENT CONDITIONS.122
10.2.3 RESTRICTIONS.124
10.2.4 SEMANTICS: EXPLICIT REPRESENTATION OF TIME.125
10.3 IMPLEMENTATION.127
10.4 RELATED WORK.129
11 CALLING BOTTOM-UP RULES TOP-DOWN 131
11.1 PROPAGATING DELETIONS. 131
11.1.1 MOTIVATION AND OTHER APPROACHES . . . ^.131
11.1.2 CONCEPT.132
11.1.3 IMPLEMENTATION.132
11.2 EXPLANATION FOR BOTTOM-UP RULES.135
11.2.1 "WHY" QUERIES.135
11.2.2 "WHY NOT" QUERIES.136
11.2.3 OTHER EXPLANATION FACILITIES FOR BOTTOM-UP SYSTEMS . 138
12 THE SISYPHOS SYSTEM 139
12.1 IMPLEMENTATION ISSUES.139
12.1.1 IMPLEMENTED ALGORITHMS.139
12.1.2 IMPLEMENTED MATERIALIZATION TECHNIQUES.140
12.1.3 GRAPHICS.141
12.1.4 GROUND REPRESENTATION OF OBJECT PROGRAM VARIABLES . . . 141
12.2 ERROR DIAGNOSIS.141
12.3 EFFICIENCY.142
12.3.1 WAM TABLING VERSUS MSMP TABLING (BLACKBOARD)
. 142
12.3.2 WAM TABLING VERSUS MSMP TABLING (TRIE ASSERTION) . . . 144
13 RELATED WORK
149
13.1 ADITI.149
13.2 BUTTERFLY.150
13.3 DATA-DRIVEN RULES.150
13.4 GOAL-DIRECTED FORWARD CHAINING. 150
13.5 "PR0P"OSITIONAL LOGIC PROGRAMS.151
13.6 SATCHMO.152
13.7 SDML.154 |
| any_adam_object | 1 |
| author | Wunderwald, Jens E. |
| author_facet | Wunderwald, Jens E. |
| author_role | aut |
| author_sort | Wunderwald, Jens E. |
| author_variant | j e w je jew |
| building | Verbundindex |
| bvnumber | BV011233766 |
| classification_tum | DAT 366d DAT 706d |
| ctrlnum | (OCoLC)645851219 (DE-599)BVBBV011233766 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011233766</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970714</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970306s1996 gw ad|| m||| 00||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">949868329</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)645851219</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011233766</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-91</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 366d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 706d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wunderwald, Jens E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Adding bottom-up evaluation to Prolog</subfield><subfield code="c">Jens E. Wunderwald</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">169 S.</subfield><subfield code="b">Ill., 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="500" ind1=" " ind2=" "><subfield code="a">München, Techn. Univ., Diss., 1996</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">Bottom-up-Prinzip</subfield><subfield code="0">(DE-588)4243684-9</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">Bottom-up-Prinzip</subfield><subfield code="0">(DE-588)4243684-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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=" "><subfield code="5">DE-604</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=007538699&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-007538699</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV011233766 |
| illustrated | Illustrated |
| indexdate | 2024-10-09T16:10:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007538699 |
| oclc_num | 645851219 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 |
| owner_facet | DE-91 DE-BY-TUM DE-91G DE-BY-TUM DE-12 |
| physical | 169 S. Ill., graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| spelling | Wunderwald, Jens E. Verfasser aut Adding bottom-up evaluation to Prolog Jens E. Wunderwald 1996 169 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier München, Techn. Univ., Diss., 1996 PROLOG Programmiersprache (DE-588)4047464-1 gnd rswk-swf Bottom-up-Prinzip (DE-588)4243684-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Bottom-up-Prinzip (DE-588)4243684-9 s PROLOG Programmiersprache (DE-588)4047464-1 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007538699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Wunderwald, Jens E. Adding bottom-up evaluation to Prolog PROLOG Programmiersprache (DE-588)4047464-1 gnd Bottom-up-Prinzip (DE-588)4243684-9 gnd |
| subject_GND | (DE-588)4047464-1 (DE-588)4243684-9 (DE-588)4113937-9 |
| title | Adding bottom-up evaluation to Prolog |
| title_auth | Adding bottom-up evaluation to Prolog |
| title_exact_search | Adding bottom-up evaluation to Prolog |
| title_full | Adding bottom-up evaluation to Prolog Jens E. Wunderwald |
| title_fullStr | Adding bottom-up evaluation to Prolog Jens E. Wunderwald |
| title_full_unstemmed | Adding bottom-up evaluation to Prolog Jens E. Wunderwald |
| title_short | Adding bottom-up evaluation to Prolog |
| title_sort | adding bottom up evaluation to prolog |
| topic | PROLOG Programmiersprache (DE-588)4047464-1 gnd Bottom-up-Prinzip (DE-588)4243684-9 gnd |
| topic_facet | PROLOG Programmiersprache Bottom-up-Prinzip Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007538699&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT wunderwaldjense addingbottomupevaluationtoprolog |