Decomposing configuration problems

Data processing: artificial intelligence – Knowledge processing system – Knowledge representation and reasoning technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C706S045000

Reexamination Certificate

active

08078562

ABSTRACT:
An artifact is configured whose constituting components and features are selectable via parameters in an interrelated set of parameters. A range of consistent configurations for the artifact is defined by a set of constraints restricting which variable values that are simultaneously selectable. A proposed storage means stores a problem description in the form of a part-of hierarchy and a list of step definitions. The part-of hierarchy includes at least two different parts and each step definition includes a pointer to a respective part in the part-of hierarchy. A processing means solves constraint satisfaction problems in response to input data designating parameter settings, and an application module creates and executes step instances, which are based on the list of step definitions. The step instances are executed sequentially, and the execution of each step instance involves: creating a CSP based on the part to which the pointer of the corresponding step definition points and any descendents to this part, presenting a range of variables wherein each variable has at least one selectable value assignable via a user-committed setting in the input data, solving the CSP of the step instance based on the user-committed settings and any variable values resulting from any preceding step instances in said sequence, and presenting the set of resulting variable values. The application module repeatedly prompts a user to enter input data to represent user-committed settings until all the step instances in said sequence have been executed.

REFERENCES:
patent: 5515524 (1996-05-01), Lynch et al.
patent: 5874955 (1999-02-01), Rogowitz et al.
patent: 6223170 (2001-04-01), Skovgaard
patent: 6336110 (2002-01-01), Tamura et al.
patent: 2007/0094175 (2007-04-01), Axling
Freeman-Benson, A Module Mechanism for Constraints in Smalltalk, OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications, vol. 24 Issue 10, Oct. 1989, pp. 389-396.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Decomposing configuration problems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Decomposing configuration problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposing configuration problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4255639

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.