Rule selection engine

Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S045000, C706S050000

Reexamination Certificate

active

07433858

ABSTRACT:
A rules-based system makes use of a specification that is similar to those used in earlier systems, such as in OPS5, but does not require the computational complexity of implementations such as Rete. In some such implementations, matching of the applicable rules given a set of facts is simplified by providing preallocated storage locations for the Boolean values of the condition elements for each rule. The Boolean values are set by direct processing of each of the facts. These preallocated storage locations are arranged to allow efficient evaluation of the overall condition of each of the rules in a manner that is significantly more efficient than implementations of earlier rule-based systems.

REFERENCES:
patent: 4649515 (1987-03-01), Thompson et al.
patent: 5140671 (1992-08-01), Hayes et al.
patent: 5179632 (1993-01-01), Masui et al.
patent: 5228116 (1993-07-01), Harris et al.
patent: 5263127 (1993-11-01), Barabash et al.
patent: 5353385 (1994-10-01), Tano et al.
patent: 5517642 (1996-05-01), Bezek et al.
patent: 5642471 (1997-06-01), Paillet
patent: 6151697 (2000-11-01), Moeller
International Searching Authority“Notification of Transmittal of International Search Report”, PCT/US05/02396, Jun. 27, 2006.
Doorenbos, “Production Matching for Large Learning Systems”, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, Jan. 31, 1995.
Gordin et al., “Set-Oriented Constructs: From Rete Rule Bases to Database Systems”.
Hanson et al., “An Overview of Production Rules in Database Systems”,The Knowledge Engineering Review, 8(2):121-143 (1993).
Nayak et al., “Comparison of the Rete and Treat Production Matchers for Soar (A Summary)”.
Tambe et al., “Uni-Rete: Specializing the Rete Match Algorithm for the Unique-attribute Representation”, pp. 1-30.
Wallis et al., “Efficient Forward Chaining for Declarative Rules in a Multi-Agent Modelling Language”, Center for Policy Modelling, Manchester Metropolitan University, UK, Oct. 21, 1994.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Rule selection engine does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Rule selection engine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rule selection engine will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4012106

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.