%PDF-1.5
%
4 0 obj
<< /S /GoTo /D (section*.5) >>
endobj
7 0 obj
(Contents)
endobj
8 0 obj
<< /S /GoTo /D (chapter.1) >>
endobj
11 0 obj
(Introduction)
endobj
12 0 obj
<< /S /GoTo /D (section.1.1) >>
endobj
15 0 obj
(Motivation and Problem Statement)
endobj
16 0 obj
<< /S /GoTo /D (section.1.2) >>
endobj
19 0 obj
(Main Results)
endobj
20 0 obj
<< /S /GoTo /D (section.1.3) >>
endobj
23 0 obj
(Structure of the Thesis)
endobj
24 0 obj
<< /S /GoTo /D (section.1.4) >>
endobj
27 0 obj
(Publications)
endobj
28 0 obj
<< /S /GoTo /D (chapter.2) >>
endobj
31 0 obj
(Preliminaries)
endobj
32 0 obj
<< /S /GoTo /D (section.2.1) >>
endobj
35 0 obj
(Trees, Forests, Graphs)
endobj
36 0 obj
<< /S /GoTo /D (section.2.2) >>
endobj
39 0 obj
(Answer Set Programming)
endobj
40 0 obj
<< /S /GoTo /D (subsection.2.2.1) >>
endobj
43 0 obj
(Syntax)
endobj
44 0 obj
<< /S /GoTo /D (subsection.2.2.2) >>
endobj
47 0 obj
(Semantics)
endobj
48 0 obj
<< /S /GoTo /D (section.2.3) >>
endobj
51 0 obj
(Open Answer Set Programming)
endobj
52 0 obj
<< /S /GoTo /D (section.2.4) >>
endobj
55 0 obj
(Conceptual and Extended/Local Forest Logic Programs)
endobj
56 0 obj
<< /S /GoTo /D (subsection.2.4.1) >>
endobj
59 0 obj
(CoLPs and FoLPs)
endobj
60 0 obj
<< /S /GoTo /D (subsection.2.4.2) >>
endobj
63 0 obj
(Local and Acyclic FoLPs)
endobj
64 0 obj
<< /S /GoTo /D (subsection.2.4.3) >>
endobj
67 0 obj
(Tree and Forest Model Property)
endobj
68 0 obj
<< /S /GoTo /D (chapter.3) >>
endobj
71 0 obj
(Tableau Algorithm for Reasoning with Forest Logic Programs)
endobj
72 0 obj
<< /S /GoTo /D (section.3.1) >>
endobj
75 0 obj
(Completion Structures)
endobj
76 0 obj
<< /S /GoTo /D (section.3.2) >>
endobj
79 0 obj
(Expansion Rules)
endobj
80 0 obj
<< /S /GoTo /D (subsection.3.2.1) >>
endobj
83 0 obj
(Expanding a Unary Positive Predicate)
endobj
84 0 obj
<< /S /GoTo /D (subsection.3.2.2) >>
endobj
87 0 obj
(Choosing a Unary Predicate)
endobj
88 0 obj
<< /S /GoTo /D (subsection.3.2.3) >>
endobj
91 0 obj
(Expanding a Unary Negative Predicate)
endobj
92 0 obj
<< /S /GoTo /D (subsection.3.2.4) >>
endobj
95 0 obj
(Expanding a Binary Positive Predicate)
endobj
96 0 obj
<< /S /GoTo /D (subsection.3.2.5) >>
endobj
99 0 obj
(Expanding a Binary Negative Predicate)
endobj
100 0 obj
<< /S /GoTo /D (subsection.3.2.6) >>
endobj
103 0 obj
(Choosing a Binary Predicate)
endobj
104 0 obj
<< /S /GoTo /D (section.3.3) >>
endobj
107 0 obj
(Applicability Rules)
endobj
108 0 obj
<< /S /GoTo /D (subsection.3.3.1) >>
endobj
111 0 obj
(Saturation)
endobj
112 0 obj
<< /S /GoTo /D (subsection.3.3.2) >>
endobj
115 0 obj
(Blocking)
endobj
116 0 obj
<< /S /GoTo /D (subsection.3.3.3) >>
endobj
119 0 obj
(Redundancy)
endobj
120 0 obj
<< /S /GoTo /D (subsection.3.3.4) >>
endobj
123 0 obj
(Contradictory Completion Structures)
endobj
124 0 obj
<< /S /GoTo /D (subsection.3.3.5) >>
endobj
127 0 obj
(Circular Completion Structures)
endobj
128 0 obj
<< /S /GoTo /D (section.3.4) >>
endobj
131 0 obj
(Overview of A1)
endobj
132 0 obj
<< /S /GoTo /D (section.3.5) >>
endobj
135 0 obj
(Termination, Soundness, and Completeness)
endobj
136 0 obj
<< /S /GoTo /D (subsection.3.5.1) >>
endobj
139 0 obj
(Termination of A1)
endobj
140 0 obj
<< /S /GoTo /D (subsection.3.5.2) >>
endobj
143 0 obj
(Soundness of A1)
endobj
144 0 obj
<< /S /GoTo /D (subsection.3.5.3) >>
endobj
147 0 obj
(Completeness of A1)
endobj
148 0 obj
<< /S /GoTo /D (subsection.3.5.4) >>
endobj
151 0 obj
(Complexity Analysis)
endobj
152 0 obj
<< /S /GoTo /D (subsection.3.5.5) >>
endobj
155 0 obj
(FoLPs Have the Bounded Finite Model Property)
endobj
156 0 obj
<< /S /GoTo /D (subsection.3.5.6) >>
endobj
159 0 obj
(Reduction to Answer Set Programming Using the Bounded Finite Model Property)
endobj
160 0 obj
<< /S /GoTo /D (section.3.6) >>
endobj
163 0 obj
(Illustration of the Algorithm)
endobj
164 0 obj
<< /S /GoTo /D (section.3.7) >>
endobj
167 0 obj
(Discussion and Related Work)
endobj
168 0 obj
<< /S /GoTo /D (subsection.3.7.1) >>
endobj
171 0 obj
(Connection with DL Tableau Algorithms)
endobj
172 0 obj
<< /S /GoTo /D (subsection.3.7.2) >>
endobj
175 0 obj
(Reflection on Using Standard ASP Reasoning vs. the Tableau Method)
endobj
176 0 obj
<< /S /GoTo /D (subsection.3.7.3) >>
endobj
179 0 obj
(Connection with ASP Reasoning Procedures)
endobj
180 0 obj
<< /S /GoTo /D (chapter.4) >>
endobj
183 0 obj
(Knowledge Compilation Technique for Reasoning with FoLPs)
endobj
184 0 obj
<< /S /GoTo /D (section.4.1) >>
endobj
187 0 obj
(Unit Completion Structures)
endobj
188 0 obj
<< /S /GoTo /D (section.4.2) >>
endobj
191 0 obj
(Computing the Set of Unit Completion Structures: Complexity Considerations)
endobj
192 0 obj
<< /S /GoTo /D (section.4.3) >>
endobj
195 0 obj
(Redundant Unit Completion Structures)
endobj
196 0 obj
<< /S /GoTo /D (section.4.4) >>
endobj
199 0 obj
(Reasoning with FoLPs Using Unit Completion Structures)
endobj
200 0 obj
<< /S /GoTo /D (section.4.5) >>
endobj
203 0 obj
(Discussion and Related Work)
endobj
204 0 obj
<< /S /GoTo /D (subsection.4.5.1) >>
endobj
207 0 obj
(Related Work)
endobj
208 0 obj
<< /S /GoTo /D (chapter.5) >>
endobj
211 0 obj
(Optimized Tableau Algorithm for Reasoning with Forest Logic Programs)
endobj
212 0 obj
<< /S /GoTo /D (section.5.1) >>
endobj
215 0 obj
(New Blocking Rule)
endobj
216 0 obj
<< /S /GoTo /D (section.5.2) >>
endobj
219 0 obj
(Revisiting Redundancy)
endobj
220 0 obj
<< /S /GoTo /D (section.5.3) >>
endobj
223 0 obj
(Caching)
endobj
224 0 obj
<< /S /GoTo /D (section.5.4) >>
endobj
227 0 obj
(Overview of A3)
endobj
228 0 obj
<< /S /GoTo /D (section.5.5) >>
endobj
231 0 obj
(Termination and Complexity)
endobj
232 0 obj
<< /S /GoTo /D (section.5.6) >>
endobj
235 0 obj
(Soundness)
endobj
236 0 obj
<< /S /GoTo /D (section.5.7) >>
endobj
239 0 obj
(Completeness)
endobj
240 0 obj
<< /S /GoTo /D (section.5.8) >>
endobj
243 0 obj
(Simple Reasoning with FoLPs: The Case of Simple Forest Logic Programs)
endobj
244 0 obj
<< /S /GoTo /D (subsection.5.8.1) >>
endobj
247 0 obj
(Simple FoLPs: Definitions)
endobj
248 0 obj
<< /S /GoTo /D (subsection.5.8.2) >>
endobj
251 0 obj
(Reasoning with Simple FoLPs)
endobj
252 0 obj
<< /S /GoTo /D (section.5.9) >>
endobj
255 0 obj
(Discussion and Related Work)
endobj
256 0 obj
<< /S /GoTo /D (chapter.6) >>
endobj
259 0 obj
(Worst-Case Optimal Reasoning with Conceptual Logic Programs and Simple Forest Logic Programs)
endobj
260 0 obj
<< /S /GoTo /D (section.6.1) >>
endobj
263 0 obj
(AND/OR Completion Structures)
endobj
264 0 obj
<< /S /GoTo /D (section.6.2) >>
endobj
267 0 obj
(Worst-Case Optimal Reasoning with Conceptual Logic Programs)
endobj
268 0 obj
<< /S /GoTo /D (subsection.6.2.1) >>
endobj
271 0 obj
(Evolving an AND/OR Completion Structure for a COLP)
endobj
272 0 obj
<< /S /GoTo /D (subsection.6.2.2) >>
endobj
275 0 obj
(Termination Conditions: Blocking, Caching, and Redundancy)
endobj
276 0 obj
<< /S /GoTo /D (subsubsection.6.2.2.1) >>
endobj
279 0 obj
(Deterministic Blocking Rule)
endobj
280 0 obj
<< /S /GoTo /D (subsubsection.6.2.2.2) >>
endobj
283 0 obj
(Deterministic Redundancy Rule)
endobj
284 0 obj
<< /S /GoTo /D (subsubsection.6.2.2.3) >>
endobj
287 0 obj
(Deterministic Caching Rule)
endobj
288 0 obj
<< /S /GoTo /D (subsubsection.6.2.2.4) >>
endobj
291 0 obj
(Complete AND/OR Completion Structures)
endobj
292 0 obj
<< /S /GoTo /D (subsection.6.2.3) >>
endobj
295 0 obj
(Evaluation of an AND/OR Completion Structure)
endobj
296 0 obj
<< /S /GoTo /D (subsection.6.2.4) >>
endobj
299 0 obj
(Termination and Complexity)
endobj
300 0 obj
<< /S /GoTo /D (subsubsection.6.2.4.1) >>
endobj
303 0 obj
(Computation of Complete AND/OR Completion Structures)
endobj
304 0 obj
<< /S /GoTo /D (subsubsection.6.2.4.2) >>
endobj
307 0 obj
(Complexity Analysis for the Evaluation Procedure)
endobj
308 0 obj
<< /S /GoTo /D (subsection.6.2.5) >>
endobj
311 0 obj
(Soundness and Completeness)
endobj
312 0 obj
<< /S /GoTo /D (subsubsection.6.2.5.1) >>
endobj
315 0 obj
(Soundness)
endobj
316 0 obj
<< /S /GoTo /D (subsubsection.6.2.5.2) >>
endobj
319 0 obj
(Completeness)
endobj
320 0 obj
<< /S /GoTo /D (section.6.3) >>
endobj
323 0 obj
(Worst-Case Optimal Reasoning with Simple Forest Logic Programs)
endobj
324 0 obj
<< /S /GoTo /D (subsection.6.3.1) >>
endobj
327 0 obj
(Evolving AND/OR Completion Structure for Simple FoLPs )
endobj
328 0 obj
<< /S /GoTo /D (subsection.6.3.2) >>
endobj
331 0 obj
(Anywhere Blocking for Deterministic Reasoning with Simple FoLPs)
endobj
332 0 obj
<< /S /GoTo /D (subsection.6.3.3) >>
endobj
335 0 obj
(Evaluating AND/OR Completion Structures for Simple FoLPs)
endobj
336 0 obj
<< /S /GoTo /D (subsection.6.3.4) >>
endobj
339 0 obj
(Termination and Complexity)
endobj
340 0 obj
<< /S /GoTo /D (section.6.4) >>
endobj
343 0 obj
(Discussion and Related Work)
endobj
344 0 obj
<< /S /GoTo /D (chapter.7) >>
endobj
347 0 obj
(Summary and Future Work)
endobj
348 0 obj
<< /S /GoTo /D (section.7.1) >>
endobj
351 0 obj
(Further Related Work)
endobj
352 0 obj
<< /S /GoTo /D (subsection.7.1.1) >>
endobj
355 0 obj
(Loosely-coupled Approaches)
endobj
356 0 obj
<< /S /GoTo /D (subsection.7.1.2) >>
endobj
359 0 obj
(Tightly-coupled Approaches)
endobj
360 0 obj
<< /S /GoTo /D (subsection.7.1.3) >>
endobj
363 0 obj
(Integrating Approaches)
endobj
364 0 obj
<< /S /GoTo /D (section.7.2) >>
endobj
367 0 obj
(Summary)
endobj
368 0 obj
<< /S /GoTo /D (section.7.3) >>
endobj
371 0 obj
(Future Work)
endobj
372 0 obj
<< /S /GoTo /D (section*.7) >>
endobj
375 0 obj
(Bibliography)
endobj
376 0 obj
<< /S /GoTo /D [377 0 R /Fit] >>
endobj
381 0 obj <<
/Length 978
/Filter /FlateDecode
>>
stream
xڥUr6+$5 Kb+iX,,`8Ɇ|}/Вl%mܱxsR"1)a[ZX(g_Oa[*#a9W
Bw^?/krlE4? ˚v>'=:nPTBr(%AOD@4#M3Ţ8ƫl%BH#
P40|>xMլ2U:m!kW20G!PmrNvչXV+F*^9-r_eF4ET
Jh붋.Tqj;q8qU\&rF3ND(uȵP
ĸ\m{?]LԺAdXoҢpW3&X
jNs͞ b3ΏeyUP5.~*MBa)-!Z݇M|;ddfԎV ݁z!(|6nsAnk!eZ /.mxUYdvI~9!6(*F%AI~o1^svzenk) J8|Vl@Dqn&7~/'E8h/̖ Yic[D m
8 HI^!W؈F`5{dϙ+ 3XRZF?$#^`y%~wz$r7SbI@)C:
N
).JDr%-A=uBkS5ABE?q/~cJ2 ;l
(ZlRdG
egsCVhSTהS=H6t&7_7|M߀\>&)Dϳ(XJl=_l6r0lw(%q*mOB
endstream
endobj
377 0 obj <<
/Type /Page
/Contents 381 0 R
/Resources 380 0 R
/MediaBox [0 0 595.276 841.89]
/Parent 387 0 R
>> endobj
378 0 obj <<
/Type /XObject
/Subtype /Form
/FormType 1
/PTEX.FileName (D:/svn_vienna/final/figures/titlepage/dokumentenkopf__klein.pdf)
/PTEX.PageNumber 1
/PTEX.InfoDict 388 0 R
/BBox [0 0 511 47]
/Resources <<
/ProcSet [ /PDF ]
/ExtGState <<
/Gs1 389 0 R
/Gs2 390 0 R
>>>>
/Length 219
/Filter /FlateDecode
>>
stream
x]PIn1|ś^sN} iT1")Yw\q+0UJ{;~py{>x`\}N?1
on0iļQ$cʮ^20Y8JkȊ`T
M51τH:CyïLst `}f5gI}lu/![8
endstream
endobj
388 0 obj
<<
/Producer 391 0 R
/CreationDate 392 0 R
/ModDate 392 0 R
>>
endobj
389 0 obj
<<
/Type /ExtGState
/SM 0.02
>>
endobj
390 0 obj
<<
/Type /ExtGState
/OPM 1
>>
endobj
391 0 obj
(Mac OS X 10.6.2 Quartz PDFContext)
endobj
392 0 obj
(D:20100211143658Z00'00')
endobj
379 0 obj <<
/Type /XObject
/Subtype /Form
/FormType 1
/PTEX.FileName (D:/svn_vienna/final/figures/titlepage/INF_Logo_typo_grau.pdf)
/PTEX.PageNumber 1
/PTEX.InfoDict 393 0 R
/BBox [0 0 171 46]
/Resources <<
/ProcSet [ /PDF ]
/ExtGState <<
/Gs1 394 0 R
/Gs2 395 0 R
>>>>
/Length 5748
/Filter /FlateDecode
>>
stream
xmI,Inq
_ky8AkxP'}$#S(U64NFa|02{k?o[f[=k
=W5\{?φ},۰2i[:|obf㺶eƶzm|oaޖcI ^2äV(?b!|oCZYU]8W%])$ \Ƃj!0BSfTYK\uꃿa?9rWǶ6%>ap7!T}tb^'=/5Za Zغ5,{^yrk$0,~l?0^Y{_
/7ɒ:er:BW+F$)_)__9Vp`el 1Ɇ 5n%
3H
1僊`oZo¦}Pܤkb:vt_#
FnBj
y.ZOhhqЁX=}ܥrݴ{xFN3o=5u7D!=_OcgTv4ك3ttPi(U?H