Decomposition Methods For Arbitrary Problems
The following methods can be used for translating an arbitrary constraint satisfaction problem, either binary or otherwise. Since they can also be used on binary problems, they can also be used on the result of making constraints binary, either by translating to the dual problem or by using hidden variables.
Some of these methods associate constraints with nodes of the tree, and define width taking into account the number of constraints associated with nodes. This may reduce the width of some problems. For example, a decomposition in which ten variables are associated with each node has width ten; however, if each of these sets of ten variables is the scope of a constraint, each node can be associated that constraint instead, resulting in width one.
Read more about this topic: Decomposition Method (constraint Satisfaction)
Famous quotes containing the words methods, arbitrary and/or problems:
“We can best help you to prevent war not by repeating your words and following your methods but by finding new words and creating new methods.”
—Virginia Woolf (1882–1941)
“Pity on the person who has become accustomed to seeing in necessity something arbitrary, who ascribes to the arbitrary some sort of reason, and even claims that following that sort of reason has religious value.”
—Johann Wolfgang Von Goethe (1749–1832)
“The three great problems of this century, the degradation of man in the proletariat, the subjection of women through hunger, the atrophy of the child by darkness.”
—Victor Hugo (1802–1885)