Projection in constraint logic programming:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Sankt Augustin
Infix
1999
|
| Schriftenreihe: | Dissertationen zur künstlichen Intelligenz
199 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Berlin, Techn. Univ., Diss., 1999 |
| Beschreibung: | XIV, 145 S. |
| ISBN: | 3896011995 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012582028 | ||
| 003 | DE-604 | ||
| 005 | 19990818 | ||
| 007 | t | ||
| 008 | 990531s1999 m||| 00||| eng d | ||
| 016 | 7 | |a 956339387 |2 DE-101 | |
| 020 | |a 3896011995 |9 3-89601-199-5 | ||
| 035 | |a (OCoLC)76051552 | ||
| 035 | |a (DE-599)BVBBV012582028 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-29T | ||
| 084 | |a DAT 706d |2 stub | ||
| 100 | 1 | |a Fordan, Andreas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Projection in constraint logic programming |c Andreas Fordan |
| 264 | 1 | |a Sankt Augustin |b Infix |c 1999 | |
| 300 | |a XIV, 145 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Dissertationen zur künstlichen Intelligenz |v 199 | |
| 500 | |a Zugl.: Berlin, Techn. Univ., Diss., 1999 | ||
| 650 | 0 | 7 | |a Quantorenelimination |0 (DE-588)4308709-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Backtracking |0 (DE-588)4210193-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bottom-up-Prinzip |0 (DE-588)4243684-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Systemplanung |0 (DE-588)4058811-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
| 689 | 1 | 1 | |a Quantorenelimination |0 (DE-588)4308709-7 |D s |
| 689 | 1 | 2 | |a Backtracking |0 (DE-588)4210193-1 |D s |
| 689 | 1 | 3 | |a Systemplanung |0 (DE-588)4058811-7 |D s |
| 689 | 1 | 4 | |a Bottom-up-Prinzip |0 (DE-588)4243684-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Dissertationen zur künstlichen Intelligenz |v 199 |w (DE-604)BV005345280 |9 199 | |
| 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=008545153&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008545153 | |
Datensatz im Suchindex
| _version_ | 1807593841909301248 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
2
LOGIC
PROGRAMMING
7
2.1
HORN
CLAUSE
LOGIC
.
7
2.1.1
SYNTAX
.
7
2.1.2
DECLARATIVE
SEMANTICS
.
8
2.1.3
NEGATION
.
10
2.2
PROLOG
.
11
2.2.1
SLD
RESOLUTION
.
12
2.2.2
NEGATION
AS
FAILURE
.
13
2.2.3
CONCEPTS
OF
PROLOG
.
13
2.2.4
TABLING
.
15
2.2.5
THE
WARREN
ABSTRACT
MACHINE
.
16
2.3
DEDUCTIVE
DATABASES
.
17
2.3.1
RELATIONAL
DATABASES
AND
DATALOG
.
17
2.3.2
PROGRAM
EVALUATION
.
18
2.3.3
QUERY
EVALUATION
.
19
2.3.4
EQUIVALENCE
OF TABLING
AND
MAGIC-SETS
.
21
3
CONSTRAINT
LOGIC
PROGRAMMING
23
3.1
CONSTRAINT
CLAUSE
LOGIC
.
23
3.1.1
SYNTAX
.
23
3.1.2
DECLARATIVE
SEMANTICS
.
24
3.1.3
NEGATION
.
25
3.2
THE
CLP(X)
FRAMEWORK
.
25
3.2.1
CONSTRAINT
RESOLUTION
.
25
3.2.2
CONSTRUCTIVE
NEGATION
.
25
3.2.3
SOME
DOMAINS
.
26
3.2.4
CONSTRAINT
HANDLING
.
30
3.2.5
ABSTRACT
MACHINES
.
31
3.3
CONSTRAINT
DATABASES
.
32
3.3.1
THE
CQL(X)
FRAMEWORK
.
32
3.3.2
STORING
CONSTRAINT
RELATIONS
.
34
3.3.3
STATIC
CONSTRAINT
SOLVING
.
34
3.3.4
TOP-DOWN
VS.
BOTTOM-UP
.
35
4
PROJECTION
IN
CLP(X)
37
4.1
QUANTIFIERS
IN
RESOLUTION
.
38
4.1.1
LOCAL
VARIABLES
.
38
4.1.2
DEAD
VARIABLES
.
39
4.1.3
SAFE
VARIABLES
.
40
4.1.4
EARLY
VS.
ANSWER
PROJECTION
.
42
4.2
A
FRAMEWORK
FOR
AUTOMATIC
PROJECTION
.
43
4.2.1
ARCHITECTURE
.
43
4.2.2
DETECTION
OF DEAD
VARIABLES
.
44
4.2.3
DETECTION
OF
SAFE
VARIABLES
.
46
4.2.4
PROGRAMMING
STYLE
.
47
4.3
PROJECTION
AND
LOGIC
PROGRAMMING
.
48
4.3.1
PROJECTION
IN
PROLOG
.
48
4.3.2
PROJECTION
IN
DATABASES
.
51
5
PROJECTION
IN
DENSE
FIELDS
53
5.1
LINEAR
QUANTIFIER
ELIMINATION
.
53
5.1.1
BASIC
DEFINITIONS
.
53
5.1.2
THE
GAUSS
METHOD
.
54
5.1.3
THE
FOURIER
METHOD
.
55
5.1.4
NON-INCREMENTAL
METHODS
.
56
5.2
REDUNDANCY
OF
LINEAR
INEQUALITIES
.
57
5.2.1
FARKAS
'
LEMMA
.
57
5.2.2
CLASSES
OF
REDUNDANCY
.
58
5.2.3
IMPLICIT
EQUALITIES
.
58
5.2.4
CERNIKOV
'
S
AND
KOHLER
'
S
HEURISTIC
.
59
5.2.5
SUBSUMPTION
CONE
.
60
5.3
NONLINEAR
QUANTIFIER
ELIMINATION
.
60
5.3.1
A
FIRST
APPROACH
.
60
5.3.2
ALGEBRA
OF
POLYNOMIAL
RINGS
.
61
5.3.3
RESULTANTS
.
62
5.3.4
CYLINDRICAL
ALGEBRAIC
DECOMPOSITION
.
64
5.4
PRACTICAL
ANSWER
PROJECTION
.
64
5.4.1
CLP(R)
.
64
5.4.2
RISC-CLP(R)
.
65
6
PROJECTION
IN
FINITE
DOMAINS
67
6.1
GENERAL
INTEGER
PROJECTION
.
67
6.1.1
INCORRECTNESS
OF REAL
METHODS
.
68
6.1.2
THE
OMEGA
TEST
.
68
6.1.3
A
CONJUNCTIVE
APPROACH
.
69
6.2
SUBCLASSES
OF
EFFICIENT
INTEGER
PROJECTION
.
69
6.2.1
QUANTITATIVE
PROBLEMS
.
70
6.2.2
INTEGER
EQUATIONS
.
70
6.2.3
INTEGER
VERTICES
.
71
XII
6.2.4
UNIT
COEFFICIENTS
.
72
6.3
PROPAGATION
AND
PROJECTION
.
73
6.3.1
GENERATION
OF
REDUNDANT
CONSTRAINTS
.
74
6.3.2
MAXIMAL
PROPAGATION
.
74
6.4
MANUAL
EARLY
PROJECTION
IN
CLP(FD)
.
76
6.4.1
SIMPLIFYING
LINEAR
PROBLEMS
.
76
6.4.2
IMPROVING
PROPAGATION
.
77
6.5
SOLVING
THE
FAKOS
PROBLEM
.
77
6.5.1
MODELING
THE
FLOW-SHOP
PROBLEM
IN
CLP(FD)
.
78
6.5.2
REDUCING
THE
SEARCH
SPACE
.
79
6.5.3
OPTIMIZING
FAIRNESS
.
79
7
EARLY
PROJECTION
IN
CLP(R)
81
7.1
MANUAL
PROJECTION
VIA
META-PROGRAMMING
.
81
7.2
AUTOMATIC
PROJECTION
.
82
7.2.1
HEURISTICS
FOR
CLP(R)
.
82
7.2.2
PROJECTING
LINEAR
EQUATIONS
.
83
7.2.3
THE
SIMPLEX
ALGORITHM
AND
SOLVED
FORM
.
84
7.2.4
IN-SITU
PROJECTION
OF
LINEAR
INEQUALITIES
.
85
7.3
CONSERVATIVE
IN-SITU
REMOVAL
.
87
7.3.1
THE
TYIVIAL
CASE
.
88
7.3.2
THE
SINGLE
CASE
.
89
7.3.3
KEEPING
TRACK
OF
VARIABLE
OCCURENCES
.
91
7.4
APPLICATIONS
OF
EARLY
PROJECTION
.
92
7.4.1
A
TOY
EXAMPLE
.
93
7.4.2
THE
CAN-BUILD
PROBLEM
.
94
7.4.3
THE
FAKOS
PROBLEM
.
96
8
PROJECTION
IN
CQL(Q
I,N
)
99
8.1
A
DATABASE
OPTIMIZED
FOR
PROJECTION
.
99
8.1.1
THE
COMPILER
.
100
8.1.2
THE
INTERPRETER
.
100
8.2
A
CAN-BUILD
EXAMPLE
.
101
8.2.1
MODELING
.
102
8.2.2
DISCUSSION
.
103
9
CONCLUSIONS
105
A
THE
CAN-BUILD
PROBLEM
107
A.L
MATERIALS
REQUIREMENTS
PLANNING
.
107
A.1.1
THE
I-MRP
SYSTEM
.
108
A.L.
2
CAN-BUILD
-
A
PARTICULAR
DEMAND
MODEL
IN
MRP
.
108
A.L.
3
THE
TWO
PHASES
OF
CAN-BUILD
.
110
A.1.4
A
CAN-BUILD
EXAMPLE
.
110
A.2
SOLVING
CAN-BUILD
USING
CLP(R)
.
ILL
XIII
A.
2.1
TIME
PROFILES
.
ILL
A.2.2 MERGING
PROFILES
.
113
A.
2.3
SHARED
PARTS
.
114
A.
2.4
ANALYSIS
OF
A
PRODUCTION
PLAN
.
116
A.
2.5
A
GRAPHICAL
ANALYSIS
TOOL
.
117
A.2.6
EMPIRICAL
RESULTS
.
119
A.
3
SOLVING
CAN-BUILD
USING
GRAPH
TRANSFORMATION
.
121
A.
3.1
FLATTENING
THE
GRAPH
.
121
A.3.2
SOLVING
FLAT
PROBLEMS
.
122
A.4
REDUNDANCY
IN
CAN-BUILD
.
123
A.4.1
REDUNDANCY
IN
THE
NON-NEGATIVE
DOMAIN
.
123
A.4.
2
COMPLEXITY
OF
CAN-BUILD
SOLUTIONS
.
125
B
THE
FAKOS
PROBLEM
127
B.L
THE
FAKOS
PROJECT
.
127
B.L.L
LOGISTICS
IN
FLOW-SHOP
PRODUCTION
.
127
B.1.2
A
FACTORY
EXAMPLE
.
128
B.2
REALIZING
FAKOS
.
129
B.2.1
CONSTRAINT
MODELING
.
129
B.2.
2
OPTIMIZATION
.
131
B.2.
3
DISTRIBUTED
SOLUTION
.
132
BIBLIOGRAPHY
133
INDEX
141
XIV |
| any_adam_object | 1 |
| author | Fordan, Andreas |
| author_facet | Fordan, Andreas |
| author_role | aut |
| author_sort | Fordan, Andreas |
| author_variant | a f af |
| building | Verbundindex |
| bvnumber | BV012582028 |
| classification_tum | DAT 706d |
| ctrlnum | (OCoLC)76051552 (DE-599)BVBBV012582028 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV012582028</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19990818</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">990531s1999 m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">956339387</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3896011995</subfield><subfield code="9">3-89601-199-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76051552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012582028</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-91G</subfield><subfield code="a">DE-29T</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">Fordan, Andreas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Projection in constraint logic programming</subfield><subfield code="c">Andreas Fordan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Sankt Augustin</subfield><subfield code="b">Infix</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 145 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">Dissertationen zur künstlichen Intelligenz</subfield><subfield code="v">199</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Berlin, Techn. Univ., Diss., 1999</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Quantorenelimination</subfield><subfield code="0">(DE-588)4308709-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Backtracking</subfield><subfield code="0">(DE-588)4210193-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="650" ind1="0" ind2="7"><subfield code="a">Systemplanung</subfield><subfield code="0">(DE-588)4058811-7</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="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">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</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="1"><subfield code="a">Quantorenelimination</subfield><subfield code="0">(DE-588)4308709-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Backtracking</subfield><subfield code="0">(DE-588)4210193-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Systemplanung</subfield><subfield code="0">(DE-588)4058811-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Dissertationen zur künstlichen Intelligenz</subfield><subfield code="v">199</subfield><subfield code="w">(DE-604)BV005345280</subfield><subfield code="9">199</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=008545153&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-008545153</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV012582028 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-17T00:50:19Z |
| institution | BVB |
| isbn | 3896011995 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008545153 |
| oclc_num | 76051552 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-29T |
| owner_facet | DE-91G DE-BY-TUM DE-29T |
| physical | XIV, 145 S. |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Infix |
| record_format | marc |
| series | Dissertationen zur künstlichen Intelligenz |
| series2 | Dissertationen zur künstlichen Intelligenz |
| spelling | Fordan, Andreas Verfasser aut Projection in constraint logic programming Andreas Fordan Sankt Augustin Infix 1999 XIV, 145 S. txt rdacontent n rdamedia nc rdacarrier Dissertationen zur künstlichen Intelligenz 199 Zugl.: Berlin, Techn. Univ., Diss., 1999 Quantorenelimination (DE-588)4308709-7 gnd rswk-swf Backtracking (DE-588)4210193-1 gnd rswk-swf Bottom-up-Prinzip (DE-588)4243684-9 gnd rswk-swf Systemplanung (DE-588)4058811-7 gnd rswk-swf Constraint-logische Programmierung (DE-588)4382849-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Constraint-logische Programmierung (DE-588)4382849-8 s DE-604 Quantorenelimination (DE-588)4308709-7 s Backtracking (DE-588)4210193-1 s Systemplanung (DE-588)4058811-7 s Bottom-up-Prinzip (DE-588)4243684-9 s Dissertationen zur künstlichen Intelligenz 199 (DE-604)BV005345280 199 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008545153&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Fordan, Andreas Projection in constraint logic programming Dissertationen zur künstlichen Intelligenz Quantorenelimination (DE-588)4308709-7 gnd Backtracking (DE-588)4210193-1 gnd Bottom-up-Prinzip (DE-588)4243684-9 gnd Systemplanung (DE-588)4058811-7 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
| subject_GND | (DE-588)4308709-7 (DE-588)4210193-1 (DE-588)4243684-9 (DE-588)4058811-7 (DE-588)4382849-8 (DE-588)4113937-9 |
| title | Projection in constraint logic programming |
| title_auth | Projection in constraint logic programming |
| title_exact_search | Projection in constraint logic programming |
| title_full | Projection in constraint logic programming Andreas Fordan |
| title_fullStr | Projection in constraint logic programming Andreas Fordan |
| title_full_unstemmed | Projection in constraint logic programming Andreas Fordan |
| title_short | Projection in constraint logic programming |
| title_sort | projection in constraint logic programming |
| topic | Quantorenelimination (DE-588)4308709-7 gnd Backtracking (DE-588)4210193-1 gnd Bottom-up-Prinzip (DE-588)4243684-9 gnd Systemplanung (DE-588)4058811-7 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
| topic_facet | Quantorenelimination Backtracking Bottom-up-Prinzip Systemplanung Constraint-logische Programmierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008545153&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV005345280 |
| work_keys_str_mv | AT fordanandreas projectioninconstraintlogicprogramming |