## Our apology, if you receive multiple copies of this message ## IKOMAT'02, 16-18 September 2002, Crema, Italy Dear Colleague, To accommodate numerous...
Hi, I've got a problem with Figure 12.4a (downward solution property) When downward solution property holds, and once we found a solution (bold squares) we can...
Hi, I think I finally solved the problem. In /aima/utilities/utilities.lisp, I have code (setf (package-lock-fdefinitions (find-package pkg)) nil) I changed it...
Hi, I am a B.E. student doing a course on AI. I have tried the 2 Knights problem using game trees. We are a team of five looking for a feasible short term...
55
JLobato
coshjaguar@...
Mar 2, 2002 6:54 pm
Hi, I have install the code and I'm trying to make something run but I'm new in lisp and is difficult to go on. Does anyone have some examples on defining...
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...
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. ...
Prolog does provide a straightforward way to do logical inference -- if you're satisfied with the depth-first search approach, and with the incomplete...
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...
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...
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...
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...
Hello, This is always a trade off between instructors being afraid that the studens will write off the solutions manual their assignments and students'...
We can't give out the answers to exercises, because some instructors want to assign them for homework. -Peter ... From: "bishop_vlad" <bishop_vlad@...> ...
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...
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...
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 ...
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",...
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...
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...
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,...
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...
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 <--...
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...
