valued constraints islands of tractability. agenda the soft constraint formalism (5 minutes) valued...
TRANSCRIPT
![Page 1: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/1.jpg)
Valued Constraints
Islands of Tractability
![Page 2: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/2.jpg)
Agenda
• The soft constraint formalism (5 minutes)
• Valued Constraint Languages (5 minutes)
• Hard and Easy Languages (10 minutes)
• Reasoning about Tractability (10 min)
• Languages and multimorphisms (15 min)
• Open Questions (5 minutes)
![Page 3: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/3.jpg)
Soft Constraints
• Classical constraint satisfaction problems answer questions about feasibility.
• We can give costs to tuples in constraint relations – crisp case just 0 and 1.
• This allows us to compare complete assignments by aggregating costs for individual constraints
• …and so to answer optimization questions
![Page 4: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/4.jpg)
Soft Constraint Problem Instance
• A set of problem variables;• A domain of values;• A set of constraints;• A set of costs (valuation structure)
• Each constraint has a:– Scope: list of concerned variables;– Cost Function: cost of each assignment.
![Page 5: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/5.jpg)
Assignment Costs: Axioms? is the best value.> is the worst value. models projection and is a commutative, associative and idempotent. © models aggregation and is commutative and associative;
8 a : (a > = a) Æ (a © ?) = a;8 a : (a ? = ?) Æ (a © >) = >;
© distributes over :8 a,b,c : (a © (b c) = (a © b) (a © c)).
We then define: (a · b) , (a b = b).
With respect to · we can show and © are monotonic.
![Page 6: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/6.jpg)
VCSP framework
• Here we insist · is totally ordered.
• Then the costs are a valuation structure.
• We write:– 0 to mean ? (the best value);– 1 to mean > (the worst value);– Projection ( ) becomes minimum;
• If © is strictly monotonic then we can also subtract costs (we get ª).
![Page 7: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/7.jpg)
Valued CSP Instance
• A set of problem variables;• A domain of values;• A set of constraints;• A set of costs (valuation structure)
• Each constraint has a:– Scope: list of concerned variables;– Cost Function: cost of each assignment.
A totally ordered set with a strictly monotonic aggregation
operator
![Page 8: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/8.jpg)
Soft Constraint Languages
![Page 9: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/9.jpg)
A voyage of Discovery
• In general the VCSP is NP-hard.
• It generalizes CSP.
![Page 10: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/10.jpg)
Possible Islands
• The constraint scopes form a hypergraph.
• The cost functions are a set of functions from the domain to a valuation structure.
• We could restrict the hypergraph structure or the types of cost functions of a set of instances to find an island of tractability.
• …
![Page 11: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/11.jpg)
Valued Constraint Languages
• For any domain D, and valuation structure a k-ary cost function is a mapping from Dk to .
• A valued constraint language (for D and ) is any set of cost functions.
![Page 12: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/12.jpg)
Example: Relations
• A relation can be seen as a cost function that only takes the values 0 and 1.
• …So the VCSP obtained by restricting to functions with values 0 and 1 is the classical CSP.
• This gives the first few islands of tractability.
![Page 13: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/13.jpg)
Example: MAX-CSP• The corresponding MAX-CSP instance for
a CSP instance can be obtained replacing each constraint <,with scope and relation , by the valued constraint <,> where:
• The VCSP problem for the language of 0/1 cost functions is just MAX-CSP.
![Page 14: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/14.jpg)
Hard and Easy Languages
![Page 15: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/15.jpg)
Boolean Not Equals
Two NP-hard Languages
Ternary Equality, and all Unary Cost functions
Variable:
Cost 1
Cost 0
Legend
![Page 16: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/16.jpg)
Submodular Set Functions
• Let S be any set and a real valued function.
• We say that is submodular if– (X) + (Y) ¸ (X [ Y) + (X Å Y)
• We can use these functions to express optimization problems.
• We know that this optimization (minimization) problem is tractable (seventh power of problem size).
For example: (X) = |X|
For example: (X) = 5
![Page 17: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/17.jpg)
Submodular Cost Functions
• We can represent a submodular function on a set as a cost function on a list of Boolean (0/1) variables (valued constraint):– Union becomes MAX;– Intersection becomes MIN.
• We can extend the definition to non-Boolean ordered domains.
• This (finite cost) language is still tractable.
![Page 18: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/18.jpg)
Submodular Cost Functions
• This cost function is submodular
• And this one is not.
![Page 19: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/19.jpg)
Reasoning about Tractability
![Page 20: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/20.jpg)
Tractability?
• We have a complete characterization of tractable Boolean MAX-SAT languages.– There are just three maximal tractable
languages: 0-valid, 1-valid or 2-monotone [Creignou 1995]
• We have a characterization of the tractability of crisp constraint languages.– They have a non-trivial polymorphism
[Jeavons, Cohen, Gyssens 1996]
![Page 21: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/21.jpg)
Tractability?
• We generalise the notion of a polymorphism to a multimorphism.
• The maximal tractable MAX-SAT languages are characterised by single multimorphisms.
• So this is a good place to search for islands of tractability.
![Page 22: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/22.jpg)
A Multimorphism 1: Technical
![Page 23: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/23.jpg)
A Multimorphism 2: Definition
![Page 24: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/24.jpg)
A Multimorphism 3: Example
![Page 25: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/25.jpg)
A Multimorphism 4: Example
![Page 26: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/26.jpg)
Expressibility
• If multimorphisms are to be able to capture complexity then it has to be the case that those cost functions expressed by have the multimorphisms of .
• Since valued languages extend crisp languages it had better be the case that polymorphisms lead to analogous multimorphisms (and vice-versa).
![Page 27: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/27.jpg)
Languages Characterised by Multimorphisms
![Page 28: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/28.jpg)
Characterisation
• It means much to say that every known example of a tractable language indeed has a multimorphism.
• It means more still to observe that they are all characterised by single multimorphisms.
• It means even more to observe that the intractable languages have no multimorphisms.
![Page 29: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/29.jpg)
Boolean Not Equals
Two NP-hard Languages
Ternary Equality, and all Unary Cost functions
Variable:
Cost 1
Cost 0
Legend
These two languages have no
multimorphisms (to speak of)
![Page 30: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/30.jpg)
Majority/Minority FunctionsCompletely characterised by a
multimorphism.
![Page 31: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/31.jpg)
Max,Max FunctionsCompletely characterised by a
multimorphism.
![Page 32: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/32.jpg)
ConstantCompletely characterised by a
multimorphism.
![Page 33: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/33.jpg)
Min,Max FunctionsNearly characterised by a
multimorphism.
![Page 34: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/34.jpg)
Open Questions
![Page 35: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/35.jpg)
Expressibility and Multimorphisms
• Do multimorphisms capture expressibility?– We have done some work on this and cannot
show that it is not true!
• Do multimorphisms capture complexity? (or are we just lucky?)– In the submodular case we have no proof for
non-binary that allowing infinite costs is tractable.
![Page 36: Valued Constraints Islands of Tractability. Agenda The soft constraint formalism (5 minutes) Valued Constraint Languages (5 minutes) Hard and Easy Languages](https://reader036.vdocuments.net/reader036/viewer/2022062423/5697bf821a28abf838c85b99/html5/thumbnails/36.jpg)
Algebra of Multimorphisms
• If multimorphisms are the right thing to study then have they been studied before?
• We achieved a great deal by discovering the (known) work on clones and polymorphisms.