SYSTEMS AND METHODS FOR DETERMINING OFFER ELIGIBILITY USING A PREDICATE LOGIC TREE AGAINST SETS OF INPUT DATA
Example computer executable instructions for determining result eligibility using a predicate logic tree against sets of input data are provided. In particular, the disclosed instructions identify a plurality of rules that have a logical relationship and select input data for analysis under the plurality of rules. The instructions evaluate a set of requirements defining the plurality of rules against the input data and resolve the logical relationship of the plurality of rules to determine result eligibility.
Latest Sears Brands, LLC Patents:
- Systems and methods of targeted interactions for integrated retail applications
- System and method for economical migration of legacy applications from mainframe and distributed platforms
- MERCHANDISE PICKUP SYSTEM, METHOD, AND MEDIA FOR ALLIED MERCHANTS
- SLIDE BATTERY AND POWER TOOL FOR USE WITH BOTH SLIDE AND POST BATTERIES
- PRODUCT AND CONTENT ASSOCIATION
This application is a continuation of U.S. patent application Ser. No. 13/495,228, entitled “Systems and Methods for Determining Offer Eligibility Using a Predicate Logic Tree Against Sets of Input Data,” filed on Jun. 13, 2012, and incorporated herein by reference in its entirety.
FIELD OF THE DISCLOSUREThe present disclosure generally relates to offer eligibility systems and methods. More particularly, the disclosure relates to systems and methods for determining offer eligibility using a predicate logic tree against sets of input data.
BACKGROUNDSimple rules-based systems and methods for determining offer eligibility are generally known in the art. In a typical case, a consumer purchases a product or group of products from a retailer (or retail establishment) that maintains a rewards program in which the consumer participates. Upon checkout, the consumer provides identifying information so that the retailer can access the consumer's rewards program account, which contains, or has access to, the consumer's records. The consumer's records may contain the consumer's purchase history, account information, coupon redemption history, etc. The consumer may then receive a deal based on the consumer's records. A set of rules set by the retailer determines which deals, if any, the consumer will receive. Of course, many categories of retailers maintain such rewards programs, including grocers, clothiers, department stores, etc.
The known rewards engines underlying such systems are generally simple rules-based systems. For example, suppose a grocer wants to offer a deal for apples at the point-of-sale to those consumers that are currently purchasing apples and have purchased apples at least once in the past month. Upon identifying the consumer's rewards program account, the rewards engine determines whether the consumer meets the offer's rule requirements: (1) is the consumer currently purchasing apples? and (2) has the consumer purchased apples at least once in the past month. The rewards engine examines the consumer records, and if the consumer meets the rule requirements, then the consumer receives the apple deal at checkout.
One drawback of such simple rules-based systems is that they often times do not have the processing power to apply complex logic rules. One reason for this is that such systems ordinarily associate the consumer records with the parent rules of the logic tree that contains the relevant rule requirements of a particular deal. Processing speed is typically inhibited when the consumer records are associated with the parent rules of the logic tree. On the other hand, associating the consumer records directly with the child rules of the logic tree often times promotes faster processing. Because of this limitation, most simple rules-based systems cannot realistically apply complex retailer reward program offerings—particularly if the system determines the inputs to the system, i.e., the consumer records, and performs the entire analysis at the point-of-sale (where time is limited).
While such exemplary simple offer eligibility systems and methods work for the described purposes, a need exists for improved offer eligibility systems and methods, and, in particular, for systems and methods for determining offer eligibility using a predicate logic tree against sets of input data.
SUMMARYWhile the foregoing provides a general overview of some of the various features and functionalities of the subject invention, a better understanding of the objects, advantages, features, properties and relationships of the subject invention will be obtained from the following detailed description and accompanying drawings which set forth illustrative examples and which are indicative of the various ways in which the principles of the subject invention may be employed.
The present disclosure described herein relates to systems and methods for determining offer eligibility using a predicate logic tree against sets of input data. In one example, a rewards engine identifies the relevant rules corresponding to a particular deal offered by a retail establishment. For example, the rewards engine specifies which set of consumer records it believes to be relevant to the deal for the rewards engine to analyze under the relevant rules. Each rule is comprised of one or more requirements. The rewards engine evaluates the requirements of the relevant rules and resolves any variables needed to determine whether the consumer has met the deal requirements. For some deals, the rules will require some or all of the relevant consumer records to be sorted or partially sorted before variable resolution.
To the extent that certain requirements are variables which require further manipulation for resolution, the rewards engine then reevaluates the remaining requirements and attempts to resolve the remaining variables. This process is repeated until all relevant variables are resolved. Finally, the rewards engine counts the number of times that each rule corresponding to the deal has been met and resolves the nested AND/OR relationships between the rules to ultimately determine if, and/or how many times, a consumer is entitled to the deal.
The following description is not intended to limit the scope of the description to the precise form or forms detailed herein. Instead, the following description is intended to be illustrative so that others may follow its teachings.
For performing the various tasks in accordance with the executable instructions, the example processing device 20 includes a processing unit 22 and a system memory 24 which may be linked via a bus 26. Without limitation, the bus 26 may be a memory bus, a peripheral bus, and/or a local bus using any of a variety of bus architectures. As needed for any particular purpose, the system memory 24 may include read-only memory (ROM) 28 and/or random-access memory (RAM) 30. Additional memory devices may also be made accessible to the processing device 20 by means of, for example, a hard disk drive interface 32, a magnetic disk drive interface 34, and/or an optical disk drive interface 36. As will be understood, these devices, which would be linked to the system bus 26, respectively allow for reading from and writing to a hard disk 38, reading from or writing to a removable magnetic disk 40, and for reading from or writing to a removable optical disk 42, such as a CD/DVD ROM or other optical media. The drive interfaces and their associated computer-readable media allow for the nonvolatile storage of computer-readable instructions, data structures, program modules and other data for the processing device 20. Those of ordinary skill in the art will further appreciate that other types of non-transitory computer-readable media that can store data and/or instructions may be used for this same purpose. Examples of such media devices include, but are not limited to, magnetic cassettes, flash memory cards, digital videodisks, Bernoulli cartridges, random-access memories, nano-drives, memory sticks, and other read/write and/or read-only memories.
A number of program modules may be stored in one or more of the memory/media devices. For example, a basic input/output system (BIOS) 44, containing the basic routines that help to transfer information between elements within the processing device 20, such as during start-up, may be stored in ROM 28. Similarly, the RAM 30, hard drive 38, and/or peripheral memory devices may be used to store computer-executable instructions comprising an operating system 46, one or more applications programs 48 (such as a Web browser), other program modules 50, and/or program data 52. Still further, computer-executable instructions may be downloaded to one or more of the computing devices as needed via a network connection.
To allow a user to enter commands and information into the processing device 20, input devices such as a keyboard 54 and/or a pointing device 56 are provided. While not illustrated, other input devices may include a microphone, a joystick, a game pad, a scanner, a camera, touchpad, touch screen, motion sensor, etc. These and other input devices would typically be connected to the processing unit 22 by means of an interface 58 which, in turn, would be coupled to the bus 26. Input devices may be connected to the processor 22 using interfaces such as, for example, a parallel port, game port, firewire, or a universal serial bus (USB). To view information from the processing device 20, a monitor 60 or other type of display device may also be connected to the bus 26 via an interface, such as a video adapter 62. In addition to the monitor 60, the processing device 20 may also include other peripheral output devices not shown, such as, for example, speakers, cameras, printers, or another suitable device.
As noted, the processing device 20 may also utilize logical connections to one or more remote processing devices, such as the host system server 68 having associated data repository 68A. In this regard, while the host system server 68 has been illustrated in the exemplary form of a computer, it will be appreciated that the host system server 68 may, like processing device 20, be any type of device having processing capabilities. Again, it will be appreciated that the host system server 68 need not be implemented as a single device but may be implemented in a manner such that the tasks performed by the host system server 68 are distributed amongst a plurality of processing devices/databases located at different geographical locations and linked through a communication network. Additionally, the host system server 68 may have logical connections to other third party systems via a network 12, such as the Internet, LAN, MAN, WAN, cellular network, cloud network, enterprise network, virtual private network, wired and/or wireless network, or other suitable network, and via such connections, will be associated with data repositories that are associated with such other third party systems. Such third party systems may include, without limitation, systems of banking, credit, or other financial institutions, systems of third party providers of goods and/or services, systems of shipping/delivery companies, etc.
For performing tasks as needed, the host system server 68 may include many or all of the elements described above relative to the processing device 20. In addition, the host system server 68 would generally include executable instructions for, among other things, determining offer eligibility using a predicate logic tree against sets of input data.
Communications between the processing device 20 and the host system server 68 may be exchanged via a further processing device, such as a network router (not shown) that is responsible for network routing. Communications with the network router may be performed via a network interface component 73. Thus, within such a networked environment, e.g., the Internet, World Wide Web, LAN, cloud, or other like type of wired or wireless network, it will be appreciated that program modules depicted relative to the processing device 20, or portions thereof, may be stored in the non-transitory memory storage device(s) of the host system server 68.
In the present disclosure, the executable instructions for determining offer eligibility are collectively known as a rewards engine. The rewards engine determines whether a particular consumer is eligible for a particular deal by applying one or more rules corresponding to the particular deal to a set of consumer records (e.g., data inputs or input data) unique to that consumer. In some examples, the rewards engine determines the consumer's deal eligibility at the point-of-sale. In other examples, the rewards engine determines the consumer's deal eligibility at other points in time. Each consumer record has an associated array in which the relevant data comprising the consumer record are members of the array. It will be understood by those of ordinary skill in the art that the members of the consumer records arrays may, but need not, include data relating to consumer purchase history (product information, point-of-sale date/time/location information, price information, etc.), consumer profile information, and/or consumer coupon redemption information.
While the examples herein disclose the use of a rewards engine to determine offer eligibility, it will be understood by those of ordinary skill in the art that the use of a rules engine in lieu of a rewards engine to determine a consumer's eligibility for non-offer, non-purchase, and/or non-rewards-based interactions (e.g., non-offer or result eligibility) is still within the scope of the present disclosure. For example, the rules engine may comprise executable instructions for submitting a product review online, referring a friend to enroll in a rewards or other program, completing a survey, etc. Moreover, the rules engine may comprise executable instructions for determining non-consumer related result eligibility, e.g., determining when a retailer's copy machines need servicing.
In the examples disclosed herein, the rewards engine selects which input data, e.g., consumer records or set of consumer records, to which a particular set of rules should be applied. The set of consumer records to which the rewards engine applies a particular deal's rules is known as a consideration set. The rewards engine determines the consideration set when the consumer makes a purchase. For example, suppose that the consumer purchases soda and pants from a retail establishment, and the retail establishment has a deal that the consumer receives 2,000 rewards points if the consumer is currently purchasing soda and has purchased soda at least once in the past month or is currently purchasing pants and has purchased pants at least once in the past year. The rewards engine will select the consumer's current purchase record and the consumer's records from the past month relating to soda as the consideration set for the retail establishment's soda deal. Similarly, the rewards engine will select the consumer's current purchase record and the consumer's records from the past year relating to pants as the consideration set for the retail establishment's pants deal. In other words, the rewards engine does not need to analyze every single consumer record against each and every rule corresponding to a particular deal every time that a consumer makes a purchase, although the rewards engine could do so if desired. By selecting which consumer records will be analyzed for a particular deal, the rewards engine can determine deal eligibility for more complex rules more quickly than if the rewards engine analyzed all consumer records for all deals. It will be understood by those of ordinary skill in the art that input data other than consumer records might be used by a rules engine used to determine non-offer, non-rewards, non-purchase, and/or non-consumer-based result eligibility.
The rewards engine may be implemented in a variety of environments. For example, the rewards engine may be implemented by a retail establishment having only brick-and-mortar retail locations. Alternatively, the rewards engine may be implemented by a retail establishment that operates in a multi-channel retail environment, e.g., brick-and-mortar retail locations and an Internet website. Moreover, the rewards engine might be incorporated into a gameified environment, i.e., an environment that includes one or more game-like aspects for the consumer's enjoyment.
Each rule of the example rewards engine is comprised of one or more requirements. All requirements of a rule must be met to satisfy the rule. A requirement is a comparison between a key and a value. The requirement can be a simple condition or an aggregation. A simple condition is a requirement that can be fully evaluated based on consumer records pertaining to a particular consumer purchase (e.g., the consumer's current purchase) without reference to consumer records pertaining to the consumer's other (e.g., previous) purchases. An aggregation may be a group aggregation or a global aggregation. A group aggregation is a requirement that includes a function (e.g., SUM, AVERAGE, COUNT, etc.), and that can be evaluated based on consumer records pertaining to a particular consumer purchase (e.g., the consumer's current purchase) without reference to consumer records pertaining to the consumer's other (e.g., previous) purchases. A global aggregation is a requirement that includes a function (e.g., SUM, AVERAGE, COUNT, etc.) and that requires examination of the entire consideration set of consumer records for evaluation. The key and/or the value of a requirement may be a variable. There are many possible comparisons to make between a key and a value. It is contemplated that the comparison be a primitive comparison (e.g., >, <, =, ≧, ≦, ≠, etc.) or a more complex comparison (e.g., CONTAINS, IN, NOT IN, etc.) A rule can be a parent (root) rule or a child (leaf) rule. A deal can have more than one associated parent rule, and each parent rule may have a theoretically unlimited number of child rules relating to the parent rule, or none. Child rules, if any, always have one parent (or root) rule. A set of child rules corresponding to an individual parent rule may be related to one another via the AND or the OR logic operators, but the set of child rules may not have both AND and OR operators connecting the set of child rules.
Further, a set of child rules corresponding to an individual parent rule may be related by non-AND/OR logic operators. For instance, in some examples, a parent rule may be satisfied based upon whether a plurality of child rules are satisfied. In other examples, a parent rule may be satisfied depending on a weighing function based upon if and/or how a plurality of child rules are satisfied. One possible custom weighing function assigns point values to a plurality of child rules based upon their relative importance. Applying that example custom weighing function, the parent rule would be satisfied only if the corresponding sum total of point values associated with the satisfied child rules is greater than a previously defined threshold value. In still other examples, a parent rule may be satisfied depending on whether a certain number of child rules are satisfied. It will be understood that there are other possible non-AND/OR logical relationships between parent and child rules that are within the spirit and scope of the present disclosure.
There is no theoretical limit to the number of child rules that a parent rule may have or the number of levels of child rules stemming from a parent rule. Accordingly, the present disclosure describes a rewards or rules engine that has the ability to apply complex logic (including, but not limited to, AND/OR logic) across a set of rules to determine offer (or non-offer result) eligibility. In turn, the present disclosure permits a retail establishment (or retailer) to craft as detailed and complex offers as it desires without being limited by computing or processing constraints because, according to some examples of the present disclosure, the consumer records are associated directly with the child (leaf) rules corresponding to a particular deal.
In the present example, a rule evaluation process 200 sets forth the steps to evaluate a rule. The rule evaluation process 200 starts at block 202. After the rule evaluation process 200 starts at block 202, the rewards engine, which, in this example, may reside on the host system server 68 and/or other suitable computing device, determines whether the rule has any child rules at block 204. If the rule does not have any child rules, then the rule's requirements are evaluated at block 206. (A rule requirements evaluation process 250 is discussed below.) If, at block 204, the rewards engine determines that the rule has one or more child rules, then the rewards engine obtains a list of the child rules at block 208. The first child rule identified and listed at block 208 is then evaluated at block 210, which causes the rewards engine to start the rule evaluation process 200 over again at block 202 for the child rule. This process continues until the rewards engine determines that all rules and rule requirements for a particular deal have been evaluated at block 212. Once it is determined at block 212 that there are no more rules to evaluate, the rewards engine then determines how many times the consumer is entitled to a particular deal.
First, at block 214, the rewards engine counts the number of times that each individual rule has been met. In the example process flow diagram of
Second, at block 216, the example rewards engine resolves the nested relationships between the rules (for example, the nested AND/OR relationships between the rules) corresponding to a particular deal to determine the number of times that a consumer is entitled to that particular deal.
Specifically, the example rewards engine determines the relationship between the child rules. The relationship between the child rules ultimately determines the number of times that a consumer is entitled to receive a particular deal. If any one of the child rules must be satisfied to meet the parent rule, i.e., the child rules have an OR relationship, then the count is set to the number of times that the child rule satisfied the greatest number of times has been satisfied at block 220. If all child rules both must be satisfied to meet the parent (or immediately preceding child rule if the particular deal is defined by a multi-level predicate logic tree), i.e., the child rules have an AND relationship, then the count is reduced to the number of times that the child rule satisfied the fewest number of times has been satisfied at block 222. The count is determined and the host system server 68, or other suitable computing device, eventually transmits the results to a consumer on the mobile device 20, computer 20′, etc. at block 220, and the rule evaluation process 200 terminates at block 224. The foregoing provides one example rule evaluation process. Other rule evaluation processes that incorporate a different series of steps are nevertheless within the scope of the present disclosure.
As noted above, the rule requirements evaluation process 250 is part of the rule evaluation process 200 at block 206. The rule requirements evaluation process 250 starts at block 252. Once the rule requirements evaluation process 250 commences at block 252, the simple conditions, if any, of the rule are evaluated at block 254. Next, at block 256, the group aggregations of the rule, if any, are evaluated. Next, at block 258, the global aggregations of the rule, if any, are evaluated.
At block 260, the example rewards engine then assesses whether there are any key or value variables to resolve. If at least one key or value is a variable when the rewards engine reaches block 260, then the variable or variables are resolved at block 262. Next, the rewards engine repeats blocks 254, 256, and 258 to evaluate the previously variable-laden key/value comparisons. This process repeats until there are no more variables to resolve at block 260, at which point the rule requirements evaluation process 250 terminates at block 264.
Each rule Un, has its own set of requirements, denoted Ra . . . Rz. Each such requirement is a comparison between a key (kn) and a value (vn). It is within the spirit and scope of the present disclosure that the key signify a wide variety of record parameters, including, by way of example only, a timestamp, a price, a particular category of product, a particular model number of a product, etc. It is further contemplated that the key may denote an aggregation, e.g., a summation, an average, a count, etc. Moreover, as noted elsewhere, the keys and values associated with a particular requirement may be variables. An operator (OPn) defines the comparison between each key/value pair. There are numerous contemplated operators including, but not limited to, =, <, >, ≠, ≦, and ≧.
A set of consumer records (or simply “consumer records” or “data inputs”), i.e., Da . . . Dz, define the kn and vn inputs relevant to a particular requirement of a particular rule. The set of consumer records may be stored in the associated data repository 68A of the host system server 68. A set of consumer records may be relevant to a particular requirement of a single rule, multiple requirements of a single rule or multiple requirements across several rules. Alternatively, the set of consumer records may not be relevant to any rule. While the rewards engine selects which consumer records it believes to be relevant to a deal, inclusion of an ultimately irrelevant consumer record will not affect the accuracy of the rewards engine in determining whether a particular consumer is entitled to the deal. The rewards engine will simply discard the irrelevant consumer record during the rule requirements evaluation process 250. It is in the retailer's best interest to apply the rewards engine only to those consumer records that are most likely to trigger a deal, as the inclusion of multiple, irrelevant consumer records may diminish the ability of the rewards engine to quickly analyze the consumer records and determine whether the consumer is entitled to a particular deal.
Beginning with rule 26 at node 502, rule 26 has a first requirement 502a, which requires that the consumer purchase a Sony Blu-Ray player. The first requirement 502a is represented in
Rule 27 at node 504 has three requirements. A first requirement 504a requires that the consumer purchase a Disney Blu-Ray DVD. The first requirement 504a is represented in
Rule 0 at node 600 is a parent (or root) rule and rules 1 and 4 at nodes 602 and 608 respectively are child rules. The logic relationship between child rules 1 and 4 at nodes 602 and 608 respectively is OR, which means that either rule 1 at node 602 or rule 4 at node 608 must be satisfied to meet parent rule 0 at node 600 and, in turn, for the consumer to be entitled to the deal. In this example, rule 1 at node 602 also has two child rules, rules 2 and 3 at nodes 604 and 606 respectively. The logic relationship between child rules 2 and 3 at nodes 604 and 606 respectively is AND, which means that both rules 2 and 3 at nodes 604 and 606 respectively must be satisfied to meet rule 1 at node 602. Rule 4 at node 608 has three child rules, rules 5, 6, and 7 at nodes 610, 612, and 614 respectively. The logic relationship between child rules 5, 6, and 7 at nodes 610, 612, and 614 respectively is AND, which means that rules 5, 6, and 7 at nodes 610, 612, 614 respectively must all be satisfied to meet rule 4 at node 608.
Beginning with rule 2 at node 604, rule 2 has a first requirement 604a, which requires that the consumer purchase a pack of baseball cards. The first requirement 604a is represented in
Rule 3 at node 606 has two requirements. A first requirement 606a requires that the consumer purchase gum. The first requirement 606a is represented in
In this example, rule 5 at node 610 has a first requirement 610a which requires that the consumer purchase non-gum candy. The first requirement 610a is represented in
Rule 6 at node 612 has a first requirement 612a which requires that the consumer purchase a comic book. The first requirement 612a is represented in
Rule 7 at node 614 has a first requirement 614a which requires that the consumer redeem coupon 12356. The first requirement 614a is represented by COUPON_CODE IN(12356). A second requirement 614b requires that the consumer redeem coupon 12356 at least one time. The second requirement 614b is represented by SUM(UNITS)≧1. If at least one record satisfies these two requirements of rule 7 at node 614, if at least one record satisfies rule 5 at node 610, and at least one record satisfies rule 6 at node 612, then rule 4 at node 608 is satisfied.
As noted in
As noted above, as long as rule 1 at node 602 or rule 4 at node 608 is satisfied, then rule 0 at node 600 is satisfied and the rewards engine will award the consumer 10,000 rewards program points.
Although certain examples have been described herein, the scope of coverage of this patent is not limited thereto. On the contrary, this patent covers all processes, methods, and systems fairly falling within the scope of the appended claims either literally or under the doctrine of equivalents.
Claims
1. A computer-readable media having stored thereon computer executable instructions, wherein the instructions perform steps for determining result eligibility using a predicate logic tree against sets of input data comprising:
- identifying a plurality of rules, wherein: the plurality of rules have a logical relationship between or among each other; each of the plurality of rules comprises at least one requirement of a set of requirements; and at least one of the plurality of rules is satisfied if a corresponding at least one requirement is met;
- selecting input data for analysis under the plurality of rules;
- evaluating the set of requirements defining the plurality of rules against the input data to determine if the set of requirements are met; and
- resolving the logical relationship of the plurality of rules to determine result eligibility.
2. The computer-readable media as defined in claim 1, wherein the logical relationship of the plurality of rules is a nested AND/OR relationship.
3. The computer-readable media as defined in claim 1, wherein the set of requirements comprises at least one simple condition and at least one aggregation.
4. The computer-readable media as defined in claim 1, wherein the instructions are executed in a multi-channel retail environment.
5. The computer-readable media as defined in claim 1, wherein the instructions are executed in a gameified environment.
6. The computer-readable media as defined in claim 1, wherein the instructions perform steps for determining a consumer's offer eligibility.
7. The computer-readable media as defined in claim 6, wherein the instructions further perform steps for determining whether the plurality of rules comprise at least one sub-rule.
8. The computer-readable media as defined in claim 1, wherein the input data comprises a plurality of consumer records.
9. The computer-readable media as defined in claim 8, wherein the instructions further comprise one of sorting or partially sorting at least two consumer records of the plurality of consumer records.
Type: Application
Filed: Jul 16, 2012
Publication Date: Dec 19, 2013
Applicant: Sears Brands, LLC (Hoffman Estates, IL)
Inventor: Espen Zachrisen (Bartlett, IL)
Application Number: 13/549,760
International Classification: G06Q 30/02 (20120101);