Slides.

More documents

Recommendations

Info

STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 81/81 INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS Structural Characterisation of Model-Checking Problems Research programme. For each of the natural logics L such as FO or MSO, identify a structural property P of classes C of graphs such that MC(L,C) is tractable if, and only if, C has the property P under suitable complexity theoretical assumptions. We may not always get an exact characterisation, there may be gaps. But such a characterisation would give an easy tool to assess whether MSO-model-checking is tractable on some class.
Page 1 and 2:
Towards a Structural Characterisati
Page 3 and 4:
STEPHAN KREUTZER COMPLEXITY OF MODE
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
INTRODUCTION COMPLEXITY UPPER BOUND
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108: STEPHAN KREUTZER COMPLEXITY OF MODE
Page 157: STEPHAN KREUTZER COMPLEXITY OF MODE
show all

Slides.

Create successful ePaper yourself

Delete template?

Save as template?