Abstract: Systems, methods, and techniques to efficiently analyze and navigate through decision logic using an execution graph are provided. The method includes executing decision logic in response to receiving a data file. The method further includes generating, in response to the executing, an execution graph. The execution graph includes a plurality of nodes corresponding to a plurality of decision entities of the decision logic. The method further includes displaying the execution graph on a user interface. The method further includes displaying, in response to receiving a selection of a node of the plurality of nodes, information associated with the selected node.

Abstract: In one aspect, a computer implemented method for translating and executing rules using a directed acyclic graph is provided. The method includes transforming a ruleset into a directed acyclic graph. The directed acyclic graph includes a plurality of nodes and a plurality of branches. The method further includes identifying similarities across the plurality of branches. The method further includes grouping branches of the directed acyclic graph based on the identified similarities. The method further includes creating a modified directed acyclic graph based on the grouping. The method further includes selecting and using a method of processing a group of the modified directed acyclic graph based on an aspect of the group.

Abstract: In one aspect, a computer implemented method for translating and executing rules using a directed acyclic graph is provided. The method includes transforming a ruleset into a directed acyclic graph. The directed acyclic graph includes a plurality of nodes and a plurality of branches. The method further includes identifying similarities across the plurality of branches. The method further includes grouping branches of the directed acyclic graph based on the identified similarities. The method further includes creating a modified directed acyclic graph based on the grouping. The method further includes selecting and using a method of processing a group of the modified directed acyclic graph based on an aspect of the group.

Abstract: In one aspect, a computer implemented method for efficient value lookup in a set of scalar intervals is provided. The method includes determining, in response to a query for a scalar value, that the scalar value is located in a set of scalar intervals, wherein each of the scalar intervals comprises a left bound and a right bound. The method further includes sorting the scalar intervals based on left bounds. The method further includes comparing, in response to the sorting, a pair of scalar intervals to determine if the pair of scalar intervals overlaps. The method further includes identifying, based on the comparing indicating that the pair overlaps, a method of processing the scalar intervals.

Abstract: In one aspect, a computer implemented method for efficient value lookup in a set of scalar intervals is provided. The method includes determining, in response to a query for a scalar value, that the scalar value is located in a set of scalar intervals, wherein each of the scalar intervals comprises a left bound and a right bound. The method further includes sorting the scalar intervals based on left bounds. The method further includes comparing, in response to the sorting, a pair of scalar intervals to determine if the pair of scalar intervals overlaps. The method further includes identifying, based on the comparing indicating that the pair overlaps, a method of processing the scalar intervals.

Abstract: In one aspect, a computer implemented method for translating and executing rules using a directed acyclic graph is provided. The method includes transforming a ruleset into a directed acyclic graph. The directed acyclic graph includes a plurality of nodes and a plurality of branches. The method further includes identifying similarities across the plurality of branches. The method further includes grouping branches of the directed acyclic graph based on the identified similarities. The method further includes creating a modified directed acyclic graph based on the grouping. The method further includes selecting and using a method of processing a group of the modified directed acyclic graph based on an aspect of the group.

Abstract: Systems, methods, and techniques to efficiently analyze and navigate through decision logic using an execution graph are provided. The method includes executing decision logic in response to receiving a data file. The method further includes generating, in response to the executing, an execution graph. The execution graph includes a plurality of nodes corresponding to a plurality of decision entities of the decision logic. The method further includes displaying the execution graph on a user interface. The method further includes displaying, in response to receiving a selection of a node of the plurality of nodes, information associated with the selected node.

Abstract: A novel approach for generating and updating rules allows non-technical users to create and modify rules. A rules generation system includes a rules engineer interface, user interfaces and a rules generator. The rules engineer interface is an interface through which a rules engineer, such as rules engineer, may generate templates. Templates contain data that define rule “templates” that in turn specify a rule structure, rule elements that may be chosen by a user, and rule elements that may not be chosen by user. Templates may also define a set of choices, for example values, that user may choose for those rule elements. Templates may also be used to generate user interfaces. The user interfaces guide a user to create or edit rules.