The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva...
-
date post
20-Dec-2015 -
Category
Documents
-
view
217 -
download
0
Transcript of The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva...
![Page 1: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/1.jpg)
The Connectivity of Boolean Satisfiability: The Connectivity of Boolean Satisfiability: Structural and Computational DichotomiesStructural and Computational Dichotomies
Elitza Maneva (UC Berkeley)Elitza Maneva (UC Berkeley)
Joint work with Joint work with
Parikshit Gopalan, Phokion Kolaitis and Christos PapadimitriouParikshit Gopalan, Phokion Kolaitis and Christos Papadimitriou
![Page 2: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/2.jpg)
Features of our dichotomyFeatures of our dichotomy
• Refers to the structure of the entire space of solutions
• The dichotomy cuts across Boolean clones
• Motivated by recent heuristics for random input CSP.
![Page 3: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/3.jpg)
Space of solutionsSpace of solutions1111111111
0000000000
n-dimensional hypercube
![Page 4: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/4.jpg)
Space of solutionsSpace of solutions1111111111
0000000000
![Page 5: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/5.jpg)
Space of solutionsSpace of solutions1111111111
0000000000
![Page 6: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/6.jpg)
Space of solutionsSpace of solutions
Connectivity of graph of solutions?Connectivity of graph of solutions?
1111111111
0000000000
1111111111
0000000000
![Page 7: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/7.jpg)
Our dichotomyOur dichotomy
• Computational problems– CONN: Is the solution graph connected?– st-CONN: Are two solutions connected?
• Structural property– Possible diameter of components
PSPACE-complete
PSPACE-complete
exponential
NP-complete
CONN
st-CONN
diameter
SAT
Tight Tight CSPCSP Non-tight Non-tight CSP CSP
in co-NP
in P
linear
P and NP-complete
![Page 8: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/8.jpg)
Motivation for our studyMotivation for our study
Heuristics for random CSP are influenced by the structure of the solution space
Random 3-SAT with parameter :
n variables, n clauses are chosen at random
4.154.15 4.274.2700
Easy Hard Unsat
![Page 9: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/9.jpg)
Motivation for our studyMotivation for our study
Heuristics for random CSP are influenced by the structure of the solution space
Survey propagation algorithm [Mezard, Parisi, Zecchina ‘02]• designed to work for clustered random problems• very successful for such random instances• based on statistical physics analysis
![Page 10: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/10.jpg)
Clustering in random CSPClustering in random CSPWhat is known?What is known?
2-SAT: a single cluster up to the satisfiability threshold 2-SAT: a single cluster up to the satisfiability threshold
3-SAT to 7-SAT: not known, but conjectured to have 3-SAT to 7-SAT: not known, but conjectured to have clusters before the satisfiability thresholdclusters before the satisfiability threshold
8-SAT and above: exponential number of clusters8-SAT and above: exponential number of clusters[Achlioptas, Ricci-Tersenghi `06][Achlioptas, Ricci-Tersenghi `06][Mezard, Mora, Zecchina `05] [Mezard, Mora, Zecchina `05]
![Page 11: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/11.jpg)
Our dichotomyOur dichotomy
PSPACE-complete
PSPACE-complete
exponential
CONN
st-CONN
diameter
Tight Tight CSPCSP Non-tight Non-tight CSP CSP
in coNP
in P
linear
![Page 12: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/12.jpg)
OR-free CSPsOR-free CSPs
1111111111
0000000000
NAND-free CSPsNAND-free CSPs
Distance preserving CSPsDistance preserving CSPs
1111111111
00000000001111111111
0000000000
Graph distance = Hamming distanceGraph distance = Hamming distance
TightTight
![Page 13: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/13.jpg)
1111111111
0000000000
OR / NAND-free CSPOR / NAND-free CSP
• Set of relations neither of which can express OR by substituting constants• Includes Horn• Includes some NP-complete CSP, e.g. POS-1-in-k SAT
![Page 14: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/14.jpg)
1111111111
0000000000
Graph distance = Hamming distanceGraph distance = Hamming distance
Distance preserving CSPDistance preserving CSP
• Set of relations, for which every component is a 2-SAT formula (component-wise bijunctive)• Includes bijunctive • Includes some NP-complete CSP
![Page 15: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/15.jpg)
Proof for the hard side of the dichotomyProof for the hard side of the dichotomy
• Proof for 3-SAT
• Expressibility theorem like Schaefer’s
![Page 16: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/16.jpg)
Schaefer expressibilitySchaefer expressibility
A relation is expressible from set of relations S if there is a CNF(S) formula , s.t. : (x1, …, xn) = w1, … ,wt (x1, …, xn, w1, …, wt)
![Page 17: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/17.jpg)
FaithfulFaithful expressibility expressibility
A relation is faithfully expressible from set of relations S if there is a CNF(S) formula , s.t. : (x1, …, xn) = w1, … ,wt (x1, …, xn, w1, …, wt)
![Page 18: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/18.jpg)
FaithfulFaithful expressibility expressibility
A relation is faithfully expressible from set of relations S if there is a CNF(S) formula , s.t. : (x1, …, xn) = w1, … ,wt (x1, …, xn, w1, …, wt)
![Page 19: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/19.jpg)
FaithfulFaithful expressibility expressibility
A relation is faithfully expressible from set of relations S if there is a CNF(S) formula , s.t.:
(x1, …, xn) = w1, … ,wt (x1, …, xn, w1, …, wt)and
(1) For every a {0,1}n with (a)=1, the graph of solutions of (a, w) is connected.
(2) For every a, b {0,1}n with (a)= (b)=1, |a-b|=1, there exists w s.t. (a, w)=(b, w)=1
![Page 20: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/20.jpg)
Lemma: For 3-SAT (a) Exist formulas with exponential diameter(b) CONN and st-CONN are PSPACE-complete
Lemma: Faithful expressibility:(a) preserves diameter up to a polynomial factor(b) Is a poly time reduction for CONN and st-CONN
Faithful Expressibility Theorem: If S is not tight, every relation is faithfully expressible from S.
Proof for the hard side of the dichotomyProof for the hard side of the dichotomy
![Page 21: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/21.jpg)
Theorem : If S is not tight, every relation is faithfully expressible from S.
Proof in 4 steps.
Step 0: Express 2-SAT clauses.
• Some relation can express OR (NAND).
• Other 2-SAT clauses by resolution:
(x1 x2) = w (x1 w) (w x2)
Faithful Expressibility TheoremFaithful Expressibility Theorem
_ _ _
![Page 22: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/22.jpg)
(x1 x3) =
Faithful Expressibility TheoremFaithful Expressibility Theorem
Theorem : If S is not tight, every relation is faithfully expressible from S.
Proof in 4 steps.
Step 1 : Express a relation where some distance expands. Use R which is not component-wise bijunctive.
![Page 23: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/23.jpg)
Faithful Expressibility TheoremFaithful Expressibility Theorem
Theorem : If S is not tight, every relation is faithfully expressible from S.
Proof in 4 steps.
Step 2 : Express a path of length 4 between vertices at distance 2.
![Page 24: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/24.jpg)
Theorem : If S is not tight, every relation is faithfully expressible from S.
Proof in 4 steps.
Step 3: Express all 3-SAT clauses from such paths. [Demaine-Hearne ‘02]
Faithful Expressibility TheoremFaithful Expressibility Theorem
![Page 25: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/25.jpg)
Theorem : If S is not tight, every relation is faithfully expressible from S.
Proof in 4 steps.
Step 4: Express all relations from 3-SAT clauses.
Faithful Expressibility TheoremFaithful Expressibility Theorem
![Page 26: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/26.jpg)
Open questionsOpen questions
• Trichotomy for CONN? Trichotomy for CONN? – P for component-wise bijunctiveP for component-wise bijunctive– coNP-complete for non-Schaefer tight relationscoNP-complete for non-Schaefer tight relations– open for Horn/dual-Hornopen for Horn/dual-Horn
• Which Boolean CSPs have a clustered phase?Which Boolean CSPs have a clustered phase?
![Page 27: The Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies Elitza Maneva (UC Berkeley) Joint work with Parikshit Gopalan, Phokion.](https://reader036.fdocuments.in/reader036/viewer/2022062320/56649d4c5503460f94a2b1cf/html5/thumbnails/27.jpg)
Thank youThank you