US2013339120A1PendingUtilityA1

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

Assignee: ZACHRISEN ESPENPriority: Jun 13, 2012Filed: Jul 16, 2012Published: Dec 19, 2013
Est. expiryJun 13, 2032(~5.9 yrs left)· nominal 20-yr term from priority
Inventors:Espen Zachrisen
G06Q 30/02
56
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

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.

Claims

exact text as granted — not AI-modified
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.

Join the waitlist — get patent alerts

Track US2013339120A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.