Red Hat Summit Red Hat SummitSupportKonsoleEntwicklerDemo startenKontakt

Dieser Inhalt ist in der von Ihnen ausgewählten Sprache nicht verfügbar.

Chapter 3. Quick Start

3.1. JBoss Rules
Link kopieren

JBoss Rules is the name of the business rule engine provided as part of the JBoss Enterprise SOA Platform product.

Link kopieren

Report a bug

3.2. The JBoss Rules Engine
Link kopieren

The JBoss Rules engine is the computer program that applies rules and delivers Knowledge Representation and Reasoning (KRR) functionality to the developer.

Link kopieren

Report a bug

3.3. Production Rules
Link kopieren

A production rule is a two-part structure that uses first order logic to represent knowledge. It takes the following form: 
when
	<conditions>
then
	<actions>
Copy to Clipboard Toggle word wrap

Link kopieren

Report a bug

3.4. The Inference Engine
Link kopieren

The inference engine is the part of the JBoss Rules engine which matches production facts and data to rules. It will then perform actions based on what it infers from the information. A production rules system's inference engine is stateful and is responsible for truth maintenance.

Link kopieren

Report a bug

3.5. ReteOO
Link kopieren

The Rete implementation used in JBoss Rules is called ReteOO. It is an enhanced and optimized implementation of the Rete algorithm specifically for object oriented systems.

Link kopieren

Report a bug

3.6. Production Memory
Link kopieren

The production memory is where rules are stored.

Link kopieren

Report a bug

3.7. Working Memory
Link kopieren

The working memory is the part of the JBoss Rules engine where facts are asserted. From here, the facts can be modified or retracted.

Link kopieren

Report a bug

3.8. Conflict Resolution Strategy
Link kopieren

Conflict resolution is required when there are multiple rules on the agenda. As firing a rule may have side effects on the working memory, the rule engine needs to know in what order the rules should fire (for instance, firing ruleA may cause ruleB to be removed from the agenda).

Link kopieren

Report a bug

3.9. Hybrid Rule Systems
Link kopieren

A hybrid rule system pertains to using both forward-chaining and backward-chaining rule systems to process rules.

Link kopieren

Report a bug

3.10. Forward-Chaining
Link kopieren

Forward-chaining is a production rule system. It is data-driven which means it reacts to the data it is presented. Facts are inserted into the working memory which results in one or more rules being true. They are then placed on the schedule to be executed by the agenda.
JBoss Rules is a forward-chaining engine.

Link kopieren

Report a bug

3.11. Backward-Chaining
Link kopieren

A backward-chaining rule system is goal-driven. This means the system starts with a conclusion which the engine tries to satisfy. If it cannot do so it searches for sub-goals, that is, conclusions that will complete part of the current goal. It continues this process until either the initial conclusion is satisfied or there are no more unsatisfied sub-goals. Prolog is an example of a backward-chaining engine.

Important

Backward-chaining was implemented in JBoss BRMS 5.2.

Link kopieren

Report a bug

3.12. Reasoning Capabilities
Link kopieren

JBoss Rules uses backward-chaining reasoning capabilities to help infer which rules to apply from the data.

Link kopieren

Report a bug

3.13. Expert Systems
Link kopieren

An expert system is said to be formed when a framework uses ontological model to represent a domain and contains facilities for knowledge acquisition and explanation.

Link kopieren

Report a bug

3.14. The Rete Root Node
Link kopieren

When using Rete00, the root node is where all objects enter the network. From there, it immediately goes to the ObjectTypeNode.

Link kopieren

Report a bug

3.15. The ObjectTypeNode
Link kopieren

The ObjectTypeNode helps to reduce the workload of the rules engine. If there are several objects and the rules engine tried to evaluate every single node against every object, it would waste a lot of cycles. To make things efficient, the ObjectTypeNode is used so the engine only passes objects to the nodes that match the object's type. This way, if an application asserts a new Account, it won't propagate to the nodes for the Order object.
In JBoss Rules, an object which has been asserted will retrieve a list of valid ObjectTypesNodes via a lookup in a HashMap from the object's Class. If this list doesn't exist it scans all the ObjectTypeNodes finding valid matches which it caches in the list. This enables JBoss Rules to match against any Class type that matches with an instanceof check.

Link kopieren

Report a bug

3.16. AlphaNodes
Link kopieren

AlphaNodes are used to evaluate literal conditions. When a rule has multiple literal conditions for a single object type, they are linked together. This means that if an application asserts an Account object, it must first satisfy the first literal condition before it can proceed to the next AlphaNode.
AlphaNodes are propagated using ObjectTypeNodes.

Link kopieren

Report a bug

3.17. Hashing
Link kopieren

JBoss Rules uses hashing to extend Rete by optimizing the propagation from ObjectTypeNode to AlphaNode. Each time an AlphaNode is added to an ObjectTypeNode it adds the literal value as a key to the HashMap with the AlphaNode as the value. When a new instance enters the ObjectType node, rather than propagating to each AlphaNode, it can instead retrieve the correct AlphaNode from the HashMap, thereby avoiding unnecessary literal checks.

