# US 2013/0085977 A1 · Minimizing rule sets in a rule management system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0085977 A1
- Document ID: US20130085977A1
- Status: Published application
- Kind: A1
- Application number: 13/597,419
- Filed: 2012-08-29
- Published: 2013-04-04
- Earliest claimed: 2011-09-29
- Assignees: International Business Machines Corporation
- Inventors: Ulrich M. Junker
- Web page: https://patentgrep.com/patent/US20130085977A1

## CPC

- G06N 5/025: Extracting rules from data
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method, system and computer program product for minimizing a rule set. A rule set application graph that describes a set of rules including actions and cases is built, whereby each rule defines an action for one or more cases. A rule violation graph for each rule describing the actions and cases not defined for that rule is built. A subset of rules having a reduced number of rules with the same set of actions and cases as the rule set application graph is determined by exploring candidate subsets of the rule set that are sufficient for reproducing the behavior of the original rule set.

## Claims

### Claim 1

A method for minimizing a rule set, the method comprising:
building a rule set application graph that describes a set of rules including actions and cases, whereby each rule defines an action for one or more cases;
building a rule violation graph for each rule describing the actions and cases not defined for that rule; and
determining, by a processor, a subset of rules having a reduced number of rules with a same set of actions and cases as the rule set application graph by exploring candidate subsets of the set of rules that are sufficient for reproducing a behavior of an original rule set.

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein said determining step comprises:
building rule violation graph candidate subsets from the rule violation graphs comprising the actions and cases not defined for that subset of rules and further determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph.

### Claim 3 (depends on 2)

The method as recited in claim 2 further comprising:
determining more than one valid reduced subset of rules and using preferences between rules to choose a preferred valid reduced subset of rules.

### Claim 4 (depends on 2)

The method as recited in claim 2, wherein said determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph comprises:
building respective damaged rule set graphs by joining the rule set application graph and the respective rule set violation graph candidate subsets; and
testing each damaged rule set graph for logical consistency.

### Claim 5 (depends on 4)

The method as recited in claim 4, whereby a set of rules can define more than one object, wherein said building a damaged rule set graph comprises building damaged rule set graph instances for each object defined by the set of rules.

### Claim 6 (depends on 1)

The method as recited in claim 1 further comprising:
identifying rules whereby the action of the rule is independent of the case of the rule; and
ignoring the identified actions in the rule application graph and the rule violation graph.

### Claim 7

A computer program product embodied in a computer readable storage medium for minimizing a rule set, the computer program product comprising the programming instructions for:
building a rule set application graph that describes a set of rules including actions and cases, whereby each rule defines an action for one or more cases;
building a rule violation graph for each rule describing the actions and cases not defined for that rule; and
determining a subset of rules having a reduced number of rules with a same set of actions and cases as the rule set application graph by exploring candidate subsets of the set of rules that are sufficient for reproducing a behavior of an original rule set.

### Claim 8 (depends on 7)

The computer program product as recited in claim 7, wherein the programming instructions for determining comprises the programming instructions for:
building rule violation graph candidate subsets from the rule violation graphs comprising the actions and cases not defined for that subset of rules and further determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph.

### Claim 9 (depends on 8)

The computer program product as recited in claim 8 further comprising the programming instructions for:
determining more than one valid reduced subset of rules and using preferences between rules to choose a preferred valid reduced subset of rules.

### Claim 10 (depends on 8)

The computer program product as recited in claim 8, wherein the programming instructions for determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph comprises the programming instructions for:
building respective damaged rule set graphs by joining the rule set application graph and the respective rule set violation graph candidate subsets; and
testing each damaged rule set graph for logical consistency.

### Claim 11 (depends on 10)

The computer program product as recited in claim 10, whereby a set of rules can define more than one object, wherein said building a damaged rule set graph comprises building damaged rule set graph instances for each object defined by the set of rules.

### Claim 12 (depends on 7)

The computer program product as recited in claim 7 further comprising the programming instructions for:
identifying rules whereby the action of the rule is independent of the case of the rule; and
ignoring the identified actions in the rule application graph and the rule violation graph.

### Claim 13

A system, comprising:
a memory unit for storing a computer program for minimizing a rule set; and
a processor coupled to the memory unit, wherein the processor, responsive to the computer program, comprises:
circuitry for building a rule set application graph that describes a set of rules including actions and cases, whereby each rule defines an action for one or more cases;
circuitry for building a rule violation graph for each rule describing the actions and cases not defined for that rule; and
circuitry for determining a subset of rules having a reduced number of rules with a same set of actions and cases as the rule set application graph by exploring candidate subsets of the set of rules that are sufficient for reproducing a behavior of an original rule set.

### Claim 14 (depends on 13)

The system as recited in claim 13, wherein the circuitry for determining comprises:
circuitry for building rule violation graph candidate subsets from the rule violation graphs comprising the actions and cases not defined for that subset of rules and further determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph.

### Claim 15 (depends on 14)

The system as recited in claim 14, wherein the processor further comprises:
circuitry for determining more than one valid reduced subset of rules and using preferences between rules to choose a preferred valid reduced subset of rules.

### Claim 16 (depends on 14)

The system as recited in claim 14, wherein the circuitry for determining if those actions and cases not defined by each rule violation graph candidate subset are distinct from the actions and cases defined by the rule set application graph comprises:
circuitry for building respective damaged rule set graphs by joining the rule set application graph and the respective rule set violation graph candidate subsets; and
circuitry for testing each damaged rule set graph for logical consistency.

### Claim 17 (depends on 16)

The system as recited in claim 16, whereby a set of rules can define more than one object, wherein said building a damaged rule set graph comprises building damaged rule set graph instances for each object defined by the set of rules.

### Claim 18 (depends on 13)

The system as recited in claim 13, wherein the processor further comprises:
circuitry for identifying rules whereby the action of the rule is independent of the case of the rule; and
circuitry for ignoring the identified actions in the rule application graph and the rule violation graph.

### Claim 19 (depends on 13)

The system as recited in claim 13, wherein the system is a business rules management system.
