[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Europe-Swas-Artificial-Intelligence | 
|  | 
| Moderator: | HERON::BUCHANAN | 
|  | 
| Created: | Fri Jun 03 1988 | 
| Last Modified: | Thu Aug 04 1994 | 
| Last Successful Update: | Fri Jun 06 1997 | 
| Number of topics: | 442 | 
| Total number of notes: | 1429 | 
436.0. "Dynamic Tree Modification ?" by OSITEL::BRITTAIN (Peter, TCC Munich @UFC 865-3102) Thu Apr 22 1993 10:55
    All Hail, vibrant and dynamic AI community!
    Mr. Customer has an interesting wish for his help-system.  He wants it
    to "learn" by remembering frequently traversed paths and extending
    branches interactively with the user (help-desk support people).
    Remember the old example we used to do in Lisp courses,
    "Guess-the-animal" where, if the prog got the answer wrong it would
    prompt for a way of distinguishing the right answer from the nearest
    guess it had in its tree, and then extend the tree (destructively
    modify its list) ?  ...Well that's partly, approximately what he wants.
    I'd like to continue with dectree, cause it's such fun (I don't think
    he'd let me do it in Lisp anyway!).  Paul AIAG::Wisner has given me
    some clues about writing out new .TREE files, but a re-build is of
    course unavoidable.
    Perhaps one of you AI guys out there knows a tool that supports this
    dynamic modification of trees ?   (OPS5 and Prolog can also add and use
    production rules dynamically, but is this a good approach ?)
    -pete
    X-posted in DECTREE and AI conferences
| T.R | Title | User | Personal Name
 | Date | Lines | 
|---|
| 436.1 | AICorp KBMS Helpdesk shell | CHEVIE::FITZGIBBON | Joe Fitzgibbon, Valbonne EIC | Fri Apr 23 1993 10:24 | 3 | 
|  | See the reply to this note in the AI Notes file....
Joe.
 |