What are some of the top open problems in AI?
(I've searched google for this and find mostly vague
stuff like "what is the nature of intelligence" etc.)

In 1900, Hilbert listed what he considered to be
some of the most important open problems in mathematics
and this led to a lot of groundbreaking research...

It would be nice to have a list like Hilbert's of
concrete important open problems or challenges in AI...

A Google search for
	 "artificial intelligence" "challenge problem"
yields interesting results.  (For the first result, I had to use the
"cached" feature; I don't know if this is a temporary or persistent
problem with the Microsoft Research page.)

These challenge problems are more practical-oriented than Hilbert's
problems, but then AI is more practically-oriented than Math.

-Peter

On Wednesday, October 23, 2002, at 08:16 PM, schokn wrote:

> What are some of the top open problems in AI?
> (I've searched google for this and find mostly vague
> stuff like "what is the nature of intelligence" etc.)
>
> In 1900, Hilbert listed what he considered to be
> some of the most important open problems in mathematics
> and this led to a lot of groundbreaking research...
>
> It would be nice to have a list like Hilbert's of
> concrete important open problems or challenges in AI...

Hi,

On page 231 of AIMA, the authors write, "One can even have categories
of categories of categories, but they are not much use." If
DomesticatedSpecies was of Species, wouldn't this make Species a
category of categories of categories? If so, why wouldn't it be useful?

On page 238 of AIMA, the authors write, "T(p _V_ q, e) <=> T(p, e) V
T(q, e)." From the text I got the impression that "_V_" represents
exclusive or. Is it supposed to be exclusive or? Then, should it be
"T(p _V_ q, e) <=> T(p, e) _V_ T(q, e)" instead of what's written?

Thank you.

David

HI,
I wish you all a Very Happy Diwali.
I am a Ph D student, interested in application AI (Expert Systems)
and GIS in Disaster management. I have considerably good experience
in GIS Image processing and environmental planning type of things,
but  I am quite novice as far as Expert Systems building tools are
concerned.
I am right now trying to use Visual Prolog 5.2 and Matlab 6. I am
searching for similar kind of effort on the net but was not quite
successful in finding the same except some abstracts. Can anyone
help me find out any such resource on the net?
Thanks a lot in advance.
Vikram Sorathia

Hi there.  I'm having some trouble figuring out the calculation for
an example in the book.  It's on page 447 and is

P( Burglary|JohnCalls ) = .016.

I keep getting .0008 which seems to say I'm kind of on the right
trail since I'm off by a factor of 20.

Hi,
I just wanted to know what data structure is best for
implementing the history-list in the various searches
such as DFS, BFS and A*
thanks

You could look at the online code, and ypu'd see that for depth-first search
you want a stack, for breadth-first a queue, and for A* a priority queue.

http://aima.cs.berkeley.edu/code/search/algorithms/simple.lisp
http://www.norvig.com/python/search.html

-Peter

----- Original Message -----
From: "Naresh_521204" <naresh_521204@...>
To: <aima-talk@yahoogroups.com>
Sent: Saturday, November 16, 2002 7:56 AM
Subject: [aima-talk] History LIST


> Hi,
> I just wanted to know what data structure is best for
> implementing the history-list in the various searches
> such as DFS, BFS and A*
> thanks
>
>
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>

Hi,
Thanks for the reply
For the dfs i am using 2 datastrucutes
one for storing the nodes that have not been expanded yet
which is a queue
and one for the already expanded nodes which in this case is
a history list  which i was implementing as a queue but we have
to use other datastructres for implementing it






--- In aima-talk@y..., "Peter Norvig" <peter@n...> wrote:
> You could look at the online code, and ypu'd see that for depth-
first search
> you want a stack, for breadth-first a queue, and for A* a priority
queue.
>
> http://aima.cs.berkeley.edu/code/search/algorithms/simple.lisp
> http://www.norvig.com/python/search.html
>
> -Peter
>
> ----- Original Message -----
> From: "Naresh_521204" <naresh_521204@y...>
> To: <aima-talk@y...>
> Sent: Saturday, November 16, 2002 7:56 AM
> Subject: [aima-talk] History LIST
>
>
> > Hi,
> > I just wanted to know what data structure is best for
> > implementing the history-list in the various searches
> > such as DFS, BFS and A*
> > thanks
> >
> >
> >
> > To unsubscribe from this group, send an email to:
> > aima-talk-unsubscribe@y...
> >
> >
> >
> > Your use of Yahoo! Groups is subject to
http://docs.yahoo.com/info/terms/
> >

