SlideShare a Scribd company logo
1 of 34
CSP: Algorithms and Dichotomy Conjecture Andrei A. Bulatov Simon Fraser University
Constraint Satisfaction Problem I CSP(  ) Definition: Instance:   ( V ; A ; C )  where    V  is a finite set of variables    A  is a set of values    C   is a set of constraints  Question:   whether there is  h :  V     A   such that, for any  i , is true where each  belongs to  
Constraint Satisfaction Problem II u - v - w - x - y - Q ( u,v,w ) R ( w,x ) R ( x,y ) S ( y,u )
[object Object],Examples:  3-COL u v w x
Examples:  Linear Equations, SAT Linear Equations :   3-SAT = CSP(  ) :
Invariants and Polymorphisms Pol(  ) denotes the set of all polymorphisms of relations from   Definition  A relation  R  is  invariant  with respect to an   n - ary  operation  f   (or  f   is a  polymorphism  of  R ) if, for any  tuples  the tuple obtained  by applying  f   coordinate-wise is a member of  R
[object Object],[object Object],Polymorphisms: Affine Relations If  are solutions then
[object Object],[object Object],[object Object],Polymorphisms: 2-SAT
[object Object],Polymorphisms: 3-COL
Polymorphisms and Complexity Theorem ( Jeavons; 1998 )  If     ,     are constraint languages such that  Pol(   )    Pol(   ), then  CSP (   ) is  log space reducible to  CSP (   ) 1 2 2 1 2 1 Larose, Tesson, 2007: This reduction can be made
[object Object],[object Object],[object Object],Good Polymorphisms: Semilattice There is always a unique maximal element max( x,y ) gcd( x,y )  0 1 1 2 0 2 1 3 6 4 5
Good Polymorphisms: Semilattice u - v - w - x - y -
Good Polymorphisms: Semilattice Propagation u - v - w - x - y -
[object Object],Good Polymorphisms: Majority Chinese Remainder Theorem for Majority  Let  R   be a ( k -ary) relation invariant under a majority operation, and  is some tuple.  Then if for any  i,j     {1,..., k }   there is a tuple  such that  then
Good Polymorphisms: Majority Propagation again: 2-consistency Any 2-consistent  instance has a solution u - v - w - x - y -
[object Object],[object Object],[object Object],Good Polymorphisms: Affine
[object Object],Complexity:  Boolean  CSP Theorem  (Schaefer 1978)   For a constraint language     over  {0,1}  the problem  CSP(  )  is solvable in poly time iff     has a semilattice, majority, or affine polymorphism; otherwise it is NP-complete Fine Print:   `Trivial’ languages are excluded from the theorem. These are so-called 0- or 1-valid languages, in which every instance has a solution
[object Object],Complexity:  Graphs Theorem  (Hell, Nesetril  1990)   For a graph  H  the H-Coloring problem  is solvable in poly time iff  E(H)  has a majority polymorphism; otherwise it is NP-complete Fine Print:   Graphs here must be cores.  Then a core has a majority polymorphism iff it is a loop or an edge
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Types Fine Print :   One needs to be quite creative to relate this definition to the actual definition as it was introduced in universal algebra 25 years ago.  It is good enough for our purpose, though
[object Object],[object Object],[object Object],[object Object],[object Object],Conjectures  p
[object Object],[object Object],[object Object],[object Object],[object Object],Algorithms
[object Object],[object Object],[object Object],[object Object],[object Object],Dichotomy results
Polymorphisms of conservative languages If  is a polymorphism of a conservative language   , then for any We look at how polymorphisms behave on 2-element subsets If for some 2-elemen subset  B   there is no polymorphism that is good on  B   then CSP(  )  is NP-complete Theorem  (B. 2003)   CSP(  )  for a conservative     on  A   is poly time iff for any 2-element  B    A   there is  f     Pol(  ) which is affine, majority, or semilattice; otherwise  CSP(  )  is NP-complete.
Edge coloured graphs G (  ) : Since semilattice operation induces an order,  red edges are directed semilattice operation majority operation affine operation
[object Object],[object Object],[object Object],AS-components The remaining edges  are  majority
CRT for AS-Components Chinese Remainder Theorem for AS-Component Let  R         for a conservative     on  A   and  as-components such that for any  i,j    { 1,...,k }   there is a tuple  such that  Then there is such that  for all  i,j    { 1,...,k }.
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Coherent Sets
Rectangularity Rectangularity Lemma Let  R         and  as-components such that  Let also  be the partition of  { 1,...,k }   into coherent sets w.r.t.  and  Then
The Algorithm ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],u - v - w - x - y -
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],General Case I
[object Object],[object Object],[object Object],[object Object],General Case II A B
[object Object],[object Object],[object Object],General Case III Theorem  There is a poly time algorithm such that on  ( V,A , C ) -  if for each  v    V   and any element  a   from an as-component there is a solution     with   ( v )  = a ,  then the algorithm finds a solution; -  otherwise it identifies which elements from as-components are not a part of a solution.
[object Object],General Case IV Have to check every element if it is a part of a solution, not only maximal ones u - v - w - x - y -
[object Object],[object Object],[object Object],Conclusion

More Related Content

What's hot

Formal language & automata theory
Formal language & automata theoryFormal language & automata theory
Formal language & automata theoryNYversity
 
Du Calcul des prédicats vers Prolog
Du Calcul des prédicats vers PrologDu Calcul des prédicats vers Prolog
Du Calcul des prédicats vers PrologSerge Garlatti
 
Algorithms and Complexity: Cryptography Theory
Algorithms and Complexity: Cryptography TheoryAlgorithms and Complexity: Cryptography Theory
Algorithms and Complexity: Cryptography TheoryAlex Prut
 
Automata
AutomataAutomata
AutomataGaditek
 
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...inventionjournals
 
RuleML2015: Binary Frontier-guarded ASP with Function Symbols
RuleML2015: Binary Frontier-guarded ASP with Function SymbolsRuleML2015: Binary Frontier-guarded ASP with Function Symbols
RuleML2015: Binary Frontier-guarded ASP with Function SymbolsRuleML
 
Gödel’s incompleteness theorems
Gödel’s incompleteness theoremsGödel’s incompleteness theorems
Gödel’s incompleteness theoremsSérgio Souza Costa
 
13 propositional calculus
13 propositional calculus13 propositional calculus
13 propositional calculusTianlu Wang
 
Godels First Incompleteness Theorem
Godels First Incompleteness TheoremGodels First Incompleteness Theorem
Godels First Incompleteness Theoremmmanning02474
 
Truth as a logical connective
Truth as a logical connectiveTruth as a logical connective
Truth as a logical connectiveShunsuke Yatabe
 
Computing with matrix groups, or "how dense is dense"
Computing with matrix groups, or "how dense is dense"Computing with matrix groups, or "how dense is dense"
Computing with matrix groups, or "how dense is dense"Igor Rivin
 
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONS
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONSGROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONS
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONSHeinrich Hartmann
 
lecture 27
lecture 27lecture 27
lecture 27sajinsc
 

What's hot (20)

Hot topics
Hot topicsHot topics
Hot topics
 
Formal language & automata theory
Formal language & automata theoryFormal language & automata theory
Formal language & automata theory
 
Predicate Calculus
Predicate CalculusPredicate Calculus
Predicate Calculus
 
Du Calcul des prédicats vers Prolog
Du Calcul des prédicats vers PrologDu Calcul des prédicats vers Prolog
Du Calcul des prédicats vers Prolog
 
27 NP Completness
27 NP Completness27 NP Completness
27 NP Completness
 
Algorithms and Complexity: Cryptography Theory
Algorithms and Complexity: Cryptography TheoryAlgorithms and Complexity: Cryptography Theory
Algorithms and Complexity: Cryptography Theory
 
Automata
AutomataAutomata
Automata
 
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
Common Fixed Point Theorem for Weakly Compatible Maps in Intuitionistic Fuzzy...
 
New version
New versionNew version
New version
 
RuleML2015: Binary Frontier-guarded ASP with Function Symbols
RuleML2015: Binary Frontier-guarded ASP with Function SymbolsRuleML2015: Binary Frontier-guarded ASP with Function Symbols
RuleML2015: Binary Frontier-guarded ASP with Function Symbols
 
Daa notes 3
Daa notes 3Daa notes 3
Daa notes 3
 
Gödel’s incompleteness theorems
Gödel’s incompleteness theoremsGödel’s incompleteness theorems
Gödel’s incompleteness theorems
 
P versus NP
P versus NPP versus NP
P versus NP
 
13 propositional calculus
13 propositional calculus13 propositional calculus
13 propositional calculus
 
Godels First Incompleteness Theorem
Godels First Incompleteness TheoremGodels First Incompleteness Theorem
Godels First Incompleteness Theorem
 
Truth as a logical connective
Truth as a logical connectiveTruth as a logical connective
Truth as a logical connective
 
Logic agent
Logic agentLogic agent
Logic agent
 
Computing with matrix groups, or "how dense is dense"
Computing with matrix groups, or "how dense is dense"Computing with matrix groups, or "how dense is dense"
Computing with matrix groups, or "how dense is dense"
 
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONS
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONSGROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONS
GROUPOIDS, LOCAL SYSTEMS AND DIFFERENTIAL EQUATIONS
 
lecture 27
lecture 27lecture 27
lecture 27
 

Similar to Csr2011 june17 14_00_bulatov

Solution of nonlinear_equations
Solution of nonlinear_equationsSolution of nonlinear_equations
Solution of nonlinear_equationsTarun Gehlot
 
practice-final-soln.pdf
practice-final-soln.pdfpractice-final-soln.pdf
practice-final-soln.pdfT17Rockstar
 
Functional analysis in mechanics 2e
Functional analysis in mechanics  2eFunctional analysis in mechanics  2e
Functional analysis in mechanics 2eSpringer
 
Functional analysis in mechanics
Functional analysis in mechanicsFunctional analysis in mechanics
Functional analysis in mechanicsSpringer
 
Numerical_PDE_Paper
Numerical_PDE_PaperNumerical_PDE_Paper
Numerical_PDE_PaperWilliam Ruys
 
Cs229 notes8
Cs229 notes8Cs229 notes8
Cs229 notes8VuTran231
 
Phase locking in chains of multiple-coupled oscillators
Phase locking in chains of multiple-coupled oscillatorsPhase locking in chains of multiple-coupled oscillators
Phase locking in chains of multiple-coupled oscillatorsLiwei Ren任力偉
 
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...mathsjournal
 
MVT mean value theorem نظرية القيمة المتوسطة
MVT mean value theorem نظرية القيمة المتوسطةMVT mean value theorem نظرية القيمة المتوسطة
MVT mean value theorem نظرية القيمة المتوسطةDr. Karrar Alwash
 
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsA Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsLawrence Paulson
 
Congruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection PropertyCongruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection Propertyfilipke85
 
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...mathsjournal
 
590-Article Text.pdf
590-Article Text.pdf590-Article Text.pdf
590-Article Text.pdfBenoitValea
 
590-Article Text.pdf
590-Article Text.pdf590-Article Text.pdf
590-Article Text.pdfBenoitValea
 
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...mathsjournal
 
Automata
AutomataAutomata
AutomataGaditek
 

Similar to Csr2011 june17 14_00_bulatov (20)

Reductions
ReductionsReductions
Reductions
 
Solution of nonlinear_equations
Solution of nonlinear_equationsSolution of nonlinear_equations
Solution of nonlinear_equations
 
1500403828
15004038281500403828
1500403828
 
practice-final-soln.pdf
practice-final-soln.pdfpractice-final-soln.pdf
practice-final-soln.pdf
 
Functional analysis in mechanics 2e
Functional analysis in mechanics  2eFunctional analysis in mechanics  2e
Functional analysis in mechanics 2e
 
Functional analysis in mechanics
Functional analysis in mechanicsFunctional analysis in mechanics
Functional analysis in mechanics
 
Numerical_PDE_Paper
Numerical_PDE_PaperNumerical_PDE_Paper
Numerical_PDE_Paper
 
Cs229 notes8
Cs229 notes8Cs229 notes8
Cs229 notes8
 
Phase locking in chains of multiple-coupled oscillators
Phase locking in chains of multiple-coupled oscillatorsPhase locking in chains of multiple-coupled oscillators
Phase locking in chains of multiple-coupled oscillators
 
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
 
MVT mean value theorem نظرية القيمة المتوسطة
MVT mean value theorem نظرية القيمة المتوسطةMVT mean value theorem نظرية القيمة المتوسطة
MVT mean value theorem نظرية القيمة المتوسطة
 
patel
patelpatel
patel
 
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness TheoremsA Machine-Assisted Proof of Gödel's Incompleteness Theorems
A Machine-Assisted Proof of Gödel's Incompleteness Theorems
 
Congruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection PropertyCongruence Distributive Varieties With Compact Intersection Property
Congruence Distributive Varieties With Compact Intersection Property
 
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
Fractional Newton-Raphson Method and Some Variants for the Solution of Nonlin...
 
590-Article Text.pdf
590-Article Text.pdf590-Article Text.pdf
590-Article Text.pdf
 
590-Article Text.pdf
590-Article Text.pdf590-Article Text.pdf
590-Article Text.pdf
 
On the dynamics of distillation processes
On the dynamics of distillation processesOn the dynamics of distillation processes
On the dynamics of distillation processes
 
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...
lassomodel, sparsity, multivariate modeling, NIR spectroscopy, biodiesel from...
 
Automata
AutomataAutomata
Automata
 

More from CSR2011

Csr2011 june14 09_30_grigoriev
Csr2011 june14 09_30_grigorievCsr2011 june14 09_30_grigoriev
Csr2011 june14 09_30_grigorievCSR2011
 
Csr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCsr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCSR2011
 
Csr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCsr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCSR2011
 
Csr2011 june18 14_00_sudan
Csr2011 june18 14_00_sudanCsr2011 june18 14_00_sudan
Csr2011 june18 14_00_sudanCSR2011
 
Csr2011 june18 15_45_avron
Csr2011 june18 15_45_avronCsr2011 june18 15_45_avron
Csr2011 june18 15_45_avronCSR2011
 
Csr2011 june18 09_30_shpilka
Csr2011 june18 09_30_shpilkaCsr2011 june18 09_30_shpilka
Csr2011 june18 09_30_shpilkaCSR2011
 
Csr2011 june18 12_00_nguyen
Csr2011 june18 12_00_nguyenCsr2011 june18 12_00_nguyen
Csr2011 june18 12_00_nguyenCSR2011
 
Csr2011 june18 11_00_tiskin
Csr2011 june18 11_00_tiskinCsr2011 june18 11_00_tiskin
Csr2011 june18 11_00_tiskinCSR2011
 
Csr2011 june18 11_30_remila
Csr2011 june18 11_30_remilaCsr2011 june18 11_30_remila
Csr2011 june18 11_30_remilaCSR2011
 
Csr2011 june17 17_00_likhomanov
Csr2011 june17 17_00_likhomanovCsr2011 june17 17_00_likhomanov
Csr2011 june17 17_00_likhomanovCSR2011
 
Csr2011 june17 16_30_blin
Csr2011 june17 16_30_blinCsr2011 june17 16_30_blin
Csr2011 june17 16_30_blinCSR2011
 
Csr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCsr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCSR2011
 
Csr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCsr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCSR2011
 
Csr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCsr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCSR2011
 
Csr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCsr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCSR2011
 
Csr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCsr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCSR2011
 
Csr2011 june17 15_15_kaminski
Csr2011 june17 15_15_kaminskiCsr2011 june17 15_15_kaminski
Csr2011 june17 15_15_kaminskiCSR2011
 
Csr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCsr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCSR2011
 
Csr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCsr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCSR2011
 
Csr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCsr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCSR2011
 

More from CSR2011 (20)

Csr2011 june14 09_30_grigoriev
Csr2011 june14 09_30_grigorievCsr2011 june14 09_30_grigoriev
Csr2011 june14 09_30_grigoriev
 
Csr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCsr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoff
 
Csr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoffCsr2011 june18 15_15_bomhoff
Csr2011 june18 15_15_bomhoff
 
Csr2011 june18 14_00_sudan
Csr2011 june18 14_00_sudanCsr2011 june18 14_00_sudan
Csr2011 june18 14_00_sudan
 
Csr2011 june18 15_45_avron
Csr2011 june18 15_45_avronCsr2011 june18 15_45_avron
Csr2011 june18 15_45_avron
 
Csr2011 june18 09_30_shpilka
Csr2011 june18 09_30_shpilkaCsr2011 june18 09_30_shpilka
Csr2011 june18 09_30_shpilka
 
Csr2011 june18 12_00_nguyen
Csr2011 june18 12_00_nguyenCsr2011 june18 12_00_nguyen
Csr2011 june18 12_00_nguyen
 
Csr2011 june18 11_00_tiskin
Csr2011 june18 11_00_tiskinCsr2011 june18 11_00_tiskin
Csr2011 june18 11_00_tiskin
 
Csr2011 june18 11_30_remila
Csr2011 june18 11_30_remilaCsr2011 june18 11_30_remila
Csr2011 june18 11_30_remila
 
Csr2011 june17 17_00_likhomanov
Csr2011 june17 17_00_likhomanovCsr2011 june17 17_00_likhomanov
Csr2011 june17 17_00_likhomanov
 
Csr2011 june17 16_30_blin
Csr2011 june17 16_30_blinCsr2011 june17 16_30_blin
Csr2011 june17 16_30_blin
 
Csr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCsr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhanin
 
Csr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhaninCsr2011 june17 09_30_yekhanin
Csr2011 june17 09_30_yekhanin
 
Csr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCsr2011 june17 12_00_morin
Csr2011 june17 12_00_morin
 
Csr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCsr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyi
 
Csr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCsr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonati
 
Csr2011 june17 15_15_kaminski
Csr2011 june17 15_15_kaminskiCsr2011 june17 15_15_kaminski
Csr2011 june17 15_15_kaminski
 
Csr2011 june17 12_00_morin
Csr2011 june17 12_00_morinCsr2011 june17 12_00_morin
Csr2011 june17 12_00_morin
 
Csr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyiCsr2011 june17 11_30_vyalyi
Csr2011 june17 11_30_vyalyi
 
Csr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonatiCsr2011 june17 11_00_lonati
Csr2011 june17 11_00_lonati
 

Csr2011 june17 14_00_bulatov

  • 1. CSP: Algorithms and Dichotomy Conjecture Andrei A. Bulatov Simon Fraser University
  • 2. Constraint Satisfaction Problem I CSP(  ) Definition: Instance: ( V ; A ; C ) where  V is a finite set of variables  A is a set of values  C is a set of constraints Question: whether there is h : V  A such that, for any i , is true where each belongs to 
  • 3. Constraint Satisfaction Problem II u - v - w - x - y - Q ( u,v,w ) R ( w,x ) R ( x,y ) S ( y,u )
  • 4.
  • 5. Examples: Linear Equations, SAT Linear Equations : 3-SAT = CSP( ) :
  • 6. Invariants and Polymorphisms Pol(  ) denotes the set of all polymorphisms of relations from  Definition A relation R is invariant with respect to an n - ary operation f (or f is a polymorphism of R ) if, for any tuples the tuple obtained by applying f coordinate-wise is a member of R
  • 7.
  • 8.
  • 9.
  • 10. Polymorphisms and Complexity Theorem ( Jeavons; 1998 ) If  ,  are constraint languages such that Pol(  )  Pol(  ), then CSP (  ) is log space reducible to CSP (  ) 1 2 2 1 2 1 Larose, Tesson, 2007: This reduction can be made
  • 11.
  • 12. Good Polymorphisms: Semilattice u - v - w - x - y -
  • 13. Good Polymorphisms: Semilattice Propagation u - v - w - x - y -
  • 14.
  • 15. Good Polymorphisms: Majority Propagation again: 2-consistency Any 2-consistent instance has a solution u - v - w - x - y -
  • 16.
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.
  • 22.
  • 23. Polymorphisms of conservative languages If is a polymorphism of a conservative language  , then for any We look at how polymorphisms behave on 2-element subsets If for some 2-elemen subset B there is no polymorphism that is good on B then CSP(  ) is NP-complete Theorem (B. 2003) CSP(  ) for a conservative  on A is poly time iff for any 2-element B  A there is f  Pol(  ) which is affine, majority, or semilattice; otherwise CSP(  ) is NP-complete.
  • 24. Edge coloured graphs G (  ) : Since semilattice operation induces an order, red edges are directed semilattice operation majority operation affine operation
  • 25.
  • 26. CRT for AS-Components Chinese Remainder Theorem for AS-Component Let R   for a conservative  on A and as-components such that for any i,j  { 1,...,k } there is a tuple such that Then there is such that for all i,j  { 1,...,k }.
  • 27.
  • 28. Rectangularity Rectangularity Lemma Let R   and as-components such that Let also be the partition of { 1,...,k } into coherent sets w.r.t. and Then
  • 29.
  • 30.
  • 31.
  • 32.
  • 33.
  • 34.