Slides.

More documents

Recommendations

Info

STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 13/81 INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS Structural Characterisation of Model-Checking Problems In the terminology of parametrized complexity: MSO-model-checking is fpt on the class of finite trees. Question. What are the largest/most general classes of graphs on which MSO becomes tractable? And the same question applies to first-order logic. 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 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.
STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 13/81 INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS Structural Characterisation of Model-Checking Problems In the terminology of parametrized complexity: MSO-model-checking is fpt on the class of finite trees. Question. What are the largest/most general classes of graphs on which MSO becomes tractable? And the same question applies to first-order logic. 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 21: STEPHAN KREUTZER COMPLEXITY OF MODE
Page 73 and 74:
STEPHAN KREUTZER COMPLEXITY OF MODE
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:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
show all

Slides.

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?