Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase - - PowerPoint PPT Presentation

phase transition in 3sat yi zhou
SMART_READER_LITE
LIVE PREVIEW

Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase - - PowerPoint PPT Presentation

Phase Transition in 3SAT Phase Transition in 3SAT Yi Zhou Phase Transition in 3SAT Phase Transition in 3SAT Fine Grained Complexity Analysis Phase Transition in 3SAT Phase Transition in 3SAT Outline Phase Transition in 3SAT Fine Grained


slide-1
SLIDE 1

Phase Transition in 3SAT

Phase Transition in 3SAT Yi Zhou

slide-2
SLIDE 2

Phase Transition in 3SAT

Phase Transition in 3SAT Fine Grained Complexity Analysis

slide-3
SLIDE 3

Phase Transition in 3SAT Phase Transition in 3SAT

Outline

Phase Transition in 3SAT Fine Grained Complexity Analysis

slide-4
SLIDE 4

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition

Figure: Phase Transition of H2O

slide-5
SLIDE 5

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition

Figure: Phase Transition of H2O

Sudden sharp transformation from one state to another at a certain point.

slide-6
SLIDE 6

Phase Transition in 3SAT Phase Transition in 3SAT

SAT & 3SAT

The satisfiability problem of propositional formulas, i.e., to determine whether there exists an interpretation satisfying a given propositional formula.

slide-7
SLIDE 7

Phase Transition in 3SAT Phase Transition in 3SAT

SAT & 3SAT

The satisfiability problem of propositional formulas, i.e., to determine whether there exists an interpretation satisfying a given propositional formula. SAT can be linearly transformed to its subform 3SAT, where the propositional formula is a conjunction of clauses with no more than 3 literals.

slide-8
SLIDE 8

Phase Transition in 3SAT Phase Transition in 3SAT

SAT & 3SAT

The satisfiability problem of propositional formulas, i.e., to determine whether there exists an interpretation satisfying a given propositional formula. SAT can be linearly transformed to its subform 3SAT, where the propositional formula is a conjunction of clauses with no more than 3 literals. Example The following formula is in 3SAT (a ∨ b ∨ c) ∧ (a ∨ b ∨ ¬c) ∧ (a ∨ ¬b ∨ ¬c)

slide-9
SLIDE 9

Phase Transition in 3SAT Phase Transition in 3SAT

3SAT: an Important Problem

SAT/3SAT is (one of) the most important

◮ NP-complete problem ◮ constraint satisfaction problem ◮ combinatorial problem ◮ logic solving problem ◮ knowledge representation formalism

slide-10
SLIDE 10

Phase Transition in 3SAT Phase Transition in 3SAT

SAT/3SAT: Many Applications

SAT/3SAT has many applications in

◮ computational complexity ◮ computational learning theory ◮ hardware/software verification ◮ automatic test pattern generation ◮ AI planning ◮ theorem proving ◮ logic-based problem solving ◮ combinatorial search ◮ bioinformatics ◮ ......

slide-11
SLIDE 11

Phase Transition in 3SAT Phase Transition in 3SAT

Random 3SAT

Each clause is randomly generalized by the uniform distribution according to the clause/variable ratio r.

slide-12
SLIDE 12

Phase Transition in 3SAT Phase Transition in 3SAT

Random 3SAT

Each clause is randomly generalized by the uniform distribution according to the clause/variable ratio r. Random 3SAT is important to understand SAT solving both in theory and in practice. In fact, it is one of the SAT competition category.

slide-13
SLIDE 13

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the Observation

Hardness of 3SAT

2 3 4 5 Ratio of Clauses-to-Variables 6 7 8 1000 3000 D P C a l l s 2000 4000 50 var 40 var 20 var

Figure: Hardness to solve 3SAT problems

slide-14
SLIDE 14

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the Observation

The ”Easy-Hard-Easy” phenomenon

◮ Formulas with a low clause/variable ratio can easily be

  • solved. Most likely satisfiable

◮ Formulas with a high clause/variable ratio can easily be

  • solved. It varies.

◮ Formulas with a middle clause/variable ratio are hard to

  • solve. Most likely satisfiable
slide-15
SLIDE 15

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the Conjecture

Random 3SAT does embrace a phase transition phenomenon!

slide-16
SLIDE 16

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the Conjecture

Random 3SAT does embrace a phase transition phenomenon! There exists a real number r such that

◮ Almost all big 3SAT instances with a clause variable ratio

less than r are satisfiable.

◮ Almost all big 3SAT instances with a clause variable ratio

greater than r are unsatisfiable.

slide-17
SLIDE 17

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Empirical Side

Empirical study supports the claim.

slide-18
SLIDE 18

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Empirical Side

Empirical study supports the claim.

0.0 2 3 4 5 Ratio of Clauses-to-Variables 6 7 8 0.2 0.6 Probability 0.4

50% sat

Mitchell, Selman, and Levesque 1991

0.8 1.0

