Reconciling combinations of transactions
First Claim
Patent Images
1. A computer-implemented method for reconciling a first transaction in a first list with a combination of at least two transactions in a second list, each transaction having a value, the method comprising:
- obtaining the first transaction;
obtaining the second list of transactions;
determining whether the value of the first transaction corresponds to a combination of the values of a subset of transactions in the second list; and
responsive to the value of the first transaction corresponding to the combination of values of the subset of transactions, indicating a match between the first transaction and the subset of transactions,wherein determining whether the value of the first transaction corresponds to a combination of the values of a subset of transactions in the second list comprises performing a recursive submethod using a first input parameter including the value of the first transaction and a second input parameter including the subset of transactions in the second list, andwherein performing the recursive submethod comprises;
responsive to one value of a transaction in the second input parameter equaling the first input parameter, returning a transaction list including the transaction having the one value,responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing only one transaction, returning an indicator that no match was found, andresponsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing more than one transaction, performing the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected transaction and the modified first input parameter being obtained by subtracting the value of the selected transaction from the first input parameter.
1 Assignment
0 Petitions
Accused Products
Abstract
A system, method, and computer program product provide automated reconciliation of transactions. A transaction in a first list is reconciled with a combination of two or more transactions in a second list. A function, which may be implemented as a recursive function, successively searches for combinations of transactions in the second list in order to obtain a match for a transaction in the first list.
-
Citations
26 Claims
-
1. A computer-implemented method for reconciling a first transaction in a first list with a combination of at least two transactions in a second list, each transaction having a value, the method comprising:
-
obtaining the first transaction; obtaining the second list of transactions; determining whether the value of the first transaction corresponds to a combination of the values of a subset of transactions in the second list; and responsive to the value of the first transaction corresponding to the combination of values of the subset of transactions, indicating a match between the first transaction and the subset of transactions, wherein determining whether the value of the first transaction corresponds to a combination of the values of a subset of transactions in the second list comprises performing a recursive submethod using a first input parameter including the value of the first transaction and a second input parameter including the subset of transactions in the second list, and wherein performing the recursive submethod comprises; responsive to one value of a transaction in the second input parameter equaling the first input parameter, returning a transaction list including the transaction having the one value, responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing only one transaction, returning an indicator that no match was found, and responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing more than one transaction, performing the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected transaction and the modified first input parameter being obtained by subtracting the value of the selected transaction from the first input parameter. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer-implemented method for matching a first value with a combination of at least two values in a list of values, the method comprising:
-
obtaining the first value; obtaining the list of values; performing a recursive submethod, using a first input parameter including the first value and a second input parameter including the list of values, to determine whether the first value corresponds to a combination of values from the list of values; and responsive to the first value corresponding to the combination of values, indicating a match for the first values, wherein performing the recursive submethod comprises; responsive to one value in the second input parameter equaling the first input parameter, returning the list of values including the one value, responsive to no values in the second input parameter equaling the first input parameter and the second input parameter containing only one value, returning an indicator that no match was found, and responsive to no values in the second input parameter equaling the first input parameter and the second input parameter containing more than one value, performing the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected value and the modified first input parameter being obtained by subtracting the selected value from the first input parameter. - View Dependent Claims (9, 10, 11)
-
-
12. A computer program product comprising a computer-usable medium having computer-readable code embodied therein for reconciling a first transaction in a first list with a combination of at least two transactions in a second list, each transaction having a value, comprising:
-
computer-readable program code devices configured to cause a computer to obtain the first transaction; computer-readable program code devices configured to cause a computer to obtain the second list of transactions; computer-readable program code devices configured to cause a computer to determine whether a value of the first transaction corresponds to a combination of values of a subset of transactions in the second list; and computer-readable program code devices configured to cause a computer to, responsive to the value of the first transaction corresponding to the combination of values of the subset of transactions, indicate a match between the first transaction and the subset of transactions, computer-readable program code devices configured to cause a computer to perform a recursive submethod using a first input parameter including the value of the first transaction and a second input parameter including the subset of transactions in the second list, comprising; responsive to one value of a transaction in the second input parameter equaling the first input parameter, return a transaction list including the transaction having the one value, responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing only one transaction, return an indicator that no match was found, and responsive to no values of the transactions in the second input parameter equaling the first input parameter and the second input parameter containing more than one transaction, perform the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected transaction and the modified first input parameter being obtained by subtracting the value of the selected transaction from the first input parameter. - View Dependent Claims (13, 14, 15, 16)
-
-
17. A computer program product comprising a computer-usable medium having computer-readable code embodied therein for matching a first value with a combination of at least two values in a list of values, the computer program product comprising:
-
computer-readable program code devices configured to cause a computer to obtain the first value; computer-readable program code devices configured to cause a computer to obtain the list of values; computer-readable program code devices configured to cause a computer to perform a recursive submethod, using a first input parameter including the first value and a second input parameter including the list of values, to determine whether the first value corresponds to a combination of values from the list of values; and computer-readable program code devices configured to cause a computer to, responsive to the first value corresponding to the combination of values, indicate a match for the first value, wherein the recursive submethod comprises; responsive to one value in the second input parameter equaling the first input parameter, return the list of values including the one value, responsive to none of the values in the second input parameter equaling the first input parameter and the second input parameter containing only one value, return an indicator that no match was found, and responsive to none of the values in the second input parameter equaling the first input parameter and the second input parameter containing more than one value, perform the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected value and the modified first input parameter being obtained by subtracting the selected value from the first input parameter. - View Dependent Claims (18, 19)
-
-
20. A system for reconciling a first transaction in a first list with a combination of at least two transactions in a second list, each transaction having a value, the system comprising:
-
a first input device, for obtaining the first transaction; a second input device, for obtaining the second list of transactions; coupled to the first and second input devices, a memory for storing the first transaction and the second list; coupled to the memory, a match determination module for determining whether the value of the first transaction corresponds to a combination of the values of a subset of transactions in the second list; and coupled to the match determination module, a match indication module for, responsive to the value of the first transaction corresponding to the combination of values of the subset of transactions, indicating a match between the first transaction and the subset of transactions, wherein the match determination module performs a recursive submethod using a first input parameter including the value of the first transaction and a second input parameter including the subset of transactions in the second list, and wherein the recursive submethod comprises; responsive to one value of a transaction in the second input parameter equaling the first input parameter, returning a transaction list including the transaction having the one value, responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing only one transaction, returning an indicator that no match was found, and responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing more than one transaction, performing the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected transaction and the modified first input parameter being obtained by subtracting the value of the selected transaction from the first input parameter. - View Dependent Claims (21, 22, 23)
-
-
24. A system for matching a first value with a combination of at least two values in a list of values, the system comprising;
-
a first input device, for obtaining the first value; a second input device, for obtaining the list of values; coupled to the first input device and the second input device, a memory for storing the first value and the list of values; coupled to the memory, a recursive function module, for performing a recursive function, using a first input parameter including the first value and a second input parameter including the list of values, to determine whether the first value corresponds to a combination of values from the second list; and coupled to the recursive function module, a match indicator for, responsive to the first value corresponding to the combination of values, indicating a match for the first value, wherein the recursive function module; responsive to one value of a transaction in the second input parameter equaling the first input parameter, returns a transaction list including the transaction having the one value, responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing only one transaction, returns an indicator that no match was found, and responsive to no values of transactions in the second input parameter equaling the first input parameter and the second input parameter containing more than one transaction, performs the recursive submethod using a modified first input parameter and a modified second input parameter, the modified second input parameter omitting a selected value and the modified first input parameter being obtained by subtracting the selected value from the first input parameter. - View Dependent Claims (25, 26)
-
Specification