Hi,
Can any one suggest a good evaluation function for the mancala game
other then the difference in the number of stones in the mancalas of
the players
thanks

Could any one tell me about The Real-Time A* Search?
I would like to know about the idea and algorithm detail.
It's so good, If there write in Pascal, C or C++ Language.

We congratulate the hard-working authors of AIMA
on the illustrious publication of their second edition
and we recommend AI4U as a companion AI experimentation manual.

AIMA teaches the in-depth background of artificial intelligence,
while AI4U, newly published in November of 2002, introduces an
abstract AI theory of mind and its implementation in primitive
http://www.mentifex.virtualentity.com/jsaimind.html AI software.

In co-operation with the senior AIMA textbook, AI4U is a junior
AI textbook available by print-on-demand (POD) from its publisher at
http://www.iuniverse.com/bookstore/book_detail.asp?isbn=0595259227 or
from Barnes and Noble among the wide gamut of general AI textbooks at
http://search.barnesandnoble.com/bookSearch/isbnInquiry.asp?
ISBN=0595259227 .

Please view a mention of AI4U in AIMA-talk not as a hostile intrusion
but as a collaborative approach to advancing the AI state of the art.

When you have obtained the second edition of AIMA,
if you no longer need your copy of the first edition,
please consider releasing it into the wild as a runaway
http://www.bookcrossing.com/search/?isbn=0131038052 book.

If you find AI4U worthy of memetic propagation, please
consider its minimal price as a shareware donation and
release your first or second copy into the wild as an AI
http://www.bookcrossing.com/search/?isbn=0595259227 manual.

Hi there.


I saw in Amazon.com that AIMA's 2nd edition was to be published on
December 19, 2002. Is this date correct? Because in amazon the book is
still not ready for delivery (in fact, they say it will only be
possible to ship it on August 2003).

I also read many reviews about this book that had complains about the
binding of the 1st edition. Is this problem corrected on the 2nd edition?


Thanks for your your time and merry christmas
:)

It was supposed to be in-stock on the 19th, but I heard from the
publisher there will be a slight delay until tomorrow, Dec 23.  There
was a bad batch of glue in the first printing of the first edition, but
that shouldn't happen again.

Happy holidays,
-Peter

Luis Soares wrote:

>Hi there.
>
>
>I saw in Amazon.com that AIMA's 2nd edition was to be published on
>December 19, 2002. Is this date correct? Because in amazon the book is
>still not ready for delivery (in fact, they say it will only be
>possible to ship it on August 2003).
>
>I also read many reviews about this book that had complains about the
>binding of the 1st edition. Is this problem corrected on the 2nd edition?
>
>
>Thanks for your your time and merry christmas
>:)
>
>
>To unsubscribe from this group, send an email to:
>aima-talk-unsubscribe@yahoogroups.com
>
>
>
>Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>
>

hello
I read about Real-Time A* Search in a famous book:

Artificial Intelligence :A new Approach
       By: Russel & Norving

--- "ulitjd <ulitjd@...>" <ulitjd@...>
wrote:
> Could any one tell me about The Real-Time A* Search?
> I would like to know about the idea and algorithm
> detail.
> It's so good, If there write in Pascal, C or C++
> Language.
>
>


__________________________________________________
Do you Yahoo!?
Yahoo! Mail Plus - Powerful. Affordable. Sign up now.
http://mailplus.yahoo.com

After some experimentation, the following AIMA URL has been derived:

http://dogbert.abebooks.com/servlet/BookSearchPL?ph=2&sn=0131038052

as the briefest possible link for finding used copies of AIMA

at the Advanced Book Exchange -- a large network of bookstores.

Note please that you may return in future to this unchanging link
and see varying results as booksellers add and drop AIMA 1st edition.

The AIMA international standard book number (ISBN=0131038052) was

used as a test case likely to generate multiple results after I

"seeded" one ABE member bookstore with a copy of the AI4U textbook:

