Dynamic constraint satisfaction problem solver with sub-problem placeholder
AssigneeOracle International Corporation
InventorsSteven A. Huberman, Claire M. Bagley, Martin P. Plotkin, David J. Kulik
Life of this patent
Estimating the term…
Abstract
A dynamic constraint solver for solving a constraint satisfaction problem network that includes a plurality of nodes and a plurality of constraints determines a cardinality for a set of sub-problems. The cardinality is a numeric domain that represents the minimum number of instances in a port. The solver determines if a number of identifiable instances of sub-problems is less than the minimum number of instances. The solver then causes a user interface to display the identifiable instances and a placeholder for each instance that is below the minimum number of instances and is not identifiable.
Claims20
A non-transitory computer readable medium having instructions stored thereon that, when executed by a processor, cause the processor to function as a dynamic constraint solver for solving a constraint satisfaction problem that comprises a plurality of nodes and a plurality of constraints, the solving comprising:
- determining a cardinality for a set of sub-problems that are associated with a problem, wherein the cardinality comprises a minimum number of instances of each sub-problem of the set of sub-problems;
- determining if a number of identifiable instances of sub-problems is less than the minimum number of instances;
- and
- displaying a user interface that displays the identifiable instances and a placeholder for each instance that is below the minimum number of instances and is not identifiable, wherein each placeholder informs a user that an additional instance of the sub-problem needs to be configured to solve the constraint satisfaction problem.
A computer system for solving a constraint satisfaction problem comprising problems and sub-problems, the system comprising:
- a processor;
- a computer-readable medium coupled to the processor and storing instructions that when executed by the processor generate:
- a module for tracking a cardinality for a set of sub-problems that are associated with a problem, wherein the cardinality comprises a minimum number of instances of each sub-problem of the set of sub-problems;
- and
- a user interface comprising a listing of identifiable instances of sub-problems for the set and at least one placeholder for each instance of sub-problems for the set that is not identifiable and is below the minimum number of instances wherein each placeholder informs a user that an additional instance of the sub-problem needs to be configured to solve the constraint satisfaction problem.
A computer implemented method of solving a constraint satisfaction problem comprising:
- storing a constraint satisfaction problem network that comprises a set of sub-problems that are associated with a problem having a cardinality that comprises a minimum number of instances of each sub-problem of the set of sub-problems;
- determining a number of identifiable instances of the sub-problems;
- and
- if the number of identifiable instances is less than the minimum number of instances, causing a user interface to display a listing of the identifiable instances and at least one placeholder for each instance of sub-problems for the set that is not identifiable and is below the minimum number of instances, wherein each placeholder informs a user that an additional instance of the sub-problem needs to be configured to solve the constraint satisfaction problem.
Dependencies are inferred from the claim text.