-
Notifications
You must be signed in to change notification settings - Fork 1
/
summary.tex
97 lines (94 loc) · 2.54 KB
/
summary.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
% ----------------------------------------------------------------------
\begin{frame}<0>{Easy ASP}
\vfill
\begin{itemize}
\item
The answer sets of an easy logic program \\ are the result of applying its rules in order
\bigskip
\item
A rule is applied in order if for every predicate in its body \\
there are no rules with that predicate in the head left to be applied
%\item
%As long as the rules are applied in order, \\
%the result is independent of the specific order
\bigskip
\item
Sets of recursive rules are considered as a single rule \\
that is applied repeatedly until nothing changes
\bigskip
\item
Negative recursion is not allowed
\end{itemize}
\vfill
\end{frame}
% ----------------------------------------------------------------------
\begin{frame}<0>[label=ezasp:summary]{Easy ASP}
%
% starts at step 10
%
\vfill
\begin{itemize}
%
\uncover<10->{
\item
The \alert<10,50,61->{answer sets} of an easy logic program \\ are the result of \alert<11>{applying} its rules \alert<12>{in order}
%
\uncover<11->{
\bigskip
\item
The \alert<11,21,50,61->{application} of choice, normal and constraint rules\\
generates, extends and eliminates answer sets
}
%
\uncover<12->{
\bigskip
\item
A rule is applied \alert<12,50,61->{in order} if for every \alt<-20>{atom}{\alert<21>{predicate}} in its body \\
there are no rules with that \alt<-20>{atom}{\alert<21>{predicate}} in the head left to be applied
}
}
%\alt<10-29>{
%\uncover<13->{
%\bigskip
%\item
%The result is \alert{independent} of the specific order \\
%as long as the rules are applied in order
%}
%}{
%
\visible<30->{\uncover<31->{
\bigskip
\item
Sets of \alert<31,50,61->{recursive rules} are considered as a single rule \\
that is applied repeatedly until nothing changes%
\only<61->{\visible<62->{:\\
\alert<62>{first choice rules, then iterating over normal rules, and so on\ldots}}}
}}
%}
%
\visible<40,41,50->{\uncover<41,50->{
\bigskip
\item
\alert<41,50,61->{Negative recursion} is not allowed
}}
\end{itemize}
\vfill
\begin{center}
\begin{tikzpicture}[remember picture,overlay]
\only<13,20-21>{
\node at (0,2)
{\resizebox{0.40\textwidth}{!}{{\alert{\textbf{Write the rules in order}}}}};
}
\only<30-39>{
\node[rotate=0] at (0,0.75)
{\resizebox{0.40\textwidth}{!}{{\alert{\textbf{Write the rules in order}}}}};
}
\only<40-51,61->{
\node[rotate=0] at (3.25,0.75)
{\resizebox{0.40\textwidth}{!}{{\alert{\textbf{Write the rules in order}}}}};
}
%%%%\only<5>{\node at (9.25,2.6) {\Large{\textbf{\alert{Later}}}};}
%%%%\only<6-7>{\node at (9.65,2.6) {\Large{\textbf{\alert{Not easy}}}};}
\end{tikzpicture}
\end{center}
\end{frame}