18.03.2014 Views

Slides.

Slides.

Slides.

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 72/81<br />

INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS<br />

Another Good Idea, A Little Less Wrong<br />

We reduce the propositional satisfiability problem (SAT) to MC(MSO,C).<br />

Given: w := (X 1 ∨ X 2 ∨¬X 3 )∧(X 4 ∨¬X 5 ∨ X 6 )...<br />

Problem: Decide if w is satisfiable.<br />

Reduction.<br />

Compute G w<br />

|w| 28 < tw(G w ) I(P,Q)<br />

Comp. GM (P,Q)<br />

MSO-definable.<br />

There is MSO 2 -formula ϕ(P, Q) saying (P, Q) are grid-like minor.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!