7a7ad1699ee30f16bad4c109b0185827efb32dc4
[ker1415-1.git] / report / report.out
1 \BOOKMARK [1][-]{section.1}{Assignment 1-1}{}
2 \BOOKMARK [2][-]{subsection.1.1}{Part 1: Modelling Sokoban}{section.1}
3 \BOOKMARK [3][-]{subsubsection.1.1.1}{Task 1: Knowledge base}{subsection.1.1}
4 \BOOKMARK [3][-]{subsubsection.1.1.2}{Task 2: Actions}{subsection.1.1}
5 \BOOKMARK [2][-]{subsection.1.2}{Part 2: Implementation}{section.1}
6 \BOOKMARK [3][-]{subsubsection.1.2.1}{Task 3: Translate Axioms}{subsection.1.2}
7 \BOOKMARK [3][-]{subsubsection.1.2.2}{Task 4: The Planning Problem in Figure 1}{subsection.1.2}
8 \BOOKMARK [3][-]{subsubsection.1.2.3}{Task 5: Crates go to Any Goal Location}{subsection.1.2}
9 \BOOKMARK [3][-]{subsubsection.1.2.4}{Task 6: Inverse Problem}{subsection.1.2}
10 \BOOKMARK [2][-]{subsection.1.3}{Part 3: Extending the domain}{section.1}
11 \BOOKMARK [3][-]{subsubsection.1.3.1}{Task 7: Unlocking the Crates}{subsection.1.3}
12 \BOOKMARK [2][-]{subsection.1.4}{Part 4: General questions}{section.1}
13 \BOOKMARK [3][-]{subsubsection.1.4.1}{Task 10: Sitcalc expressivity}{subsection.1.4}
14 \BOOKMARK [3][-]{subsubsection.1.4.2}{Task 11: Related work}{subsection.1.4}
15 \BOOKMARK [1][-]{section.2}{Assignment 1-2}{}
16 \BOOKMARK [2][-]{subsection.2.1}{Implementation of the hitting-set algorithm}{section.2}
17 \BOOKMARK [3][-]{subsubsection.2.1.1}{Task 12: Generate conflict}{subsection.2.1}
18 \BOOKMARK [3][-]{subsubsection.2.1.2}{Task 13: Define your data structure}{subsection.2.1}
19 \BOOKMARK [3][-]{subsubsection.2.1.3}{Task 14: Implementation}{subsection.2.1}