Tractable reasoning in artificial intelligence:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin u.a.
Springer
1995
|
| Schriftenreihe: | Lecture notes in computer science
941 : Lecture notes in artificial intelligence |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 247 S. |
| ISBN: | 3540600582 0387600582 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010211181 | ||
| 003 | DE-604 | ||
| 005 | 20041230 | ||
| 007 | t| | ||
| 008 | 950530s1995 gw |||| 00||| eng d | ||
| 016 | 7 | |a 944459447 |2 DE-101 | |
| 020 | |a 3540600582 |9 3-540-60058-2 | ||
| 020 | |a 0387600582 |9 0-387-60058-2 | ||
| 035 | |a (OCoLC)722298261 | ||
| 035 | |a (DE-599)BVBBV010211181 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-20 |a DE-19 |a DE-706 |a DE-634 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a Q335.C23 1995 | |
| 082 | 0 | |a 006.3/3 |2 20 | |
| 082 | 0 | |a 006.3/3 20 | |
| 084 | |a ST 285 |0 (DE-625)143648: |2 rvk | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a DAT 706f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Cadoli, Marco |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tractable reasoning in artificial intelligence |c Marco Cadoli |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1995 | |
| 300 | |a XIV, 247 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 941 : Lecture notes in artificial intelligence | |
| 650 | 4 | |a Approximation, Théorie de l' | |
| 650 | 7 | |a Approximation, Théorie de l' |2 ram | |
| 650 | 4 | |a Argumentation - Informatique | |
| 650 | 7 | |a Comlpexité de calcul (Informatique) |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Inteligencia artificial |2 larpcal | |
| 650 | 4 | |a Intelligence artificielle | |
| 650 | 7 | |a Intelligence artificielle |2 ram | |
| 650 | 7 | |a Intellligence Artificielle |2 ram | |
| 650 | 7 | |a Kunstmatige intelligentie |2 gtt | |
| 650 | 7 | |a Raisonnement |2 ram | |
| 650 | 7 | |a Redeneren |2 gtt | |
| 650 | 7 | |a logique |2 inriac | |
| 650 | 7 | |a raisonnement approximatif |2 inriac | |
| 650 | 7 | |a raisonnement minimal |2 inriac | |
| 650 | 7 | |a raisonnement |2 inriac | |
| 650 | 7 | |a théorie connaissance |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Reasoning -- Data processing | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Approximation theory | |
| 650 | 0 | 7 | |a Approximatives Schließen |0 (DE-588)4231005-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wissensrepräsentation |0 (DE-588)4049534-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Wissensrepräsentation |0 (DE-588)4049534-6 |D s |
| 689 | 0 | 1 | |a Approximatives Schließen |0 (DE-588)4231005-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 941 : Lecture notes in artificial intelligence |w (DE-604)BV000000607 |9 941 : Lecture | |
| 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=006785700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006785700 | |
Datensatz im Suchindex
| _version_ | 1820874846619303936 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
1.1
WHAT
IS
ARTIFICIAL
INTELLIGENCE?
.
1
1.2
THE
ROLE
OF
LOGIC
IN
ARTIFICIAL
INTELLIGENCE
.
2
1.3
LOGIC
AND
COMPUTATIONAL
COMPLEXITY
.
6
1.4
THE
SUBJECT
OF
THIS
BOOK
.
9
1.5
PREVIOUS
STUDIES
.
10
1.6
A
CLOSER
LOOK
AT
THE
SUBJECT
OF
THIS
BOOK
.
14
1.6.1
LANGUAGE
RESTRICTION
.
14
1.6.2
THEORY
APPROXIMATION
.
15
1.6.3
LINKING
THE
TWO
TECHNIQUES
.
16
1.7
POSSIBLE
CRITICS
.
16
1.8
WHO
MAY
BE
INTERESTED
IN
READING
THIS
BOOK?
.
18
1.8.1
PREREQUISITES
.
18
1.9
STRUCTURE
OF
THE
BOOK
.
18
1.10
TERMINOLOGY
AND
PRELIMINARY
NOTIONS
.
19
1.10.1
PROPOSITIONAL
LOGIC
.
.
.
.
19
1.10.2
FIRST-ORDER
PREDICATE
LOGIC
.
.
.
.
20
1.10.3
COMPLEXITY
CLASSES
.
22
1.10.4
POLYNOMIAL
FRAGMENTS
OF
PROPOSITIONAL
LOGIC
.
25
XII
CONTENTS
2
LANGUAGE
RESTRICTION:
COMPLEXITY
OF
MINIMAL
REASONING
27
2.1
WHY
NON-MONOTONIC
REASONING?
.
28
2.2
MINIMAL
MODELS,
CIRCUMSCRIPTION
AND
CLOSED
WORLD
REASONING
.
29
2.2.1
MINIMAL
MODELS
AND
CIRCUMSCRIPTION
.
29
2.2.2
MINIMAL
MODELS
AND
CLOSED
WORLD
REASONING
.
31
2.3
COMPLEXITY
OF
CLOSED
WORLD
REASONING
.
39
2.3.1
GOAL
OF
THE
RESEARCH
AND
RELATED
RESULTS
.
39
2.3.2
RESULTS
.
39
2.4
COMPLEXITY
OF
MINIMAL
MODEL
CHECKING
.
46
2.4.1
GOAL
OF
THE RESEARCH
AND
RELATED
RESULTS
.
46
2.4.2
RESULTS
.
47
2.5
COMPLEXITY
OF
FINDING
A
MINIMAL
MODEL
.
49
2.5.1
GOAL
OF
THE
RESEARCH
AND
RELATED
RESULTS
.
49
2.5.2
.
RESULTS
.
50
2.6
CIRCUMSCRIPTION
IN
FIRST-ORDER
FORMULAE
.
52
2.6.1
GOAL
OF
THE
RESEARCH
AND
RELATED
RESULTS
.
52
2.6.2
RESULTS
.
53
2.7
APPLICATIONS
OF
TRACTABLE
MINIMAL
REASONING
TO
PRACTICAL
REASONING
54
2.7.1
NON-MONOTONIC
INHERITANCE
.
55
2.7.1.1
SYNTAX
.
55
2.7.1.2
SEMANTICS
.
57
2.7.1.3
COMPUTATIONAL
ANALYSIS
.
60
2.7.2
MODEL-BASED
DIAGNOSIS
.
62
2.7.3
OTHER
APPLICATIONS
.
64
3
APPROXIMATION
OF
A
LOGICAL
THEORY
67
3.1
LOGIC-BASED
METHODS
FOR
APPROXIMATION:
EXISTING
TECHNIQUES
.
.
68
3.1.1
LEVESQUE
'
S
LIMITED
INFERENCE
.
68
3.1.2
SELMAN
AND
KAUTZ
'
S
HORN
KNOWLEDGE
COMPILATION
.
70
3.1.3
COMPARISON
BETWEEN
THE
TWO
APPROACHES
.
71
3.2
GUIDELINES
OF
A
NEW
METHOD
FOR
APPROXIMATION
.
72
3.3
APPROXIMATION
OF
PROPOSITIONAL
LOGIC
.
75
3.3.1
SEMANTICS
.
75
3.3.2
COMPUTATIONAL
ASPECTS
.
78
3.3.3
DISCUSSION
AND
EXAMPLES
.
80
3.4
APPROXIMATE
REASONING
AND
NON-OMNISCIENT
AGENTS
.
83
3.4.1
SYNTAX
AND
SEMANTICS
.
84
3.4.2
PROPERTIES
AND
APPLICATIONS
.
85
3.5
APPROXIMATION
OF
CONCEPT
DESCRIPTION
LANGUAGES
.
89
3.5.1
CONCEPT
LANGUAGES
.
90
3.5.2
FIRST-ORDER
GENERALIZATION
OF
S-INTERPRETATIONS
.
92
3.5.3
APPROXIMATION
OF
ACC
.
95
3.5.4
APPROXIMATION
OF
ACC
.
100
3.6
APPROXIMATION
OF
NON-MONOTONIC
LOGICS
.
103
3.6.1
APPROXIMATION
OF
DEFAULT
LOGIC
.
104
3.6.1.1
PRELIMINARIES
.
104
CONTENTS
XIII
3.6.1.2
APPROXIMATION
METHOD
.
105
3.6.2
APPROXIMATION
OF
CIRCUMSCRIPTION
.
ILL
3.6.2.1
PRELIMINARIES
.
ILL
3.6.2.2
APPROXIMATION
METHOD
.
112
3.7
APPROXIMATION
OF
PROPOSITIONAL
MODAL
LOGICS
.
115
3.7.1
SEMANTICS
.
115
3.7.2
PROPERTIES
.
118
4
USING
COMPLEXITY
RESULTS
FOR
EVALUATING
APPROXIMATION
TECHNIQUES
123
4.1
HORN
COMPILATION:
SEMANTICAL
AND
COMPUTATIONAL
ASPECTS
.
123
4.2
HORN
GLBS
.
125
4.2.1
FROM
GLBS
TO
MINIMAL
MODELS
.
125
4.2.2
.
FROM
MINIMAL
MODELS
TO
GLBS
.
126
4.2.3
SEMANTICAL
CONSEQUENCES
.
126
4.3
HORN
LUB
.
128
4.3.1
HORN
UBS
WITH
A
LIMITED
NUMBER
OF
CLAUSES
.
128
4.3.2
DEALING
WITH
THE
LUB
IMPLICITLY
.
130
4.3.3
COMMENTS
ON
THE
COMPUTATIONAL
RESULTS
.
130
4.3.4
A
SEMANTICAL
REMARK
.
131
4.4
DISCUSSION
.
131
5
CONCLUSIONS
133
5.1
COMMENTS
ON
THE
RESULTS
OBTAINED
.
133
5.2
OPEN
PROBLEMS
.
135
5.2.1
COMPLEXITY
OF
MINIMAL
REASONING
.
136
5.2.2
APPROXIMATION
OF
A
LOGICAL
THEORY
.
137
A
APPENDIX
TO
CHAPTER
2
141
A.L
APPENDIX
TO
SECTION
2.3
.
141
A.
1.1
PRELIMINARIES
.
141
A.1.2
UPPER
BOUNDS
AND
ALGORITHMS
FOR
CWR
.
142
A.
1.2.1
UPPER
BOUNDS
OF
CWR
.
142
A.
1.2.2
ALGORITHMS
FOR
COMPUTING
CIRCUMSCRIPTION
.
.
.
.
146
A.
1.3
CWA
.
149
A.
1.4
GCWA
.
151
A.
1.4.1
INTRACTABLE
CASES
.
151
A.
1.4.2
TRACTABLE
CASES
.
152
A.
1.5
EGCWA
.
153
A.
1.5.1
INTRACTABLE
CASES
.
153
A.
1.5.2
TRACTABLE
CASES
.
154
A.
1.6
CCWA
.
154
A.
1.6.1
INTRACTABLE
CASES
.
155
A.
1.6.2
TYACTABLE
CASES
.
156
A.
1.7
ECWA
.
158
A.
1.7.1
INTRACTABLE
CASES
.
159
XIV
CONTENTS
A.
1.7.2
TRACTABLE
CASES
.
166
A.
1.8
INFERENCE
OF
NEW
POSITIVE
CLAUSES
.
172
A.2
APPENDIX
TO
SECTION
2.4
.
174
A.2.1
INTRACTABLE
CASES
.
174
A.2.2
TRACTABLE
CASES
.
177
A.3
APPENDIX
TO
SECTION
2.5
.
178
A.3.1
PRELIMINARIES
.
178
A.3.
2
INTRACTABLE
CASES
.
179
A.
3.3
TRACTABLE
CASES
.
182
A.
4
APPENDIX
TO
SECTION
2.6
.
184
A.4.1
THE
REDUCTION
.
184
A.4.2
EXAMPLE
.
188
A.5
APPENDIX
TO
SECTION
2.7
.
189
A.5.1
APPENDIX
TO
SECTION
2.7.1
.
189
A.
5.1.1
SEMANTICS
OF
NINS
.
189
A.5.
1.2
INTRACTABLE
CASES
.
191
A.
5.1.3
TRACTABLE
CASES
.
.
193
A.5.2
APPENDIX
TO
SECTION
2.7.2
.
194
B
APPENDIX
TO
CHAPTER
3
197
B.L
APPENDIX
TO
SECTION
3.3
.
197
B.L.L
PROOFS
OF
THEOREMS
.
197
B.1.2
REDUCING
S-ENTAILMENT
TO
S-UNSATISFIABILITY
.
.
199
B.1.3
ALGORITHMS
FOR
TESTING
S-SATISFIABILITY
.
.
.
202
B.L.
3.1
RESOLUTION
AND
ENUMERATION
.
203
B.L.
3.2
THE
ALGORITHM
.
205
B.2
APPENDIX
TO
SECTION
3.4
.
207
B.3
APPENDIX
TO
SECTION
3.5
.
211
B.3.1
PRELIMINARIES
.
211
B.3.
2
APPENDIX
TO
SECTION
3.5.3
.
212
B.3.
3
APPENDIX
TO
SECTION
3.5.4
.
214
B.4
APPENDIX
TO
SECTION
3.6
.
215
B.4.1
APPENDIX
TO
SECTION
3.6.1
.
215
B.4.
2
APPENDIX
TO
SECTION
3.6.2
.
217
B.5
APPENDIX
TO
SECTION
3.7
.
;
.
218
C
APPENDIX
TO
CHAPTER
4
221
C.L
APPENDIX
TO
SECTION
4.2
.
221
C.2
APPENDIX
TO
SECTION
4.3
.
223
BIBLIOGRAPHY
227
INDEX
241 |
| any_adam_object | 1 |
| author | Cadoli, Marco |
| author_facet | Cadoli, Marco |
| author_role | aut |
| author_sort | Cadoli, Marco |
| author_variant | m c mc |
| building | Verbundindex |
| bvnumber | BV010211181 |
| callnumber-first | Q - Science |
| callnumber-label | Q335 |
| callnumber-raw | Q335.C23 1995 |
| callnumber-search | Q335.C23 1995 |
| callnumber-sort | Q 3335 C23 41995 |
| callnumber-subject | Q - General Science |
| classification_rvk | ST 285 ST 300 |
| classification_tum | DAT 706f |
| ctrlnum | (OCoLC)722298261 (DE-599)BVBBV010211181 |
| dewey-full | 006.3/3 006.3/320 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3/3 006.3/3 20 |
| dewey-search | 006.3/3 006.3/3 20 |
| dewey-sort | 16.3 13 |
| 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>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010211181</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20041230</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950530s1995 gw |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">944459447</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540600582</subfield><subfield code="9">3-540-60058-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387600582</subfield><subfield code="9">0-387-60058-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)722298261</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010211181</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-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q335.C23 1995</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3/3</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3/3 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 285</subfield><subfield code="0">(DE-625)143648:</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="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cadoli, Marco</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tractable reasoning in artificial intelligence</subfield><subfield code="c">Marco Cadoli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 247 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">Lecture notes in computer science</subfield><subfield code="v">941 : Lecture notes in artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation, Théorie de l'</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Approximation, Théorie de l'</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Argumentation - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Comlpexité de calcul (Informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Inteligencia artificial</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Intelligence artificielle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Intelligence artificielle</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Intellligence Artificielle</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Kunstmatige intelligentie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Raisonnement</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Redeneren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">raisonnement approximatif</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">raisonnement minimal</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">raisonnement</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie connaissance</subfield><subfield code="2">inriac</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></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning -- Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximatives Schließen</subfield><subfield code="0">(DE-588)4231005-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wissensrepräsentation</subfield><subfield code="0">(DE-588)4049534-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Wissensrepräsentation</subfield><subfield code="0">(DE-588)4049534-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Approximatives Schließen</subfield><subfield code="0">(DE-588)4231005-2</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">Lecture notes in computer science</subfield><subfield code="v">941 : Lecture notes in artificial intelligence</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">941 : Lecture</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=006785700&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-006785700</subfield></datafield></record></collection> |
| id | DE-604.BV010211181 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:06:14Z |
| institution | BVB |
| isbn | 3540600582 0387600582 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006785700 |
| oclc_num | 722298261 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 DE-11 DE-188 |
| physical | XIV, 247 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Cadoli, Marco Verfasser aut Tractable reasoning in artificial intelligence Marco Cadoli Berlin u.a. Springer 1995 XIV, 247 S. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 941 : Lecture notes in artificial intelligence Approximation, Théorie de l' Approximation, Théorie de l' ram Argumentation - Informatique Comlpexité de calcul (Informatique) ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Inteligencia artificial larpcal Intelligence artificielle Intelligence artificielle ram Intellligence Artificielle ram Kunstmatige intelligentie gtt Raisonnement ram Redeneren gtt logique inriac raisonnement approximatif inriac raisonnement minimal inriac raisonnement inriac théorie connaissance inriac Datenverarbeitung Künstliche Intelligenz Artificial intelligence Reasoning -- Data processing Computational complexity Approximation theory Approximatives Schließen (DE-588)4231005-2 gnd rswk-swf Wissensrepräsentation (DE-588)4049534-6 gnd rswk-swf Wissensrepräsentation (DE-588)4049534-6 s Approximatives Schließen (DE-588)4231005-2 s DE-604 Lecture notes in computer science 941 : Lecture notes in artificial intelligence (DE-604)BV000000607 941 : Lecture DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006785700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Cadoli, Marco Tractable reasoning in artificial intelligence Lecture notes in computer science Approximation, Théorie de l' Approximation, Théorie de l' ram Argumentation - Informatique Comlpexité de calcul (Informatique) ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Inteligencia artificial larpcal Intelligence artificielle Intelligence artificielle ram Intellligence Artificielle ram Kunstmatige intelligentie gtt Raisonnement ram Redeneren gtt logique inriac raisonnement approximatif inriac raisonnement minimal inriac raisonnement inriac théorie connaissance inriac Datenverarbeitung Künstliche Intelligenz Artificial intelligence Reasoning -- Data processing Computational complexity Approximation theory Approximatives Schließen (DE-588)4231005-2 gnd Wissensrepräsentation (DE-588)4049534-6 gnd |
| subject_GND | (DE-588)4231005-2 (DE-588)4049534-6 |
| title | Tractable reasoning in artificial intelligence |
| title_auth | Tractable reasoning in artificial intelligence |
| title_exact_search | Tractable reasoning in artificial intelligence |
| title_full | Tractable reasoning in artificial intelligence Marco Cadoli |
| title_fullStr | Tractable reasoning in artificial intelligence Marco Cadoli |
| title_full_unstemmed | Tractable reasoning in artificial intelligence Marco Cadoli |
| title_short | Tractable reasoning in artificial intelligence |
| title_sort | tractable reasoning in artificial intelligence |
| topic | Approximation, Théorie de l' Approximation, Théorie de l' ram Argumentation - Informatique Comlpexité de calcul (Informatique) ram Complexité de calcul (Informatique) Complexité de calcul (informatique) ram Inteligencia artificial larpcal Intelligence artificielle Intelligence artificielle ram Intellligence Artificielle ram Kunstmatige intelligentie gtt Raisonnement ram Redeneren gtt logique inriac raisonnement approximatif inriac raisonnement minimal inriac raisonnement inriac théorie connaissance inriac Datenverarbeitung Künstliche Intelligenz Artificial intelligence Reasoning -- Data processing Computational complexity Approximation theory Approximatives Schließen (DE-588)4231005-2 gnd Wissensrepräsentation (DE-588)4049534-6 gnd |
| topic_facet | Approximation, Théorie de l' Argumentation - Informatique Comlpexité de calcul (Informatique) Complexité de calcul (Informatique) Complexité de calcul (informatique) Inteligencia artificial Intelligence artificielle Intellligence Artificielle Kunstmatige intelligentie Raisonnement Redeneren logique raisonnement approximatif raisonnement minimal raisonnement théorie connaissance Datenverarbeitung Künstliche Intelligenz Artificial intelligence Reasoning -- Data processing Computational complexity Approximation theory Approximatives Schließen Wissensrepräsentation |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006785700&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT cadolimarco tractablereasoninginartificialintelligence |