ABCDEFGHIJKLM
1
TimestampSection
Page Number
Line Number
Text in book wasText should beYour name / email (optional)
2
6/2/2020 10:05:124.1115+9
else current <- next only with probability e^-ΔE/T
else current <- next only with probability e^ΔE/T
Noah Topper/noah.topper@gmail.com
3
6/4/2020 22:18:021.2.18+9Immanuel Kant, in 1875 proposed
Immanuel Kant, in 1785 proposed [https://en.wikipedia.org/wiki/Deontological_ethics#cite_note-transition-10]
Darius Bacon withal@gmail.com
4
6/7/2020 23:19:054.4.112714
then the belief-state problem has 2^N belief states
then the belief-state problem has 2^N - 1 belief states (because the empty belief state {} is not valid)
andrea.rapuzzi@a-sign.it
5
6/10/2020 0:58:42
4. Bibliographical Notes
14316The the Baldwin effectThe Baldwin effectandrea.rapuzzi@a-sign.it
6
6/10/2020 13:55:1313.5.1451-5Equation (13.16)Equation (13.15)Darius Bacon withal@gmail.com
7
6/11/2020 22:58:275.416221becomes 28/26becomes 28/36andrea.rapuzzi@a-sign.it
8
6/19/2020 2:57:053.0 (Intro)63+1may need to to planmay need to planVictor Khaustov
9
6/24/2020 0:40:4813.5499+2The.smaller tablesThe smaller tablesThomas Hickey
10
6/26/2020 0:28:467.5.423116The agenda keeps track of symbolsThe queue keeps track of symbolsandrea.rapuzzi@a-sign.it
11
6/27/2020 13:44:08Prefaceix+18Section 15.3, Programs as Probability ModelsSection 15.4, Programs as Probability ModelsBora Eryilmaz
12
6/27/2020 13:46:22Prefaceix+21Deep Learning for Natural Language
Deep Learning for Natural Language Processing
Bora Eryilmaz
13
7/6/2020 13:09:3213.1414+6
B E P(A=true|B,E)
t t .70
t f .01
f t .70
f f .01
B E P(A=true|B,E)
t t .95
t f .94
f t .29
f f .001
Noah Topper/noah.topper@gmail.com
14
7/7/2020 13:09:4227.1.2982-8examine heir ownexamine their ownStuart Russell
15
7/7/2020 14:16:5513.2.242110¶ (in figure caption)P (boldface)Stuart Russell
16
7/7/2020 14:39:2313.2415100.01 .... 0.006280.001 .... 0.000628Stuart Russell
17
7/9/2020 0:27:4817.35839switchesswitchStuart Russell
18
7/10/2020 18:01:4217.3.35864chooses chooseschoosesStuart Russell
19
7/14/2020 0:16:053 Summary105+15using to an evaluation functionusing an evaluation function
James J. Buchanan/jjbuchanan42@gmail.com
20
7/18/2020 20:32:204.4.2131+1[B, Dirty]
[B, Clean]
[B, Dirty]
[A, Dirty]
[B, Clean]
[R, Dirty]
[R, Clean]
[R, Dirty]
[L, Dirty]
[R, Clean]
James J. Buchanan/jjbuchanan42@gmail.com
21
7/18/2020 21:50:084.3.2125+7[state] + path][state] + path
James J. Buchanan/jjbuchanan42@gmail.com
22
7/18/2020 21:52:204.3.2125+8[action] + plan][action] + plan
James J. Buchanan/jjbuchanan42@gmail.com
23
7/18/2020 21:57:554.3.2125+5Is-Cycle(path)Is-Cycle(state, path)
James J. Buchanan/jjbuchanan42@gmail.com
24
7/18/2020 23:04:224.5.11135-2top statetop state space
James J. Buchanan/jjbuchanan42@gmail.com
25
7/19/2020 15:54:1824.4.1869-13In theory, and informationIn theory, any informationDarius Bacon
26
7/19/2020 15:55:0124.4.1869-2(are addedare addedDarius Bacon
27
7/19/2020 19:21:424.5.2137+2s, a, ...
persistent: result, ...
persistent: s, a, ...
result, ...
James J. Buchanan/jjbuchanan42@gmail.com
28
7/19/2020 20:04:464.5.3140+2s, a, ...
persistent: result, ...
persistent: s, a, ...
result, ...
James J. Buchanan/jjbuchanan42@gmail.com
29
7/20/2020 3:09:034.5.2137+10
add s to the front of unbacktracked[s']
if (...) then
if (...) then return stop
else a <- (...)
add s to the end of unbacktracked[s']
if (...) then
if (...) then return stop
a <- (...)
s' <- null
James J. Buchanan/jjbuchanan42@gmail.com
30
7/20/2020 19:12:0521.7.2781-5mycardialmyocardialDarius Bacon
31
7/21/2020 11:59:2513.5450+20formally.formally?Darius Bacon
32
7/21/2020 13:07:1613.5.1452+14do(S=true)do(S=true))Darius Bacon
33
7/21/2020 13:09:1113.5.1452-2do(Xj=xjk)
do(Xj=xjk)) (see also eq. 13.19 for another missing paren)
Darius Bacon
34
7/22/2020 2:01:355.2.1150+7v ← -∞v, move ← -∞, null (and similarly on line +15)
James J. Buchanan/jjbuchanan42@gmail.com
35
7/26/2020 9:34:1524.2.2862-3posiblepossibleDarius Bacon
36
7/26/2020 9:41:1017.1.4571-2three steps
two steps [& related surrounding changes like s/t+3/t+2/ on the next line and next page; or is it Figure 17.4 that's wrong?]
Darius Bacon
37
7/26/2020 18:20:5624.6875-12such WORD2VECsuch as WORD2VECDarius Bacon
38
7/27/2020 12:27:063.2.167+6
"...can be in either of two cells, and each call can either contain dirt or not..."
"...can be in either of two cells, and each *cell* can either contain dirt or not..."
joshuareagan@gmail.com
39
7/27/2020 23:34:4827.1.1982+4criticizecriticized
James J. Buchanan/jjbuchanan42@gmail.com
40
7/30/2020 20:05:275.5164-3White has rolledBlack has rolled
James J. Buchanan/jjbuchanan42@gmail.com
41
8/9/2020 9:37:458.4.2275+2function Arity(predicate Arity(Filippo Bindelli
42
8/10/2020 0:48:339.bib31127consistentdataspaceconsistent dataspaceandrea.rapuzzi@a-sign.it
43
8/11/2020 20:36:5513.2.44250
There is no arrow from MakeModel to Theft on Figure 13.9
The text on page 426 states: "What are the causal factors leading to Theft? The MakeModel is certainly important..."
Bora Eryilmaz
44
8/12/2020 6:36:109.3.3291+13to toto
Filippo Bindelli / filippo.bindelli@gmail.com
45
8/17/2020 3:07:3911.2.3351-1but modern the efficiencybut the efficiency
Filippo Bindelli / filippo.bindelli@gmail.com
46
8/18/2020 7:58:0611.bib384+17complexity of ofcomplexity of
Filippo Bindelli / filippo.bindelli@gmail.com
47
8/18/2020 21:49:191.2.71621maximize a cost functionminimize a cost functiondavid.conner@cnu.edu
48
8/22/2020 2:47:08A.31027-15instead measure measureinstead measure
Filippo Bindelli / filippo.bindelli@gmail.com
49
8/22/2020 2:50:13A.31027-14the the widththe width
Filippo Bindelli / filippo.bindelli@gmail.com
50
8/23/2020 18:05:4416.7.2555-1epectsexpectsBora Eryilmaz
51
8/23/2020 18:11:5216528-16Section 16.6 hows howSection 16.6 shows howBora Eryilmaz
52
8/24/2020 18:56:515.4161+18
chooses moves first for one player, than for the other
chooses moves first for one player, then for the other
Andy Gaskell / andy@zubago.com
53
8/27/2020 11:55:221.317+11Ed Feigenbaum and Raj Reddy (1994)
Allen Newell and Herbert Simon (1975) for symbolic models of problem solving and human cognition [[or something]]; Ed Feigenbaum and Raj Reddy (1994)
Stuart Russell
54
8/27/2020 14:48:2117.5591
Figure 17.15 (a) does not match the hyperplanes for b\alpha_stay and b\alpha_go described on page 592.
The lines in Figure 17.15 (a) should be 0.8b+0.1 for stay and -0.8b+0.9 for go where b is a belief of B if alpha_stay and alpha_go on page 592 are correct. If the plots are correct, the reward for the current state should be included to compute alpha. In this case, alpha_stay(A)=0.1, alpha_stay(B)=1.9, alpha_go(A)=0.9, and alpha_go(B)=1.1.
Takeshi Takahashi / ttakahashi07@gmail.com
55
9/11/2020 0:00:004.4.2130+8its location from then on .its location from then on.Taylor Martin taylor@martin.dev
56
9/12/2020 7:53:453.3.173+11reached[s] <- child
add child to frontier
if s is in reached and reached[s] is in frontier then remove it
reached[s] <- child
add child to frontier
Ed Durfee / durfee@umich.edu
57
9/13/2020 15:58:0717.5593+3R(s)R(s,a,s')Stuart Russell
58
9/13/2020 16:01:1817.55936just the empty plan [], with α[](s)= R(s)
plans [a] for a in A, with α[a](s)= [insert formula for one-step expected reward]
Stuart Russell
59
9/14/2020 4:06:025.2.1150+2player←game.TO-MOVE(state)
persistent: player
player←game.TO-MOVE(state)
#note page 154 would also have the same problem. I think this is the correct use of persistent, but it could also be passed into Max-Value(...) and Min-Value(...) on each call.
Taylor Martin taylor@martin.dev
60
9/15/2020 2:27:331.1.33-15provides only for statementsprovides only four statementsVictor Khaustov
61
9/17/2020 15:47:355.2154-11v ← +∞v, move ← +∞, null (and similarly on line -21)
James J. Buchanan/jjbuchanan42@gmail.com
62
9/17/2020 15:53:134.4131-3[A, Clean] [B, Dirty] [B, Clean]
[L, Clean] [R, Dirty] [R, Clean]
(and similarly on page 132 line +6, and page 133 line +1)
James J. Buchanan/jjbuchanan42@gmail.com
63
9/17/2020 17:15:1219.2653-2and han h
James J. Buchanan/jjbuchanan42@gmail.com
64
9/18/2020 2:16:167.6.2235+7laboriou,laborious,Taylor Martin taylor@martin.dev
65
9/19/2020 17:52:1110.332326and\land [logical and symbol]Stuart Russell
66
9/24/2020 7:39:2013.1412-3often oftenoften
Bindelli Filippo / filippo.bindelli@gmail.com
67
9/25/2020 17:35:486.3192+19ORDER-DOMAIN-VALUES, implement
ORDER-DOMAIN-VALUES implement [no comma]
James J. Buchanan/jjbuchanan42@gmail.com
68
9/25/2020 18:42:526.3.1193-7
In fact, once SA is chosen, applying the degree heuristic solves the problem without any false steps - you can choose any consistent color at each choice point and still arrive at a solution with no backtracking.
[This is not true. For example, following the degree heuristic, we must start by assigning SA, then we could choose to assign NT, after which we must assign NSW. One set of consistent colors for these assignments is SA=Red, NT=Green, and NSW=Blue, but this results in failure when we try to assign Q.]
James J. Buchanan/jjbuchanan42@gmail.com
69
9/26/2020 0:34:1918.26190
[Figure 18.4 shows above then up down parts of extensive form]
[Figure 18.4 shows above and below and also up and down parts of extensive form (below, down) is mentioned as a sequence in the text that follows]
joshua.cole@joshuacol.es
70
9/26/2020 2:54:4513.2.4426+3have to inferredhave to be inferred
Bindelli Filippo / filippo.bindelli@gmail.com
71
9/26/2020 20:49:337.4.4221-6false }))false}))
James J. Buchanan/jjbuchanan42@gmail.com
72
9/26/2020 20:50:587.4.4221-1proposition logic;propositional logic;
James J. Buchanan/jjbuchanan42@gmail.com
73
9/27/2020 12:10:20
Bibliographical and Historical Notes
456-15also alsois also
Bindelli Filippo / filippo.bindelli@gmail.com
74
10/3/2020 16:11:11Prefaceix+1
[No explanation of the picture of a city, just below Kasparov on the front cover]
[Describe what this picture depicts, and its relevance to AI]
James J. Buchanan/jjbuchanan42@gmail.com
75
10/4/2020 7:22:4114.3.2477+5The size of each disk...--there are no disks in the figure--
Bindelli Filippo / filippo.bindelli@gmail.com
76
10/4/2020 22:49:058.1.1252-12
The famous Sapir–Whorf hypothesis Whorf (1956) claims
The famous Sapir–Whorf hypothesis (Whorf, 1956) claims
James J. Buchanan/jjbuchanan42@gmail.com
77
10/4/2020 22:50:478.1.1253-19in an functionalin a functionalJames J. Buchanan
78
10/5/2020 17:45:378.3.1266+22xthatx that
James J. Buchanan/jjbuchanan42@gmail.com
79
10/5/2020 20:35:168.4.2275+22∀g Gate(g) ∧ k = Type(g)
∀g,k Gate(g) ∧ k = Type(g) [and similarly on line -6]
James J. Buchanan/jjbuchanan42@gmail.com
80
10/6/2020 21:09:169.1.1281-4
there is a problem when the knowledge base includes a function symbol, the set of possible ground-term substitutions is infinite!
there is a problem: when the knowledge base includes a function symbol, the set of possible ground-term substitutions is infinite!
James J. Buchanan/jjbuchanan42@gmail.com
81
10/8/2020 14:14:533.2.168
if we apply Left to the start state in Figure 3.3, the resulting state has the 5 and the blank switched.
if we apply Left to the start state in Figure 3.3, the resulting state has the 6 and the blank switched.
Zenifer Cheruveettil
82
10/8/2020 16:43:499.3.3292-15But if there had been many rules describeBut if there had been many rules describing
James J. Buchanan/jjbuchanan42@gmail.com
83
10/8/2020 19:59:443.3.173+11
if s is not in reached or child.PATH-COST<reached[s].PATH-COST then
reached[s] <- child
add child to frontier
if s is not in reached or child.PATH-COST<reached[s].PATH-COST then
reached[s] <- child
replace the reached[s] in frontier with child
605499941@qq.com
84
10/10/2020 16:15:2510.3323-3Happens(e,t1,t3)) [...] ¬Initiated(f,t2,t4))Happens(e,t1,t3) [...] ¬Initiated(f,t2,t4)
James J. Buchanan/jjbuchanan42@gmail.com
85
10/11/2020 16:24:08
10. Bibliographical and Historical Notes
341+25"IS-A links" Bill"IS-A links." Bill
James J. Buchanan/jjbuchanan42@gmail.com
86
10/11/2020 16:29:06
10. Bibliographical and Historical Notes
342+6
Lifschitz (2001) discusses the application of answer set programming to planning.
[remove; duplicate of sentence on line +3 of same page]
James J. Buchanan/jjbuchanan42@gmail.com
87
10/12/2020 15:13:399.5.5307+15
Demodulation: For any terms x, y, and z, where z appears somewhere in literal mi and where UNIFY(x,z) = θ,
Demodulation: For any terms x, y, and z, where z appears somewhere in literal mi and where SUBST(θ,x) = z for some unifier θ,
[Otherwise, in line +18, SUB may not find any instances of SUBST(θ,x) in m1V...Vmn, resulting in either an error or just the trivial output m1V...Vmn. While the latter would technically be a sound inference, it goes against the spirit of the term "demodulation."]
James J. Buchanan/jjbuchanan42@gmail.com
88
10/12/2020 16:58:454.5.3140+9LRTA*-COST(s,b,result[s,b],H)LRTA*-COST(problem,s,b,result[s,b],H)
James J. Buchanan/jjbuchanan42@gmail.com
89
10/12/2020 17:35:517.6.1234+15{P=false})){P=false})
James J. Buchanan/jjbuchanan42@gmail.com
90
10/13/2020 7:48:50
4.1.1 Hill Climbing Search
123 and 124+14h=17. But actually h=16
h=16. In page 124, in figure 4.3 description also change to h=16.
Xavier Chelladurai xavier.c@christuniversity.in
91
10/13/2020 13:49:12
Please make
all-aima-errata.tar.gz accessible
100
You don't have permission to access /errata/all-aima-errata.tar.gz on this server.
Please make all-aima-errata.tar.gz accessible from the internet.
92
10/14/2020 17:16:3111.4.3361+2Black and gray arrows
Black and red arrows [and similarly on page 363, line +4]
James J. Buchanan/jjbuchanan42@gmail.com
93
10/14/2020 17:34:0111.4.3364+1
[line +1] [...] returns solution or fail
[line +4] if EMPTY?(frontier) then return fail
[line +16] frontier <- Insert(APPEND(prefix,sequence,suffix),frontier)
[line +1] [...] returns a solution or failure
[line +4] if IS-EMPTY(frontier) then return failure
[line +16] add APPEND(prefix,sequence,suffix) to frontier
[i.e. match the corresponding lines in Fig. 11.8]
James J. Buchanan/jjbuchanan42@gmail.com
94
10/14/2020 17:42:429.5.5307-15SUB( ... , SUBST( ... )SUB( ... , SUBST( ... ))
James J. Buchanan/jjbuchanan42@gmail.com
95
10/14/2020 18:11:329.5.5307+15
Demodulation: For any terms x, y, and z, where z appears somewhere in literal mi and where UNIFY(x,z) = θ ≠ failure, [in the corrected text posted online]
Demodulation: For any terms x, y, and z, where z appears somewhere in literal mi and where SUBST(θ,x) = z for some unifier θ,
[The corrected text online is fine for paramodulation, but still doesn't work here.
For example, say we're given F(A,y)=C and P(F(x,B)). Then we have UNIFY(F(A,y), F(x,B)) = θ = {x/A, y/B}, so by the preconditions given in the text, demodulation would ostensibly apply. But SUBST(θ,F(A,y)) = F(A,B), which appears nowhere in P(F(x,B)), resulting in a failure for SUB on line +18.]
James J. Buchanan/jjbuchanan42@gmail.com
96
10/15/2020 0:28:3911.5366+11
Percept( ... ,
... InView(x)
Percept( ... ,
... Open(can)
Percept( ... ,
... InView(x))
Percept( ... ,
... Open(can))
James J. Buchanan/jjbuchanan42@gmail.com
97
10/15/2020 17:20:0711.5.3372+7For example, Some branchesFor example, some branches
James J. Buchanan/jjbuchanan42@gmail.com
98
10/15/2020 17:46:4611.6.1375+3Inspectors(e2)Inspectors(2)
James J. Buchanan/jjbuchanan42@gmail.com
99
10/15/2020 17:55:3611.6.2377+6
[line +6] Grey rectangles represent time intervals
[line +8] portion of a gray rectangle
[line +6] Blue rectangles represent time intervals
[line +8] portion of a blue rectangle
James J. Buchanan/jjbuchanan42@gmail.com
100
10/16/2020 13:48:2822.2.3793-6
U^\pi(1,3)=0.88... so U^\pi(1,3) would be 0.92. Thus its current estimate of 0.84
U^\pi(1,3)=0.84... so U^\pi(1,3) would be 0.92. Thus its current estimate of 0.84
--or--
U^\pi(1,3)=0.88... so U^\pi(1,3) would be 0.92. Thus its current estimate of 0.88
Eric Fosler-Lussier (fosler@cse.ohio-state.edu)