Figure: The probability of satisfying random 3SAT instances

slide-19
SLIDE 19

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Empirical Side

Empirical study supports the claim. It is concluded from the empirical studies that the claim is true. And the phase transition point is believed to be around 4.27 according to in statistical physics, more precisely, replica methods.

slide-20
SLIDE 20

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Theoretical Side

2SAT does embrace the phase transition phenomenon with the phase transition point to be 1, by using implication graph and branching process in random graph theory, originally developed Erdos and Renyi.

slide-21
SLIDE 21

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Theoretical Side

2SAT does embrace the phase transition phenomenon with the phase transition point to be 1, by using implication graph and branching process in random graph theory, originally developed Erdos and Renyi. The 3SAT phase transition problem remains open .

slide-22
SLIDE 22

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Theoretical Side

2SAT does embrace the phase transition phenomenon with the phase transition point to be 1, by using implication graph and branching process in random graph theory, originally developed Erdos and Renyi. The 3SAT phase transition problem remains open for a long time.

slide-23
SLIDE 23

Phase Transition in 3SAT Phase Transition in 3SAT

When Phase Transition Meets SAT/3SAT: the State-of-the-art from the Theoretical Side

2SAT does embrace the phase transition phenomenon with the phase transition point to be 1, by using implication graph and branching process in random graph theory, originally developed Erdos and Renyi. The 3SAT phase transition problem remains open for a long time. Researchers are trying to find lower bound and upper bound instead, and the gap gradually thins.

slide-24
SLIDE 24

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: Upper Bound

For upper bound

◮ r = 5.1909 (1983) Franco, Paull (and others) ◮ r = 5.19 − 10−7 (1992) Frieze and Suen ◮ r = 4.758 (1994) Kamath, Motwani, Palem, Spirakis ◮ r = 4.667 (1996) Kirousis, Kranakis, Krizanc ◮ r = 4.642 (1996) Dubois, Boufkhad ◮ r = 4.602 (1998) Kirousis, Kranakis, Krizac, Stamatiou ◮ r = 4.596 (1999) Janson, Stamatiou, Vamvakari (1999) ◮ r = 4.571 (2007) Kaporis, Kirousis, Stamatiou, Vamvakari ◮ r = 4.506 (1999) Dubois, Boukhand, Mandler ◮ r = 4.49 (2008) Diaz, Kirousis, Mitsche, Perez ◮ r = 4.453 (2008) Maneva, Sinclair

slide-25
SLIDE 25

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: Lower Bound

For lower bound

◮ r = 2.66 (1986) Chao, Franco ◮ r = 2.99 (1986) Chao, Franco ◮ r = 3.003 (1992) Frieze, Suen ◮ r = 3.145 (2000) Achlioptas ◮ r = 3.26 (2001) Achlioptas and Sorkin ◮ r = 3.42 (2002) Kaporis, Kirousis, Lalas ◮ r = 3.52 Kaporis, Kirousis, Lalas (2003) ◮ r = 3.52 Hajiaghayi, Sorkin (2003)

slide-26
SLIDE 26

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: an Important Open Problem

It is believed that the approaches for showing the upper and lower bounds cannot prove the ultimate claim. However, any slight improvement is highly technical, tedious and important.

slide-27
SLIDE 27

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: an Important Open Problem

It is believed that the approaches for showing the upper and lower bounds cannot prove the ultimate claim. However, any slight improvement is highly technical, tedious and important. The phase transition problem in 3SAT still remains open.

slide-28
SLIDE 28

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition for other SAT Classes

The phase transition phenomenon also exists for other subclasses of SAT.

slide-29
SLIDE 29

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition for other SAT Classes

The phase transition phenomenon also exists for other subclasses of SAT.

Lintao Zhang

Figure: The probability of satisfying random k-SAT instances

slide-30
SLIDE 30

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition for other SAT Classes

The phase transition phenomenon also exists for other subclasses of SAT. Phase Transition for 2+p-SAT

Figure: The probability of satisfying random 2 + p-SAT instances

slide-31
SLIDE 31

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition 3SAT: Something More

Papers published in Nature and Science.

slide-32
SLIDE 32

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition 3SAT: Something More

Papers published in Nature and Science. From empirical studies, many NP problems embrace the phase transition phenomenon.

slide-33
SLIDE 33

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition 3SAT: Something More

Papers published in Nature and Science. From empirical studies, many NP problems embrace the phase transition phenomenon. The phase transition problem in k-SAT is the key points in Vinay Deolalikar’s wrong proof of P=NP .

slide-34
SLIDE 34

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: the New Conjecture

Phase transition does exist for random 3SAT and the transition point is √ 10 + 1 ≈ 4.16.

slide-35
SLIDE 35

Phase Transition in 3SAT Phase Transition in 3SAT

Phase Transition in 3SAT: the New Conjecture

