Dynamic constraint satisfaction problem solver with sub-problem placeholder
US8301582B2 · kind B2 · utility
5Cited by
7References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 15, 2009 |
| Grant date | Oct 30, 2012 |
| Priority date | — |
| Expiry date | Mar 18, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06N5/01
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.