This patent has been approved. Tacton now has two patents.

Description of the patent:

A configuration problem may be represented and solved as a Constraint Satisfaction Problem (CSP) (ref our previous patent). However a CSP may require exponential time to solve and requires the number of variables to be known beforehand.

The object of the invention is to provide a method and a program module for decomposing the problem into smaller sub problems and allowing sub problems to have variable number of variables in a way that is natural for the end-user and the modeller. Thereby allowing larger problems to be solved and relaxing the need of knowing the number of variables beforehand.

This is done by using a modelling language specialized for configuration instead of modelling directly as a CSP.
The modelling language allows for defining a description of the configuration problem and also how it should be executed and decomposed.
The decomposition is done by defining a sequence of steps.

Each step is associated with a part of the configuration problem and during execution an appropriate CSP will be built.

Leave a Comment

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes:

<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

Blog comments policy

This is a moderated blog and we welcome and encourage comments, critique, questions or suggestions that are relevant to the topic.
There are however, some instances where comments will be edited or deleted:
1. Comments deemed to be spam i.e., any attempt to advertise, solicit, or otherwise promote goods and services. You may, however, post a link to your site or your most recent blog post.
2. Comments containing language or concepts that could be deemed offensive.

For any questions regarding this policy, please don’t hesitate to contact us using the contact form.