Just wondering if the paper by Forgy "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem," Artficial Intelligence, vol. 19, pp. 17-37, 1982 is relevant to the version of Rete used in Jess in terms of time complexity?
I'm mainly interested in the time complexity of jess. The above paper states worst case time for a rule firing is O(W^(2P-1)) where W is number of elements (facts) in working memory and C is number of patters in the rule. Is this the same for Jess? Thanks. -------------------------------------------------------------------- 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] --------------------------------------------------------------------
