Hi everyone, the book explains pattern databases on page 107 (2nd ed.). It says that it is currently unknown how how the pattern database approach can be...
This is with regards to AIMA 2nd Ed, page 36. The description says that if a performance penalty of one point is assessed, the agent will fare poorly. I'm at a...
-- Buitms Mail (http://mail.buitms.edu.pk) i have computer with intel architecture and running XP. which LISP version can be run on my system. plz provide me...
Hi, I'm trying to use the FOL KB in fol.lisp, and the only doc I found is http://aima.cs.berkeley.edu/lisp/doc/overview-LOGIC.html I want to be able to tell...
hi all I think there is a critical point in chapter 3,section 4,page 75 of seconde edition of AIMA,about worth case time of uniform-cost search. authors...
Hi, I have some questions regarding chapter 13.7 "The Wumpus World Revisited" and the derivation of the distribution of P1,3 given known and breeze evidence in...
Are there any misleading heuristics apart from the non-admissible ones that would make A* perform inefficiently? I found one example in this CI space Search...
i want to follow this book in my teaching of AI course. when i was taught this course at that time i worked on Prolog , but now i want to work on LISP , i have...
The AIMA tells us that the number of nodes within the goal contour search space is exponential in the length of solution; and in "Bibliographical and...
I made an deduction for the equation but don't know if it's correct. I put on the link of my deduction and hope someone can help me with it. link here...
I'm late to the game, some would say. But I've been interested in the concepts of AI since a kid. Only recently have I started doing something about it. I'm...
Hello! I tried out with calculation of the Normalization constant(alpha') on page 485, for the Wumpus example, but i failed. Could you help me in that? Thanks...
I'd like to begin my comments on "Artificial Intelligence: A Modern Approach, 2nd Edition" by saying that this is a truly, truly excellent book, which I...
hi, I want to find all solutions in state space for a problem with dfs algorithm I write this I think it is true but not efficient. Can anyone say something...
I've read in the 2nd edition, that a node is conditionally independent of its non-descendants given its parents or given its Markov blanket. The 2nd edition...
Can someone explain how numeric values were derived for P(fringe)? I see in the book where it states, "Notice that the expression P(b|known,P[1,3],fringe) is 1...
I was curious about the figure of 2057 of the no. of states in the complete state formulation (p.67). Now seeing the answer from one of the authors, I ran my...
In section 3.2 (p.67) the author suggested that the enhanced version of the formulation reduced the state space from 3*10^14 to just 2057. How is the number...
Does anyone know where I can find the data that was used to generate the training curve in Figure 20.26(a). I did find the restaurant.csv file but it contains...
http://www.cs.virginia.edu/~robins/YouAndYourResearch.html (extremely long post replaced by a link to the article on the net - potsers, please keep in mind...
Considering the recent interest in "Semantic Web", as a part of the SOA course, the students are discussing the "Semantic Web Vs Artificial Intelligence". In...
Hi, On page 34, What do you understand by: percept sequence:[A,clean],[A,clean] The first percept changes the position of the vacuum-cleaner to place B and in...
I have problem with implementation of uninformed search algorithms in java that was in the aima.zip package. Can anyone send for me a program that use this...
Hi, On page 74 of The Book there is a formula O(b^d+1). The example states that b=10 and d=2, which in my mind results in 10^3 = 1000, but the example gives...
