Help coderanch get a
new server
by contributing to the fundraiser
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other Pie Elite all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Jeanne Boyarsky
  • Ron McLeod
  • Paul Clapham
  • Liutauras Vilda
Sheriffs:
  • paul wheaton
  • Rob Spoor
  • Devaka Cooray
Saloon Keepers:
  • Stephan van Hulst
  • Tim Holloway
  • Carey Brown
  • Frits Walraven
  • Tim Moores
Bartenders:
  • Mikalai Zaikin

Which Alogorithms does Jess use?

 
Greenhorn
Posts: 3
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Does Jess use any algorithm for optimal processing of rules? if so are there any particular algorithms that it uses?
Specifically does jess use RETE algorithm?
 
Sheriff
Posts: 7001
6
Eclipse IDE Python C++ Debian Java Linux
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Jess definately does use the Rete algorithm. In fact one of the most important classes in the Jess rule-engine code is jess.Rete !
 
author and iconoclast
Posts: 24207
46
Mac OS X Eclipse IDE Chrome
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Jess does indeed use the Rete algorithm for pattern-matching, with a number of optimizations and modifications. We've considered implementing alternate algorithms which could be switched on when desired: the TREAT and LEAPS algorithms would be the leading candidates. LEAPS is interesting because it makes the similarity between the working memory of a rule engine and the indexed store of a database more or less explicit; it also has the potential to be the fastest (there are no commercial implementations of either of these algorithms right now; they're both pretty tricky.)
[ September 04, 2003: Message edited by: Ernest Friedman-Hill ]
 
Frank Carver
Sheriff
Posts: 7001
6
Eclipse IDE Python C++ Debian Java Linux
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
the TREAT and LEAPS algorithms would be the leading candidates.
That's interesting. Do you have any references for further information on these algorithms?
 
Ernest Friedman-Hill
author and iconoclast
Posts: 24207
46
Mac OS X Eclipse IDE Chrome
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
You can buy Daniel Miranker's Ph. D. thesis on Amazon for a discussion of TREAT. LEAPS was Don Batory's work; one reference is here but you really have to read a lot of papers to get enough information about it, because all of that group's writing is very self-referential and insular.
[ September 04, 2003: Message edited by: Ernest Friedman-Hill ]
 
Frank Carver
Sheriff
Posts: 7001
6
Eclipse IDE Python C++ Debian Java Linux
  • Mark post as helpful
  • send pies
    Number of slices to send:
    Optional 'thank-you' note:
  • Quote
  • Report post to moderator
Just to note that the ftp URL you gave for the LEAPS paper seems unavailable. I was, however, able to find a PDF version of what I assume is the same paper at http://www.cs.utexas.edu/ftp/pub/predator/tr-94-28.pdf
 
Yeah, but how did the squirrel get in there? Was it because of the tiny ad?
We need your help - Coderanch server fundraiser
https://coderanch.com/t/782867/Coderanch-server-fundraiser
reply
    Bookmark Topic Watch Topic
  • New Topic