WOW James !!!!!!!! I thought this treatment was reserved for Consultants on "certain" rules projects <GRIN>. Good advice, though !!!!!!!! Rich Halsey [EMAIL PROTECTED] wrote: > I'm only attaching the pertinent part of the previous email and all I can say is, > "AMEN!!" Some of the guidelines that I usually suggest in the design of any Expert > System is to answer the following questions: > > Is this an algorithmic process? > Can the problem be programed in traditional, structured programming language? > Will it be done easier in traditional, structured programming language? > > If so you answered these questions yes then do NOT use an expert system. > Especially a rulebased system. > > However, if the problem > > Takes more than one page to express a decision tree. > Is programmable but highly complex. > (Such as many pages of seemingly conflicting procedures and policies.) > If the logic changes frequently. > If the logic is primarily "rule of thumb" kind of domain expertise. > > Then a rulebase or ANN might be desirable. > > I agree with Dr. Friedman-Hill, but he has shown himself to be a much nicer (and > far more understanding) person than am I. A calculator problem is a really hideous > way to use Jess or any other Expert System. The person who suggested this should > be taken out, tried, judged and summarily executed by tying their personals to the > high-voltage output of the CRT Aqueduct Power Supply of their computer monitor. > :-) > > jco > > "Ernest J. Friedman-Hill" wrote: > > > I think BPoon wrote: > > > 1) Can i write a function which can convert infix notation of a fraction > > > into prefix or postfix notation in JESS so that i can store the > > > prefix/postifx string into database? > > > Is there any function for stack in JESS? anyone can give me some > > > examples on coding on this problem? > > > > Let me preface this with the comment that using Jess to write a "desk calculator" > > program (that's what I'm assuming you mean here) is a really horrid mismatch > > between capabilities and tasks. Parsing and evaluating expressions is entirely > > deterministic -- there's generally an exact, unambiguous grammar -- and can be > > easily handled using classical parsing techniques. Any introductory > > compiler-writing text will use parsing simple arithmetic expressions as its first > > example program. Using Jess to do this task will be much, much harder. It's like > > using a hammer to cut wood. > > ttfn > > IHN > Jim > > --------------------------------- > James C. Owen > Knowledge-Based Systems Corporation > 6314 Kelly Circle > Garland, TX 75044 > > 972.530.2895 > > mailto:[EMAIL PROTECTED] > http://www.kbsc.com > > "Tell The Kids I Love Them. -God" > (Seen on a billboard in DFW MetroPlex.) > > "NT's lack of reliability is only surpassed by its lack of scalability." -- John > Kirch > > --------------------------------------------------------------------- > To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' > in the BODY of a message to [EMAIL PROTECTED], NOT to the > list (use your own address!) List problems? Notify [EMAIL PROTECTED] > --------------------------------------------------------------------- --------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] ---------------------------------------------------------------------
