Hello soulmates, on chapter 7, figure 7.13, the PL-RESOLUTION algorithm is proposed with a helper function, PL-RESOLVE, that returns the set of all possible ...
... That is not the case. Sorry. ... Of course not. The resolution rule allows to discard two complementary literals, but not more at one. For example with the...
HI I am studying AI on my own and I need C/C++ codes for the pesudocodes in the book,also is there any way to get the solutions for the exercises of the book...
Hello! I've read the paragraph about AI becoming a science and therefore more formal. But somehow I'm having the impression that the informal approach to...
Hi, On page 950, the book argues that the sentence "J. R. Lucas cannot consistently assert that this sentence is true." is necessarily true, but Lucas cannot...
Sounds like sort of a contradiction. The words "cannot consistently" I think give it the flexability to sometimes be true and sometimes not. If the sentence...
Hi Bruce, I think "this statement is definitely false" is more a paradox than a contradiction, for when you decide it is false then it is true, and vice versa....
To try and understand this equation I assumed the following: number of possible percepts P = 3 lifetime of the agent (number of percepts it will receive) = 3 I...
I believe if you look at the "setup" on the previous page you'll see the authors intended the term "consistent" to be the logical definition. (see pages 137...
I'm not sure if you're being consistent in your definition of P, the possible precepts, since I can't figure out how you arrived at 15. (I agree with 39). To...
But my question is that being false does *not* equal being contradictory (i.e. necessarily false). If the sentence were merely false but not contradictory, he...
Hi my name is mazhar & recently I join this group, coz I need your/experts helps. I m belonging from Pakistan & the student of MCS. Will u please tell me the...
I don't know if I'm explaining this very well. Someone else should feel free to chime in if they've got a better way of phrasing it... While they haven't...
hi, cud anyone plz tell me d link to the answers of d exercises of this book ... Yahoo! for Good Click here to donate to the Hurricane Katrina relief effort....
In page97, line 7: The restriction is to choose an h function that never overestimates the cost to reach the goal. Such an h is called an admissible heuristic....
If we are at node n and my goals are in t1,t2,.... tn. The most aware way from n to Ti shows with H* but we have an estimate of future that we shows with H and...
I think my version is different from yours, but I assume you're talking about the A* search algorithm. The proof is in the book a page or so later, but look ...
I think the discussion all boils down to the definition of "consistent" and "contradiction". I was kind of hoping one of the authors would chime in at some...
This makes sense. : ) Can you also explain consistent? Or, better yet, INconsistent? Still talking A*. thanks.... Susan _____ From: aima-talk@yahoogroups.com...
Hi again, I apologize for interrupting (can you do that in email?!) Before answering me, the person who asked the original question should be satisfied with...
Dear Sir. When the path estimate is too high, this means that your h function has more less aware(h1) than time your path estimate has more accuracy(h2). when...
Consistency of heuristics is a little more tricky to explain, since every consistent one is also admissible. If you're not from the U.S., I'll apologize in...
Rob, Thanks so much! This helps me with a homework problem that I was completely stumped on. I'll cite your letter, as our teacher asked us to do if we get ...
hey everybody am doing a project on image processing n am using the convolution theorem given in chapter 25.in tht am not able to get an image function. it...
The index in my edition (2nd) gives only two mentions of convolution: pg 869 and pg 899. These are in chapter 24, not ch. 25. So I'm not sure what you're...
I doubt if I can make the issues more clear, but I'll try. I still think the main problem lies in the phrase "if it were false". If a proposition in a set is...
... I wondered this myself, and posted some notes to my blog: Expert systems: what happened in the past decade? http://www.paoloamoroso.it/log/050309.html ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
