IP Library Granted Patent US 12,321,955
Granted Patent B2
US 12,321,955 · App. 18/121,198 · Granted Jun 3, 2025

Systems and methods for determining offer eligibility using a predicate logic tree against sets of input data

Inventor: Espen Zachrisen (Bartlett, IL)
Assignee: TRANSFORM SR BRANDS LLC
G06Q30/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,321,955
App. No.
18/121,198
Granted
Jun 3, 2025
Kind
B2
Abstract

Example computer executable instructions for determining a consumer's offer eligibility using a predicate logic tree against sets of input data are provided. In particular, the disclosed examples recite a rewards engine capable of determining a consumer's offer eligibility using a predicate logic tree against sets of input data. The rewards engine applies rules that are relevant to a particular deal offered by a retail establishment to the consumer's records to determine the consumer's offer eligibility. In some examples, the rewards engine sorts or partially sorts some or all of the consumer's records to determine the consumer's offer eligibility.

Claims (35)

1. A method, comprising:

identifying a plurality of rules of a deal offered by a retail establishment, wherein the plurality of rules have a nested AND/OR relationship in a predicate logic tree;

evaluating a first rule, as a first instance of a rule evaluation, with respect to a consumer record located in a data repository;

evaluating each rule, nested within the first rule, as a second instance of the rule evaluation, wherein:

the plurality of rules comprises a first rule type and a second rule type,

a rule of the first rule type comprises one or more additional rules,

a rule of the second rule type comprises one or more requirements, and

each additional rule is evaluated as a next instance of the rule evaluation;

selecting a plurality of a consumer records associated with a consumer;

associating the respective plurality of consumer records with a corresponding rule according to the predicate logic tree, wherein:

the one or more requirements of each rule are applied to a respective set of consumer records, and

the respective sets of consumer records for each rule are different sets selected from the consumer records;

evaluating the one or more requirements of each corresponding rule against the respective set of consumer records; and

resolving the nested AND/OR relationship of the plurality of rules.

2. The method according to claim 1 , wherein the plurality of requirements comprises one or more simple conditions and one or more aggregations.

3. The method according to claim 2 , wherein the one or more simple conditions comprise a requirement that is evaluated based on a current purchase of the consumer without reference to the consumer records of the consumer related to previous purchases.

4. The method according to claim 2 , wherein the one or more aggregations comprise a group aggregation that comprises a function that is evaluated based on the current purchase of the consumer without reference to the consumer records of the consumer related to previous purchases.

5. The method according to claim 2 , wherein the one or more aggregations comprise a global aggregation that comprises a function that is evaluated based on the consumer records of the consumer that is relevant to the deal offered by the retail establishment.

6. The method according to claim 1 , comprising sorting or partially sorting at least two consumer records of the plurality of consumer records.

7. The method according to claim 1 , comprising tracking eligibility of the consumer for the deal.

8. The method according to claim 1 , wherein the method is performed in a multi-channel retail environment.

9. The method according to claim 1 , wherein the method is performed in a gamified environment.

10. The method according to claim 1 , wherein the predicate logic tree is operable to provide an output that is associated with an array that comprises members that comprise one or more of a particular rule, a particular consumer record, and a number of times that the particular rule has been met by the particular consumer record.

11. The method according to claim 1 , comprising:

resolving one or more variables of the set of requirements; and

repeating the steps of evaluating and resolving until all variables are resolved.

12. The method according to claim 1 , wherein the plurality of rules relates to whether a first item is being purchased by the consumer.

13. The method according to claim 12 , wherein the plurality of rules relates to whether a second item is being purchased by the consumer.

14. The method according to claim 13 , wherein the plurality of rules relates to whether the second item was previously purchased by the consumer within a particular time period.

15. The method according to claim 12 , wherein the plurality of rules relates to whether the first item was previously purchased by consumer within a particular time period.

16. The method according to claim 1 , wherein the selected plurality of consumer records for the consumer making the purchase is selected as a subset of all the consumer records for the consumer.

17. The method according to claim 1 , wherein a relationship between two or more rules determines a number of times that the consumer is entitled to receive the deal.

18. The method according to claim 1 , comprising performing a third instance of the rule evaluation for each of a plurality of rules nested within the second instance of the rule evaluation.

19. The method according to claim 1 , wherein the plurality of rules comprises a rule that provides for sorting of a portion of the plurality of consumer records.

20. The method according to claim 1 , wherein the set of requirements comprises one or more simple conditions and one or more aggregations, wherein the one or more aggregations comprise one or more functions.

Assignments (2)
SECURITY INTEREST Recorded Jun 13, 2023
From: TRANSFORM SR BRANDS LLC
To: JPP, LLC
Reel/Frame 063929/0294 →
SECURITY INTEREST Recorded Jun 5, 2023
From: TRANSFORM SR BRANDS LLC
To: CANTOR FITZGERALD SECURITIES
Reel/Frame 063857/0637 →
Continuity (4)
Continuation 17539881 · Dec 1, 2021
Continuation 16679896 · Nov 11, 2019
Continuation 13495228 · Jun 13, 2012
Related Publication 20230222520A1 · Jul 13, 2023
References Cited (15)
US 7039607B2 · Watarai et al. · 2006 [cited by applicant]
US 7467106B1 · Levine et al. · 2008 [cited by applicant]
US 8091142B2 · Liu et al. · 2012 [cited by applicant]
US 8116453B2 · Shnowske et al. · 2012 [cited by applicant]
US 10475049B2 · Zachrisen · 2019 [cited by applicant]
US 11238464B2 · Zachrisen · 2022 [cited by applicant]
US 11631090B2 · Zachrisen · 2023 [cited by examiner]
US 20070239521A1 · Khadpe et al. · 2007 [cited by applicant]
US 20100263018A1 · Cozart et al. · 2010 [cited by applicant]
European Office Communication Appln No. 13 804 077.9, dated Jun. 27, 2019. [cited by applicant]
Anonymous: “Computer—Wikipedia, the free encyclopedia”, Jun. 5, 2012 (Jun. 5, 2012), XP055591826, Retrieved from the Internet: URL: https://web.archive.org/web/20120605020757/https://en.wikipedia.org/wiki/Computer [retr… [cited by applicant]
Australian Government, Examination Report in Appln No. 2013274744, dated Oct. 26, 2017. [cited by applicant]
European Office Communication with extended European search report Appln No. 13804077.9, dated Dec. 7, 2015. [cited by applicant]
Int'l Preliminary Report on Patentability Appln No. PCT/US2013/042994 dated Dec. 24, 2014. [cited by applicant]
Int'l Search Report and Written Opinion Appln No. PCT/US2013/042994 dated Sep. 30, 2013. [cited by applicant]