Sequence generation using a constraint satisfaction problem formulation
US6430573B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | May 25, 1999 |
| Grant date | Aug 6, 2002 |
| Priority date | — |
| Expiry date | May 25, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99948
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method and system for automatic generation of sequences (notably temporal or spatial sequences) from items in a database involves the organisation of the data in a generic format, and the formulation of the problem as a Constraint Satisfaction Problem using special constraint classes. The database format includes attribute values referring to a predetermined taxonomy allowing similarity and difference between the respective values to be evaluated. The special constraint classes include the classes of cardinality constraints (which allow it to be specified that the number of items whose attribute belongs to a given set is within a particular range, and/or that the number of values of an attribute is within a specified range), similarity or dissimilarity constraints (which allow it to be specified that successive items must be similar or different from each other) and global difference constraints (which allow it to be specified that the respective values of a given attribute for all items in a range must be different from each other).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.