<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Do You Really Need RETE?</title>
	<atom:link href="http://pathfindersoftware.com/2006/04/do_you_really_n/feed/" rel="self" type="application/rss+xml" />
	<link>http://pathfindersoftware.com/2006/04/do_you_really_n/</link>
	<description>The Fastest Way to Launch Successful Software</description>
	<lastBuildDate>Thu, 19 Jan 2012 16:36:03 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Peter Lin</title>
		<link>http://pathfindersoftware.com/2006/04/do_you_really_n/#comment-5112</link>
		<dc:creator>Peter Lin</dc:creator>
		<pubDate>Tue, 18 Apr 2006 15:21:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.pathf.com/blogs/2006/04/do_you_really_n/#comment-5112</guid>
		<description>&lt;p&gt;Many commercial engines like iLog and JESS provide backward chaining features. iLog also has a sequential mode, which is similar to LEAPS algorithm. In my own implementation, I support a variety of options, like turning off the alphaMemory in cases where an application doesn&#039;t need to modify or retract facts. I&#039;ve also implemented additional objectTypeNode hashing so that applications with lots of simple rules will not see a significant decrease in performance. For example, I ran some tests with 8K rules (&lt;a href=&quot;http://woolfel.blogspot.com/2005/12/constant-performance-is-achievable.html)&quot; rel=&quot;nofollow&quot;&gt;http://woolfel.blogspot.com/2005/12/constant-performance-is-achievable.html)&lt;/a&gt; to demonstrate constant performance is achievable in &quot;very&quot; specific use cases.&lt;/p&gt;

&lt;p&gt;across the rule engine world, there&#039;s also Mindbox, which uses a CBR engine. FairIssac has the RETEIII engine, which also has strengths in certain areas.&lt;/p&gt;

&lt;p&gt;peter&lt;/p&gt;</description>
		<content:encoded><![CDATA[<p>Many commercial engines like iLog and JESS provide backward chaining features. iLog also has a sequential mode, which is similar to LEAPS algorithm. In my own implementation, I support a variety of options, like turning off the alphaMemory in cases where an application doesn&#8217;t need to modify or retract facts. I&#8217;ve also implemented additional objectTypeNode hashing so that applications with lots of simple rules will not see a significant decrease in performance. For example, I ran some tests with 8K rules (<a href="http://woolfel.blogspot.com/2005/12/constant-performance-is-achievable.html)" rel="nofollow"></a><a href="http://woolfel.blogspot.com/2005/12/constant-performance-is-achievable.html" rel="nofollow">http://woolfel.blogspot.com/2005/12/constant-performance-is-achievable.html</a>) to demonstrate constant performance is achievable in &#8220;very&#8221; specific use cases.</p>
<p>across the rule engine world, there&#8217;s also Mindbox, which uses a CBR engine. FairIssac has the RETEIII engine, which also has strengths in certain areas.</p>
<p>peter</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic (User agent is rejected)
Page Caching using memcached (User agent is rejected)

Served from: pathfindersoftware.com @ 2012-02-09 17:38:08 -->
