Patent application number | Description | Published |
20090063382 | Pluggable dialects for a rule engine - Some embodiments of pluggable dialects for a rule engine have been presented. In one embodiment, a rule file substantially written in a rule language is compiled. The rule file may include a set of rules, each rule having one or more semantic code blocks written in a dialect different from the rule language. The compiled rule file is input to a core engine of a rule engine for execution. | 03-05-2009 |
20090063385 | Sequential mode in a Rete engine - Some embodiments of a sequential mode in a Rete rule engine have been presented. In one embodiment, a Rete rule engine is configured to enter into a sequential mode. Using the Rete rule engine configured, a rule set having a set of rules is evaluated against a set of data objects in a stateless manner. | 03-05-2009 |
20090216702 | Mechanism to abstract fact types from a rule engine - Some embodiments of a fact type abstraction mechanism of a rule engine have been presented. In one embodiment, a fact type abstraction layer is provided to a rule engine core to allow the rule engine core to access facts of multiple different types. Further, the rule engine core is used to process the facts of multiple different types against a predetermined set of rules without converting the facts of multiple different types into a native type. | 08-27-2009 |
20110040708 | MULTIPLE ENTRY POINT NETWORK FOR STREAM SUPPORT IN A RULE ENGINE - Some embodiments of a multiple entry point network for stream support in an exemplary rule engine have been presented. In one embodiment, a stream of events is asserted into a working memory of a rule engine, which supports event processing. The rule engine, running on a server, processes the stream of events against a set of rules retrieved from a rule repository of the rule engine. To process the events, the rule engine may construct a network having multiple root nodes, each being an entry point into the network, through which the events may enter the network and propagate through the network. | 02-17-2011 |
20110040709 | PATTERN BEHAVIOR SUPPORT IN A RULE ENGINE - Some embodiments of pattern behavior support in a rule engine have been presented. In one embodiment, a behavior builder registry is stored on a computer-readable storage device in a server. The behavior builder registry includes a set of behaviors supported by a rule engine and a set of builders associated with the behaviors. A compiler running on the server may compile a set of rules using the behavior builder registry to generate a network having a set of nodes. In response to a data object asserted propagating into a node of the network, the rule engine may first check one or more behaviors at the node before applying one or more regular constraints at the node on the data object asserted. | 02-17-2011 |
20110040714 | KNOWLEDGEBASE PARTITIONING - Some embodiments of knowledgebase partitioning for implementing parallelization in a rule engine have been presented. In one embodiment, a compiler divides a knowledgebase into a set of virtual partitions. The knowledgebase includes a network constructed according to rules added to the knowledgebase. A rule engine may execute the virtual partitions of the partitioned knowledgebase in parallel using threads obtained from a pool of threads. | 02-17-2011 |
20110055137 | EFFICIENT BINARY PROTOCOL MARSHALLING FOR RULE ENGINE SESSIONS - Some embodiments of efficient binary protocol marshalling for rule engine sessions have been presented. In one embodiment, a set of marshalling plug-ins is provided to a rule engine. Each of the set of marshalling plug-ins is customized for a type of user objects. In response to encountering a user object, the rule engine selects a marshalling plug-in out of the set of marshalling plug-ins based on a type of the user object to marshall in or to marshall out the user object. | 03-03-2011 |
20120016831 | SIMULATION AND TEST FRAMEWORK FOR A RULE ENGINE - Some embodiments of a simulation and test framework for a rule engine have been presented. In one embodiment, a simulator runs a simulation in a time-aware environment. A rule engine, coupled to the simulator, may execute a set of business logic in response to the simulation in order to test behavior of the business logic. The business logic may include rules, workflow, and event processing. | 01-19-2012 |
20120330877 | EFFICIENT BINARY PROTOCOL MARSHALLING FOR RULE ENGINE SESSIONS - Some embodiments of efficient binary protocol marshalling for rule engine sessions have been presented. In one embodiment, a set of marshalling plug-ins is provided to a rule engine. Each of the set of marshalling plug-ins is customized for a type of user objects. In response to encountering a user object, the rule engine selects a marshalling plug-in out of the set of marshalling plug-ins based on a type of the user object to marshall in or to marshall out the user object. | 12-27-2012 |
20130262974 | TABULAR WIDGET WITH MERGABLE CELLS - Disclosed herein are systems, methods, and non-transitory computer-readable storage media for managing spreadsheets with decision tables. The exemplary method includes generating an underlying data model associated with a visual data model of a spreadsheet containing a decision table, populating the underlying data model based on information contained in the visual data model and based on the decision table, generating a first index for mapping cells in the visual data model to cells in the underlying data model consistent with the decision table, and generating a second index for mapping cells in the underlying data model to cells in the visual data model consistent with the decision table. | 10-03-2013 |
20140201124 | PROPERTY REACTIVE MODIFICATIONS IN A RETE NETWORK - A processing device executing a Rete rule engine modifies a particular property of an object that has traversed a Rete network. The processing device associates a first data structure with the object, the first data structure indicating that the particular property of the object has been modified. The processing device then determines whether the particular property is a constraint relevant to a node of the Rete network based on comparing the first data structure to a second data structure associated with the node, wherein the second data structure identifies one or more modifiable properties that are constraints relevant to the node. If the particular property is a constraint relevant to the node, the processing device evaluates the object with the node. If the particular property is not a constraint relevant to the node, the processing device determines not to evaluate the object with the node. | 07-17-2014 |
Patent application number | Description | Published |
20080301078 | Method and apparatus to abstract away rule languages - Some embodiments of a method and an apparatus to abstract away rule languages from a rule engine have been presented. In one embodiment, rules written in a first rule language are parsed into descriptor classes, which are used to model concepts that can be expressed in a rule engine. An intermediate structure is generated from the parsed rules. The intermediate structure is input to a core of the rule engine, which is operable to execute the rules. | 12-04-2008 |
20080301079 | Method and apparatus to define a ruleflow - Some embodiments of a method and an apparatus to define ruleflows for a rule engine have been presented. In one embodiment, a graphical user interface (GUI) is generated to allow a user to graphically specify an execution order of some rules. Then the rule engine is used to execute the rules according to the execution order. The rules may include one or more rule sets, where each rule set contains one or more rules. | 12-04-2008 |
20090222386 | Alpha node hashing in a rule engine - Some embodiments of alpha node hashing in an exemplary rule engine have been presented. In one embodiment, constraints are added into a constraint set in response to requests from one or more users of a rule engine. The rule engine then determines which constraints within the constraint set are mutually exclusive. Furthermore, the rule engine dynamically enables hashing of facts asserted into a working memory of the rule engine in response to a current number of the mutually exclusive constraints. | 09-03-2009 |
20090222397 | Beta node indexing in a rule engine - Some embodiments of beta node indexing in an exemplary rule engine have been presented. In one embodiment, a rule engine creates a network based on a set of rules. The network includes at least one multiple-input node, such as a beta node having two inputs. The beta node further includes a memory associated with each input. The rule engine may generate a single index for at least one of the memories of the beta node based on a set of predetermined attributes of elements within the memory. Examples of the elements include tuples and data objects. The index includes a set of composite keys, each having a value of each of the attributes. | 09-03-2009 |
20120136811 | LEFT AND RIGHT UNLINKING FOR A SHARED KNOWLEDGE BASE - Some embodiments of implementing left and right unlinking for a shared knowledge base in an exemplary rule engine have been presented. A rule engine can create a network to evaluate a set of rules in a knowledge base. The network includes at least one multiple-input node, such as a beta node having two inputs. The rule engine may process data in multiple sessions simultaneously using the network. The rule engine may further logically unlink a first node in the network from a second node in the network for a first session while keeping the first node linked to the second node for a second session. | 05-31-2012 |
20120136820 | METHOD TO REDUCE CHURN FROM EXCESSIVE UNLINKING - Some embodiments of a method to reduce churn caused by excessive linking and unlinking have been presented. A rule engine can create a network having a number of nodes to evaluate a set of rules in a knowledge base. The rule engine may unlink a node in the network in response to an input of the node becoming empty in a session. The rule engine may then wait a predetermined period of time before allowing the node to be unlinked again during the session. | 05-31-2012 |
20120136821 | USING LEFT AND RIGHT UNLINKING SIMULTANEOUSLY - Some embodiments of using left and right unlinking simultaneously by an exemplary rule engine have been presented. A rule engine can create a network having a number of nodes to evaluate a set of rules in a knowledge base. The rule engine may initialize a session to be processed using the network to allow each of the nodes to be logically left unlinked and logically right unlinked at the same time during the session. | 05-31-2012 |
20120143809 | LAZILY ENABLED TRUTH MAINTENANCE IN RULE ENGINES - Some embodiments of a method to lazily enable truth maintenance in a rule engine have been presented. A rule engine can enable truth maintenance on an object type basis. In response to a working memory action involving a particular object type, the rule engine may check a truth maintenance parameter of the object type involved to determine if truth maintenance for the object type has to be enabled. If so, the rule engine may enable truth maintenance for the object type. | 06-07-2012 |
20120143811 | MULTI-DIMENSIONAL TUPLE SUPPORT IN RULE ENGINES - Some embodiments of a method to support multi-dimensional tuples in rule engines have been presented. A rule engine running on a processing device can evaluate facts in a working memory stored on a data storage device against a rule with repetitions. The rule engine may create a multi-dimensional tuple to hold a set of the facts that matches the rule. The multi-dimensional tuple has a set of elements and an index for each of the elements. Each element of the multi-dimensional tuple is a single fact or a tree structure for holding a set of facts of a repetition group that matches the rule with repetitions. | 06-07-2012 |
20120143812 | MULTI-RESULT SET CALCULATION SUPPORT IN RULE ENGINES - Some embodiments of a method to support multi-result set calculation in a rule engine have been presented. A rule engine can compile a set of rules to build a network for evaluating facts against the rules. The rules include at least one rule requiring multiple calculations to be executed for the same set of facts. The rule engine can create a single multi-result set calculation node for this rule in the network. The multi-result set calculation node can generate a set of results and add the set of results to a tuple to be propagated to a second node connected to an output of the multi-result set calculation node. | 06-07-2012 |