... Thanks. I welcome any contribution. Your idea of adding an algorithm to the library is the best to do. My highest expectations are that some teachers ask...
interesting perspective! there are 18 universities in london doing A.I. dgree courses. i think a great way is getting sahpiro's encyclopoedia of A.I. 2 vols, ...
hi all, if any of you know how to get the book exercises solutions i'd be so thankful... i need them urgently ... please anyone answer me as soon as possible. ...
Hi If any of you can help me out with the solutions of exercises in chapters 8 and 9 of second edition, I will be grateful. IT IS AN URGENT NEED. Thanks....
Hi everybody, I want to develop an intelligent agent with a small knowledge base. But I am not able to find out how to start implementing that. What i am...
Hi dear sir. Agent can be everything that receive information from real world then make an action.You can design an intelligent wnoledgebase in expert system...
First of all, "Knowledge base", this could be your database of facts. If you are using prolog then u can start by building a small set of facts in a simple...
Hi all, Aima java 0.4 with additional code for probability and supervised machine learning (plus quite a few bug fixes) has been posted on the aima site .You...
Hi, Thank you very much for: AT Murray Mohammad Assarian Osamah alsaidi all three of you for showing me some direction to go ahead with the implementation. I...
... You are very welcome. By the way, today on 29 August 2005 I finally achieved True AI in http://mind.sourceforge.net/mind4th.html -- Mind.Forth as in ...
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....
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.