http://dogbert.abebooks.com/servlet/BookSearchPL?ph=2&sn=0595259227

AIMA + AI4U = good old-fashioned artificial intelligence (GOFAI :-)

In AIMA c1995

Figure 20.6 makes use of REWARD, however I don't see how this table
is calculated or updated when 20.6 is used in 20.2.

Additionally, in 20.6 is the U[] (utility) of all terminal states
simply their Utility?  The Running-Average calculation doesn't look
like it will ever actually change if the reward stays the same, and I
don't really see how the reward can change.

Any clarifications would be appreciated.

-shane

The link on the web page for the text for Java Code is broken.
Is there code available?

Rich

Rich Scherl

The link is fixed now (http://aima.cs.berkeley.edu/java.html) but
there's not much useful code there.  Have a look and see if there's
anything you find useful. The agents package (3850 lines of Java) and
search package (1394 lines) are your best bets.

richscherl wrote:

>The link on the web page for the text for Java Code is broken.
>Is there code available?
>
>Rich
>
>Rich Scherl
>
>
>To unsubscribe from this group, send an email to:
>aima-talk-unsubscribe@yahoogroups.com
>
>
>
>Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
>
>

In fig 20.6 I don't see how in a case like the game of tic tac toe
where the rewards are only ever gained at the terminal state how the
rewards are ever propogated from the terminal nodes.

In the TD-Update when you hit a terminal all you do is update the
running average, I don't ever see a case where the terminal state and
it's sucessor are used together to modify the sucessors utility, so I
don't see how any of the utilities actually get modified.

Any clarification would be appreciated.

Dear Drs. Russell and Norvig,

I was wondering if you have a published errata list for AIMA, second
edition. I have discovered some typographical errors and errors of
referencing the wrong pages and chapters.  I would like to refer to
an errata list so that I can avoid mentioning errors that have
already been reported.

Thank you very much.

Luke Hodgkinson: a student at Hiram College

I've got a deadline for excercises 8.15 and 8.16 in 2 days but I still
don't have a clue how to put those sentences in Java code...

Does anybody have a solution/tip/hint for me?

We don't have an errata list yet; you can help start it.

Thanks,
-Peter Norvig

----- Original Message -----
From: <hodgkinsonlt@...>
To: <aima-talk@yahoogroups.com>
Sent: Sunday, January 12, 2003 8:01 AM
Subject: [aima-talk] Question about Errata list


> Dear Drs. Russell and Norvig,
>
> I was wondering if you have a published errata list for AIMA, second
> edition. I have discovered some typographical errors and errors of
> referencing the wrong pages and chapters.  I would like to refer to
> an errata list so that I can avoid mentioning errors that have
> already been reported.
>
> Thank you very much.
>
> Luke Hodgkinson: a student at Hiram College
>
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>

----- Original Message -----

From: Peter Norvig

To: aima-talk@yahoogroups.com

Sent: Monday, January 13, 2003 1:21 AM

Subject: Re: [aima-talk] Question about Errata list

We don't have an errata list yet; you can help start it.

Thanks,
-Peter Norvig

----- Original Message -----
From: <hodgkinsonlt@...>
To: <aima-talk@yahoogroups.com>
Sent: Sunday, January 12, 2003 8:01 AM
Subject: [aima-talk] Question about Errata list


> Dear Drs. Russell and Norvig,
>
> I was wondering if you have a published errata list for AIMA, second
> edition. I have discovered some typographical errors and errors of
> referencing the wrong pages and chapters.  I would like to refer to
> an errata list so that I can avoid mentioning errors that have
> already been reported.
>
> Thank you very much.
>
> Luke Hodgkinson: a student at Hiram College
>
>
> To unsubscribe from this group, send an email to:
> aima-talk-unsubscribe@yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>


To unsubscribe from this group, send an email to:
aima-talk-unsubscribe@yahoogroups.com



Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

I received my 2nd edition from Amazon last Monday.. Order all you want..

E.


--- In aima-talk@yahoogroups.com, Peter Norvig <peter@n...> wrote:
> It was supposed to be in-stock on the 19th, but I heard from the
> publisher there will be a slight delay until tomorrow, Dec 23.  There
> was a bad batch of glue in the first printing of the first edition, but
> that shouldn't happen again.
>
> Happy holidays,
> -Peter
>
> Luis Soares wrote:
>
> >Hi there.
> >
> >
> >I saw in Amazon.com that AIMA's 2nd edition was to be published on
> >December 19, 2002. Is this date correct? Because in amazon the book is
> >still not ready for delivery (in fact, they say it will only be
> >possible to ship it on August 2003).
> >
> >I also read many reviews about this book that had complains about the
> >binding of the 1st edition. Is this problem corrected on the 2nd
edition?
> >
> >
> >Thanks for your your time and merry christmas
> >:)
> >
> >
> >To unsubscribe from this group, send an email to:
> >aima-talk-unsubscribe@yahoogroups.com
> >
> >
> >
> >Your use of Yahoo! Groups is subject to
http://docs.yahoo.com/info/terms/
> >
> >
> >
> >