Phase transition does exist for random 3SAT and the transition point is √ 10 + 1 ≈ 4.16. This is less than the conjectured point 4.27 obtained by applying the replica method for empirical studies. But it does make sense as proving unsatisfiability is always much harder than finding a satisfiable interpretation. The former needs to explore the whole search tree while the latter only needs find

  • ne solution, possibly by chance.
slide-36
SLIDE 36

Phase Transition in 3SAT Fine Grained Complexity Analysis

Outline

Phase Transition in 3SAT Fine Grained Complexity Analysis

slide-37
SLIDE 37

Phase Transition in 3SAT Fine Grained Complexity Analysis

Rethink the Hardness for Random 3SAT Instances

Hardness of 3SAT

2 3 4 5 Ratio of Clauses-to-Variables 6 7 8 1000 3000 D P C a l l s 2000 4000 50 var 40 var 20 var

Figure: Hardness to solve 3SAT problems

slide-38
SLIDE 38

Phase Transition in 3SAT Fine Grained Complexity Analysis

Rethink the Hardness for Random 3SAT Instances

Hardness of 3SAT

2 3 4 5 Ratio of Clauses-to-Variables 6 7 8 1000 3000 D P C a l l s 2000 4000 50 var 40 var 20 var

Figure: Hardness to solve 3SAT problems

The sizes of instances are increasing!!!

slide-39
SLIDE 39

Phase Transition in 3SAT Fine Grained Complexity Analysis

Rethink the Hardness for Random 3SAT Instances

Hardness of 3SAT

2 3 4 5 Ratio of Clauses-to-Variables 6 7 8 1000 3000 D P C a l l s 2000 4000 50 var 40 var 20 var

Figure: Hardness to solve 3SAT problems

So what?

slide-40
SLIDE 40

Phase Transition in 3SAT Fine Grained Complexity Analysis

Worst-Case Complexity Analysis

In computer science, we traditionally use worst-case complexity

  • analysis. And we use the big O notation to analyze the

efficiency of an algorithm, which is represented as a function of the input size.

slide-41
SLIDE 41

Phase Transition in 3SAT Fine Grained Complexity Analysis

Worst-Case Complexity Analysis

In computer science, we traditionally use worst-case complexity

  • analysis. And we use the big O notation to analyze the

efficiency of an algorithm, which is represented as a function of the input size. Bubble sort has worst-case time complexity to be O(n2), while quick sort has worst-case time complexity to be O(n log n).

slide-42
SLIDE 42

Phase Transition in 3SAT Fine Grained Complexity Analysis

Worst-Case Complexity Analysis

In computer science, we traditionally use worst-case complexity

  • analysis. And we use the big O notation to analyze the

efficiency of an algorithm, which is represented as a function of the input size. Bubble sort has worst-case time complexity to be O(n2), while quick sort has worst-case time complexity to be O(n log n). Average-case analysis and smooth analysis are also

  • introduced. However, both of them also take the input size as

the main factor.

slide-43
SLIDE 43

Phase Transition in 3SAT Fine Grained Complexity Analysis

The Problem

Fixing the number of variables, when the clause/variable ratio is becoming bigger, so is the formula size.

slide-44
SLIDE 44

Phase Transition in 3SAT Fine Grained Complexity Analysis

The Problem

Fixing the number of variables, when the clause/variable ratio is becoming bigger, so is the formula size. However, it is NOT necessary that bigger formulas are always harder to solve. Also, sometimes an SAT instance with 1,000,000 variables can be solved quickly but the same solver will stuck with some instances with 100 variables.

slide-45
SLIDE 45

Phase Transition in 3SAT Fine Grained Complexity Analysis

Observation and Motivation

For random 3 SAT instances, the size of the input instance is not the major factor, the inherit complicatedness of the instance is.

slide-46
SLIDE 46

Phase Transition in 3SAT Fine Grained Complexity Analysis

Observation and Motivation

For random 3 SAT instances, the size of the input instance is not the major factor, the inherit complicatedness of the instance is. This motivates us to consider fine-grained complexity analysis for algorithms with respect to particular instance.

slide-47
SLIDE 47

Phase Transition in 3SAT Fine Grained Complexity Analysis

How?

How to analyze

slide-48
SLIDE 48

Phase Transition in 3SAT Fine Grained Complexity Analysis

How?

How to analyze Kolmogorov complexity may shed some insights

slide-49
SLIDE 49

Phase Transition in 3SAT Fine Grained Complexity Analysis

Kolmogorov Complexity

To characterize the complexity of a string by some language, which is defined as the minimal number of objects in the language to describe it.

slide-50
SLIDE 50

Phase Transition in 3SAT Fine Grained Complexity Analysis

Kolmogorov Complexity

To characterize the complexity of a string by some language, which is defined as the minimal number of objects in the language to describe it. Example For the string ababababababababababababababab, although it has 30 characters. In English, we can describe it by 15 ”ab”s. But the string 4c1j5b2p0cv4w1x8rx2y39umgw5q85s seems to have no short description.