Link kopieren

Report a bug

3.18. BetaNodes
Link kopieren

BetaNodes are used to compare two objects and their fields. The objects may be the same or different types.

Link kopieren

Report a bug

3.19. Alpha Memory
Link kopieren

Alpha memory refers to the right input on a BetaNode. In JBoss Rules, this input remembers all incoming objects.

Link kopieren

Report a bug

3.20. Beta Memory
Link kopieren

Beta memory is the term used to refer to the left input of a BetaNode. It remembers all incoming tuples.

Link kopieren

Report a bug

3.21. Lookups with BetaNodes
Link kopieren

When facts enter from one side, you can do a hash lookup returning potentially valid candidates (referred to as indexing). At any point a valid join is found, the Tuple will join with the Object (referred to as a partial match) and then propagate to the next node.

Link kopieren

Report a bug

3.22. LeftInputNodeAdapters
Link kopieren

A LeftInputNodeAdapter takes an Object as an input and propagates a single Object Tuple.

Link kopieren

Report a bug

3.23. Terminal Nodes
Link kopieren

Terminal nodes are used to indicate when a single rule has matched all its conditions (that is, the rule has a full match). A rule with an 'or' conditional disjunctive connective will result in a sub-rule generation for each possible logically branch. Because of this, one rule can have multiple terminal nodes.

Link kopieren

Report a bug

3.24. Node Sharing
Link kopieren

Node sharing is used to prevent unnecessary redundancy. Because many rules repeat the same patterns, node sharing allows users to collapse those patterns so they don't have to be re-evaluated for every single instance.

Link kopieren

Report a bug

3.25. Node Sharing Example
Link kopieren

The following two rules share the first pattern, but not the last: 
rule
when
    vehicle( $car : name == "car" )
    $driver: Driver( typeCar == $sedan )
then
    System.out.println( $driver.getName() + " drives sedan" );
end
Copy to Clipboard Toggle word wrap 
rule
when
    Vehicle( $sedan : name == "sedan" )
    $driver : Driver( typeCar != $sedan )
then
    System.out.println( $driver.getName() + " does not drive sedan" );
end
Copy to Clipboard Toggle word wrap

Link kopieren

Report a bug

3.26. Loose Coupling
Link kopieren

Loose coupling involves "loosely" linking rules so that the execution of one rule will not lead to the execution of another.
Generally, a design exhibiting loose coupling is preferable because it allows for more flexibility. If the rules are all strongly coupled, they are likely to be inflexible. More significantly, it indicates that deploying a rule engine is overkill for the situation.

Link kopieren

Report a bug

3.27. Strong Coupling
Link kopieren

Strong coupling is a way of linking rules. If rules are strongly-coupled, it means executing one rule will directly result in the execution of another. In other words, there is a clear chain of logic. (A clear chain can be hard-coded, or implemented using a decision tree.)

Link kopieren

Report a bug

3.28. Declarative Programming
Link kopieren

Declarative programming refers to the way the rule engine allows users to declare "what to do" as opposed to "how to do it". The key advantage of this point is that using rules can make it easy to express solutions to difficult problems and consequently have those solutions verified. Rules are much easier to read than code.

Link kopieren

Report a bug

3.29. Logic and Data Separation
Link kopieren

Logic and Data separation refers to the process of de-coupling logic and data components. Using this method, the logic can be spread across many domain objects or controllers and it can all be organized in one or more discrete rules files.

Link kopieren

Report a bug

3.30. Knowledge Base
Link kopieren

A knowledge base is a collection of rules which have been compiled by the KnowledgeBuilder. It is a repository of all the application's knowledge definitions. It may contain rules, processes, functions, and type models. The Knowledge Base itself does not contain instance data (known as facts). Instead, sessions are created from the Knowledge Base into which data can be inserted and where process instances may be started. It is recommended that Knowledge Bases be cached where possible to allow for repeated session creation.

Link kopieren

Report a bug
Nach oben
Red Hat logoGithubredditYoutubeTwitter

Lernen

Testen, kaufen und verkaufen

Communitys

Über Red Hat Dokumentation

Wir helfen Red Hat Benutzern, mit unseren Produkten und Diensten innovativ zu sein und ihre Ziele zu erreichen – mit Inhalten, denen sie vertrauen können. Entdecken Sie unsere neuesten Updates.

Mehr Inklusion in Open Source

Red Hat hat sich verpflichtet, problematische Sprache in unserem Code, unserer Dokumentation und unseren Web-Eigenschaften zu ersetzen. Weitere Einzelheiten finden Sie in Red Hat Blog.

Über Red Hat

Wir liefern gehärtete Lösungen, die es Unternehmen leichter machen, plattform- und umgebungsübergreifend zu arbeiten, vom zentralen Rechenzentrum bis zum Netzwerkrand.

Theme

© 2025 Red Hat