Hello!

I have a question about the algorithm presented in fig 14.9 on page
506.  Can anyone describe what is meant by the statement "extend e
with value xi for X"?  Thanks in advance for any clues and/or help!

Brent

This is great.  I'll review these and turn it into an errata page shortly.

-Peter

Luke Hodgkinson wrote:

> Dear Dr. Norvig,
>
> I completed a partial errata list through page 515, but unfortunately,
> I may not get the chance to go further. My apologies. I hope that this
> partial list helps.
>
> Luke
>
>
> *Errata List for AIMA, 2nd Edition, through page 515*
>
>
>
> page 26 third line from the bottom: replace form with from
>
> page 37 14th line from the bottom: replace a with an
>
> page 86 line 14: replace contingency problems with contingency problem
>
> page 95 footnote 2: replace is with it
>
> page 121 line 12: remove [discretization]
>
> page 130 line 3: remove extra word betwen combines and pairs
>
> page 165 14th line from bottom: remove extra word between to and extend
>
> page 182 line 3: transpose felt and that
>
> page 183 7th line from the bottom: add has between approach and been
>
> page 191 Ex. 6.5 b. 3rd line: add to between nodes and the
>
> page 194 9th line from bottom: add is between uses and in
>
> page 247 last line: add are between there and roughly
>
> page 276 7th line from bottom: add in between that and one
>
> page 284 figure 9.5 line 2: add AND symbol between Diff(nt, q) and
> Diff(nt, sa)
>
> page 284 line 5: remove if and add it after whether
>
> page 364 line 15: remove [modal operator]
>
> page 368 8th line from the bottom: a reference is made to the
> supermarket world; perhaps the reference should be changed to the
> Internet shopping world
>
> page 370 Ex. 10.4: Section 10.3 did not have any axioms relating to
> soup; perhaps the axioms that are to be used should be clarified
>
> page 375 line 3: no logical planning agent was introduced in chapter
> 10; perhaps the reference should be to Chapter 7
>
> page 406 line 16 Leftrightarrow should be replaced by an actual arrow
>
> page 413 Ex. 11.4 d.: it does not seem that the qualification problem
> has been introduced at this point in the book; even the index agrees
>
> page 425 line 17: replace are with and
>
> page 431 line 9: the qualification problem does not seem to have been
> discussed in Chapter 10
>
> page 436 line 6: add what before state
>
> page 437 line 5: change state!set to state set
>
> page 440 10th line from bottom: add are between problems and intractable
>
> page 445 12th line from bottom: change POP-CON to CONTINUOUS-POP-AGENT
>
> page 451 first line: change satisfie to satisfies
>
> page 455 10th line: replace multiagent with Multiagent
>
> page 462 11th line: insert able between be and conclude
>
> page 462 6th line from bottom: the qualification problem was not
> mentioned in Chapter 10
>
> page 464 first line of second full paragraph: insert a between
> Assigning and probability
>
> page 467 10th line from bottom: change first an to as
>
> page 467 2nd line from bottom: remove both commas
>
> page 471 7th line: replace could with have
>
> page 472 5th line of 3rd paragraph: change "described earlier" to
> "described on page 474"
>
> page 474 line 16: insert "by" between "bets" and "Agent"
>
> page 481 line 13: delete "use"
>
> page 488 line 14: remove superfluous period
>