Finite domain constraints: declarativity meets efficiency - theory meets application
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Sankt Augustin
Infix
1995
|
| Schriftenreihe: | Dissertationen zur künstlichen Intelligenz
79 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Zugl.: Kaiserslautern, Univ., Diss., 1994 |
| Beschreibung: | 167 S. graph. Darst. |
| ISBN: | 3929037793 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010001594 | ||
| 003 | DE-604 | ||
| 005 | 19950313 | ||
| 007 | t | ||
| 008 | 950116s1995 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 943240816 |2 DE-101 | |
| 020 | |a 3929037793 |9 3-929037-79-3 | ||
| 035 | |a (OCoLC)36128941 | ||
| 035 | |a (DE-599)BVBBV010001594 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-29T |a DE-91G |a DE-11 | ||
| 050 | 0 | |a Q340 | |
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a ST 304 |0 (DE-625)143653: |2 rvk | ||
| 084 | |a DAT 525f |2 stub | ||
| 100 | 1 | |a Meyer, Manfred |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Finite domain constraints |b declarativity meets efficiency - theory meets application |c Manfred Meyer |
| 264 | 1 | |a Sankt Augustin |b Infix |c 1995 | |
| 300 | |a 167 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Dissertationen zur künstlichen Intelligenz |v 79 | |
| 500 | |a Zugl.: Kaiserslautern, Univ., Diss., 1994 | ||
| 650 | 4 | |a Constraint programming (Computer science) | |
| 650 | 4 | |a Constraints (Artificial intelligence) | |
| 650 | 0 | 7 | |a Endliche Menge |0 (DE-588)4381050-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |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 Erfüllbarkeitsproblem |0 (DE-588)4323820-8 |D s |
| 689 | 0 | 1 | |a Endliche Menge |0 (DE-588)4381050-0 |D s |
| 689 | 0 | 2 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Constraint |g Künstliche Intelligenz |0 (DE-588)4314755-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Constraint-logische Programmierung |0 (DE-588)4382849-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 830 | 0 | |a Dissertationen zur künstlichen Intelligenz |v 79 |w (DE-604)BV005345280 |9 79 | |
| 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=006630675&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006630675 | |
Datensatz im Suchindex
| _version_ | 1807323980800983040 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
11
1.1
THE
WORLD
OF
CONSTRAINT
SATISFACTION
PROBLEMS
.
12
1.2
DECLARATIVITY
COMPETES
EFFICIENCY
.
16
1.3
THE
ROLE
OF
FINITE
DOMAIN
CONSTRAINTS
.
19
1.4
OUTLINE
OF
THE
THESIS
.
20
2
BASIC
CONCEPTS
AND
VIEWS
ON
CONSTRAINT
SATISFACTION
23
2.1
FORMULATING
CONSTRAINT
SATISFACTION
PROBLEMS
.
24
2.1.1
VARIABLES
AND
DOMAINS
.
25
2.1.2
ASSIGNING
VALUES
TO
VARIABLES
.
25
2.1.3
CONSTRAINTS
.
26
2.1.4
SATISFYING
A
CONSTRAINT
.
27
2.1.5
FORMAL
DEFINITION
OF
THE
CONSTRAINT
SATISFACTION
PROBLEM
.
28
2.1.6
BINARY
CONSTRAINT
SATISFACTION
PROBLEMS
.
29
2.2
A
LOGICAL
VIEW
ON
CONSTRAINT
SATISFACTION
.
30
2.2.1
FINITE
CONSTRAINT
SATISFACTION
ELS
THEOREM
PROVING
.
30
2.2.2
FINITE
CONSTRAINT
SATISFACTION
DECISION
PROBLEMS
.
31
2.2.3
LOGICAL
REPRESENTATION
AND
REASONING
SYSTEMS
.
33
2.2.4
FCS
AS
PROPOSITIONAL
THEOREM
PROVING
.
34
2.2.5
FCS
AS
THEOREM
PROVING
IN
DEFINITE
THEORIES
.
36
2.2.6
FCS
AS
DATALOG
.
37
2.2.7
FCS
IN
CONSTRAINT
NETWORKS
.
37
2.2.8
AN
ARC-CONSISTENCY
REWRITE
SYSTEM
FOR
FCSPS
.
40
2.2.9
RELATIONS
TO
CONSTRAINT
LOGIC
PROGRAMMING
.
42
2.3
TOWARDS
EFFICIENT
CONSTRAINT
SATISFACTION
.
43
2.3.1
FROM
GENERATE-AND-TEST
TO
BACKTRACKING
.
44
2.3.2
A
GENERIC
BACKTRACKING
ALGORITHM
FOR
SOLVING
FCSPS
.
44
8
CONTENTS
2.4
DISCUSSION
AND
DIRECTIONS
FOR
FURTHER
WORK
.
46
3
CONSTRAINT
PROPAGATION
IN
C
ONTAX
47
3.1
CONSTRAINT
PROPAGATION
TECHNIQUES
.
47
3.1.1
ARC
CONSISTENCY
.
47
3.1.2
HIGHER-LEVEL
CONSISTENCY
.
51
3.1.3
BACKTRACK-FREE
SEARCH
.
52
3.2
THE
C
ONTAX
SYSTEM
.
55
3.2.1
THE
BASIC
CONSISTENCY
ALGORITHM
IN
C
ONTAX
.
55
3.2.2
TERMINATION
AND
COMPLEXITY
CONSIDERATIONS
.
59
3.2.3
THE
CONTAX
SYSTEM
ARCHITECTURE
.
60
3.2.4
A
USER
'S
VIEW
ON
CONTAX
.
62
3.3
DISCUSSION
AND
RELATED
WORK
.
66
4
PARTIAL
CONSTRAINT
SATISFACTION
AND
CONSTRAINT
RELAXATION
69
4.1
PARTIAL
CONSTRAINT
SATISFACTION
PROBLEMS
.
69
4.2
CONSTRAINT
RELAXATION
TECHNIQUES
.
71
4.2.1
MAXIMAL
CONSTRAINT
SATISFACTION
.
71
4.2.2
OPTIMAL
CONSTRAINT
SATISFACTION
.
75
4.3
CONSTRAINT
RELAXATION
IN
C
ONTAX
.
77
4.3.1
A
FORMAL
DEFINITION
OF
PARTIAL
CONSTRAINT
SATISFACTION
.
77
4.3.2
ENFORCING
HYPERARC-CONSISTENCY
IN
PCSP
SOLVING
.
79
4.3.3
TERMINATION
OF
THE
GENERATEBESTSOLUTION
ALGORITHM
.
81
4.3.4
WEIGHTED
CONSTRAINTS
AND
WEIGHTED
VALUE
COMBINATIONS
.
83
4.3.5
A
USER'S
VIEW
ON
WEIGHTED
CONSTRAINTS
IN
CONTAX
.
85
4.4
INCREMENTAL
STRENGTHENING
OF
A
DISCRETE
PCSP
.
88
4.5
DISCUSSION
AND
RELATED
WORK
.
89
5
CONSTRAINT
SATISFACTION
OVER
HIERARCHICALLY
STRUCTURED
DOMAINS
91
5.1
HIERARCHICALLY
STRUCTURED
DOMAINS
.
91
5.2
HIERARCHICAL
HYPERARC-CONSISTENCY
.
94
5.2.1
THE
HIERARCHICAL
DOMAIN
PREDICATES
AC
AND
S
C
.
95
5.2.2
INDUCTIVE
COMPUTATION
OF
THE
HIERARCHICAL
PREDICATES
.
95
5.3
A
HIERARCHICAL
HYPERARC-CONSISTENCY
ALGORITHM
.
98
5.3.1
CORRECTNESS
AND
TERMINATION
.
100
CONTENTS
9
5.3.2
SOLVING
CSPS
OVER
HIERARCHICALLY
STRUCTURED
DOMAINS
.
100
5.4
HIERARCHICALLY
STRUCTURED
DOMAINS
IN
CONTAX
.
102
5.4.1
REPRESENTING
HIERARCHICAL
DOMAINS
.
102
5.4.2
USING
T
AXON
TAXONOMIES
AS
HIERARCHICAL
DOMAINS
.
102
5.4.3
CONSTRAINTS
OVER
HIERARCHICAL
DOMAINS
.
103
5.4.4
THE
HIERARCHICAL
MAP-COLORING
PROBLEM
IN
CONTAX
.
105
5.5
DISCUSSION
AND
RELATED
WORK
.
108
6
FINITE
DOMAIN
CONSTRAINTS
IN
LOGIC
PROGRAMMING
109
6.1
CONSISTENCY
TECHNIQUES
IN
LOGIC
PROGRAMMING
.
110
6.1.1
CONSTRAINT
LOGIC
PROGRAMMING
.
110
6.1.2
REQUIREMENTS
FOR
FINITE
DOMAIN
CONSISTENCY
TECHNIQUES
.
ILL
6.1.3
FINITE
DOMAINS
IN
LOGIC
PROGRAMMING
.
112
6.1.4
CONSTRAINTS
IN
LOGIC
PROGRAMMING
.
112
6.1.5
FORWARD-CHECKING
.
113
6.1.6
LOOKING-AHEAD
.
114
6.2
HOW
MUCH
CONSTRAINT
PROPAGATION
IS
USEFUL?
.
116
6.3
WEAK
LOOKING-AHEAD
.
117
6.4
USING
WEAK
LOOKING-AHEAD
FOR
MAP-COLORING
.
119
6.5
FINITE
DOMAIN
CONSISTENCY
TECHNIQUES
IN
FLDO
.
124
6.5.1
THE
META-INTERPRETATION
APPROACH
.
125
6.5.2
THE
HORIZONTAL
COMPILATION
APPROACH
.
125
6.5.3
THE
VERTICAL
COMPILATION
APPROACH
.
126
6.6
DISCUSSION
AND
RELATED
WORK
.
128
7
PARALLEL
CONSTRAINT
SATISFACTION
IN
LOGIC
PROGRAMMING
129
7.1
PARALLEL
LOGIC
PROGRAMMING
.
129
7.2
WHAT
PARALLELISM
TO
EXPLOIT?
.
130
7.3
SUPPORTING
OR-PARALLELISM
IN
FLDO
.
131
7.3.1
THE
PROBLEM
.
131
7.3.2
A
COPY
SOLUTION
.
132
7.3.3
AVOIDING
COPYING
.
132
7.3.4
AVOIDING
TRAILING
.
133
7.4
DISCUSSION
AND
RELATED
WORK
.
133
10
CONTENTS
8
APPLICATIONS
135
8.1
THE
CAPP
APPLICATION
SCENARIO
.
135
8.2
THE
LATHE-TOOL
SELECTION
PROBLEM
.
137
8.3
THE
LATHE-TOOL
SELECTION
PROBLEM
AS
A
CSP
.
139
8.4
USING
CONTAX
FOR
LATHE-TOOL
SELECTION
.
141
8.4.1
HIERARCHICALLY
STRUCTURED
DOMAINS
.
141
8.4.2
WEIGHTED
CONSTRAINTS
.
142
8.5
DISCUSSION
.
142
8.6
USING
FINITE
DOMAIN
CONSTRAINTS
FOR
UNIVERSITY
SPORTS
SCHEDULING
.
143
9
CONCLUSIONS
147
BIBLIOGRAPHY
149
PART
A:
REFERENCES
.
149
PART
B:
RELATED
PUBLICATIONS
OF
THE
AUTHOR
.
160
PART
C:
RELATED
WORK
BY
THE
AUTHOR
'
S
STUDENTS
.
162 |
| any_adam_object | 1 |
| author | Meyer, Manfred |
| author_facet | Meyer, Manfred |
| author_role | aut |
| author_sort | Meyer, Manfred |
| author_variant | m m mm |
| building | Verbundindex |
| bvnumber | BV010001594 |
| callnumber-first | Q - Science |
| callnumber-label | Q340 |
| callnumber-raw | Q340 |
| callnumber-search | Q340 |
| callnumber-sort | Q 3340 |
| callnumber-subject | Q - General Science |
| classification_rvk | ST 300 ST 304 |
| classification_tum | DAT 525f |
| ctrlnum | (OCoLC)36128941 (DE-599)BVBBV010001594 |
| 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">BV010001594</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950313</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950116s1995 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">943240816</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3929037793</subfield><subfield code="9">3-929037-79-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)36128941</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010001594</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-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q340</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">ST 304</subfield><subfield code="0">(DE-625)143653:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 525f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meyer, Manfred</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finite domain constraints</subfield><subfield code="b">declarativity meets efficiency - theory meets application</subfield><subfield code="c">Manfred Meyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Sankt Augustin</subfield><subfield code="b">Infix</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">167 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="1" ind2=" "><subfield code="a">Dissertationen zur künstlichen Intelligenz</subfield><subfield code="v">79</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Kaiserslautern, Univ., Diss., 1994</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraints (Artificial intelligence)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endliche Menge</subfield><subfield code="0">(DE-588)4381050-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</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">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Endliche Menge</subfield><subfield code="0">(DE-588)4381050-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</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</subfield><subfield code="g">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4314755-0</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">Constraint-logische Programmierung</subfield><subfield code="0">(DE-588)4382849-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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">79</subfield><subfield code="w">(DE-604)BV005345280</subfield><subfield code="9">79</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=006630675&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-006630675</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010001594 |
| illustrated | Illustrated |
| indexdate | 2024-08-14T01:21:00Z |
| institution | BVB |
| isbn | 3929037793 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006630675 |
| oclc_num | 36128941 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM DE-11 |
| owner_facet | DE-29T DE-91G DE-BY-TUM DE-11 |
| physical | 167 S. graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Infix |
| record_format | marc |
| series | Dissertationen zur künstlichen Intelligenz |
| series2 | Dissertationen zur künstlichen Intelligenz |
| spelling | Meyer, Manfred Verfasser aut Finite domain constraints declarativity meets efficiency - theory meets application Manfred Meyer Sankt Augustin Infix 1995 167 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Dissertationen zur künstlichen Intelligenz 79 Zugl.: Kaiserslautern, Univ., Diss., 1994 Constraint programming (Computer science) Constraints (Artificial intelligence) Endliche Menge (DE-588)4381050-0 gnd rswk-swf Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd rswk-swf Deklarative Programmierung (DE-588)4293503-9 gnd rswk-swf Erfüllbarkeitsproblem (DE-588)4323820-8 gnd rswk-swf Constraint-logische Programmierung (DE-588)4382849-8 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Erfüllbarkeitsproblem (DE-588)4323820-8 s Endliche Menge (DE-588)4381050-0 s Deklarative Programmierung (DE-588)4293503-9 s DE-604 Constraint Künstliche Intelligenz (DE-588)4314755-0 s Constraint-logische Programmierung (DE-588)4382849-8 s Dissertationen zur künstlichen Intelligenz 79 (DE-604)BV005345280 79 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006630675&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Meyer, Manfred Finite domain constraints declarativity meets efficiency - theory meets application Dissertationen zur künstlichen Intelligenz Constraint programming (Computer science) Constraints (Artificial intelligence) Endliche Menge (DE-588)4381050-0 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
| subject_GND | (DE-588)4381050-0 (DE-588)4314755-0 (DE-588)4293503-9 (DE-588)4323820-8 (DE-588)4382849-8 (DE-588)4113937-9 |
| title | Finite domain constraints declarativity meets efficiency - theory meets application |
| title_auth | Finite domain constraints declarativity meets efficiency - theory meets application |
| title_exact_search | Finite domain constraints declarativity meets efficiency - theory meets application |
| title_full | Finite domain constraints declarativity meets efficiency - theory meets application Manfred Meyer |
| title_fullStr | Finite domain constraints declarativity meets efficiency - theory meets application Manfred Meyer |
| title_full_unstemmed | Finite domain constraints declarativity meets efficiency - theory meets application Manfred Meyer |
| title_short | Finite domain constraints |
| title_sort | finite domain constraints declarativity meets efficiency theory meets application |
| title_sub | declarativity meets efficiency - theory meets application |
| topic | Constraint programming (Computer science) Constraints (Artificial intelligence) Endliche Menge (DE-588)4381050-0 gnd Constraint Künstliche Intelligenz (DE-588)4314755-0 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Constraint-logische Programmierung (DE-588)4382849-8 gnd |
| topic_facet | Constraint programming (Computer science) Constraints (Artificial intelligence) Endliche Menge Constraint Künstliche Intelligenz Deklarative Programmierung Erfüllbarkeitsproblem Constraint-logische Programmierung Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006630675&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV005345280 |
| work_keys_str_mv | AT meyermanfred finitedomainconstraintsdeclarativitymeetsefficiencytheorymeetsapplication |