just use the :continue 0 (ignore and rename i think) on the prompt when you get this error. ... <HR> <html><body> <tt> It turns out that Franz ships Allegro...
26
jan_gilbert_pearce@...
jan_gilbert_...
Oct 30, 2001 12:54 am
Hi There, I am a student at U Minnesota and I have loaded Russell's code for the 8-puzzle. I have the code and the utility functions loading fine on my...
27
bhami3@...
bhami3
Oct 30, 2001 6:18 am
I wish the book had an appendix defining all notation used. Different chapters use different notations from many branches of mathematics and logic, and the...
28
Mariano Buņirigo
mbunirigo
Oct 30, 2001 2:58 pm
I´ve done this excersice on Sunday Try this (solve (make-8-puzzle-problem) 'A*-search) You are going to receive the resolution of the problem using A*, h...
29
maddalab@...
maddalab
Nov 19, 2001 11:30 pm
Hi, I purchased the book recently and think I have the 2nd Printing, so these errors should be in all books. Please do correct me in case I am wrong. I have...
30
Becca Wemhoff
bmwemhoff
Nov 21, 2001 6:53 pm
On page 525, end of 5th line of "18.1 A General Model of Learning Agents" currently reads: "The learning element takes some knowledge about the learning...
31
Rafal Kicinger
rkicinge
Jan 4, 2002 8:49 pm
Hi, I've noticed a small error in the algorithm GENERAL-SEARCH on p.73 In Figure 3.10 there is: nodes <-- QUEUING-FN ... and it should be: else nodes <--...
32
Peter Norvig
norvig
Jan 5, 2002 7:20 am
Either your way or the way in the book would work. Since the previous statement has a return, the final nodes <- ... statement is executed only if the test is...
33
ag272
Jan 8, 2002 5:37 am
Hi, I believe that on p.766, fourth line from the top, the most probable path of the Viterbi's algorithm should be [Onset, Mid, Mid, End, Final], not [Onset,...
34
sinuously
Jan 10, 2002 6:38 pm
Okay, I confess I have skipped around in the book. After all it is borrowed from a friend, and I only meant to read about language parsing, and then one thing...
35
Peter Norvig
norvig
Jan 10, 2002 10:23 pm
Thanks for your questions. The quasi-logical form is all about semantics in logical form, so "sentence"; means a sentence in logic (and is unrelated to the...
36
veeramanju kalyan
veeramanju
Jan 23, 2002 1:54 pm
hello the group is interesting __________________________________________________ Do You Yahoo!? Send FREE video emails in Yahoo! Mail! ...
37
jaesik_min
Jan 24, 2002 4:56 pm
Hi, The f value labeled to "Oradea" as "f=146+380=526" should be changed to "f=291+380=671", because the g value has been defined as "the path cost so far",...
38
ma_schuhmann
Jan 29, 2002 10:24 pm
Reading the second edition of this great book, some minor errors attracted my attention: p.98 fig 4.4 there stands:"the straight-line distances to Bucharest ...
39
bishop_vlad
Feb 4, 2002 1:05 am
Hi, I am getting for an exam in my AI course. We are using Mr. Russell's and Mr. Norvig's "Artificial Intelligence: A Modern Approach." To prepare for the...
40
bishop_vlad
Feb 4, 2002 1:06 am
Hi, I am getting for an exam in my AI course. We are using Mr. Russell's and Mr. Norvig's "Artificial Intelligence: A Modern Approach." To prepare for the...
41
Peter Norvig
norvig
Feb 4, 2002 1:29 am
We can't give out the answers to exercises, because some instructors want to assign them for homework. -Peter ... From: "bishop_vlad" <bishop_vlad@...> ...
42
Serguei A Mokhov
stgunya
Feb 4, 2002 3:20 am
Hello, This is always a trade off between instructors being afraid that the studens will write off the solutions manual their assignments and students'...
43
Peter Norvig
norvig
Feb 4, 2002 4:28 am
I certainly agree that there is a tradeoff, and worked examples are a great help. I don't want to give away answers to existing problems, but I do think that...
44
ivofilho
Feb 6, 2002 3:44 pm
Hello... I am starting my course on eletrical engeneering.. I have some knowledge about computer programming and eletronics. So, now I am starting building my...
45
Peter Norvig
norvig
Feb 7, 2002 6:29 am
Traditionally (1970s to early 1990s), Lisp and Prolog have been popular languages for AI, and C has not. The main reason is that Lisp and Prolog are more...
46
BRANDON C CORFMAN
bcorfman
Feb 7, 2002 12:54 pm
I know straightforward search algorithms can be implemented in C++. But most chapters of the AIMA book deal with first order logic. Are there frameworks to...
47
Serguei A Mokhov
stgunya
Feb 7, 2002 3:28 pm
Quoting Peter Norvig <peter@...>: <snip> ... I would also add CLIPS. The adder exercise in the book I would do in CLIPS rather than in any other...
48
Peter Norvig
norvig
Feb 8, 2002 6:08 am
Prolog does provide a straightforward way to do logical inference -- if you're satisfied with the depth-first search approach, and with the incomplete...
49
saneinvt
Feb 10, 2002 12:02 am
How to do that? Can any n-CNF SAT problem be reduced to an equivalent (n-1)-CNF-SAT problem? Thanks...
50
maumitab1970
Feb 14, 2002 4:52 pm
***************************************************** Our apology, if you receive multiple copies of this message ...
51
Mariano Buņirigo
mbunirigo
Feb 18, 2002 4:33 pm
I'm looking for AO* algorithm, code or specification. I'm going to write the code in Lisp, and add the code to AIMA tool. Anyone knows where I can find it. ...
52
maumita bhattacharya
maumitab1970
Feb 19, 2002 1:32 pm
***************************************************** Our apology, if you receive multiple copies of this message ...
53
liulu99
Feb 27, 2002 8:19 pm
Hello, I tried to install the lisp code for aima. After entering (load "aima.lisp"), the compiler gave following information: ; Loading...
54
JLobato
coshjaguar@...
Mar 2, 2002 6:50 pm
Hi, I'm also new on lisp. I manage to install it using allegro lisp with the command line: (load "c:\\cosh\\program\\lisp\\russell\\aima.lisp") (aima-load...
