Sequence generation using a constraint satisfaction problem formulation
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 6, 2002
Grant Date -
N/A
app pub date -
May 25, 1999
filing date -
May 27, 1998
priority date (Note) -
Expired
status (Latency Note)
Importance
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).
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully