4 search results - page 1 / 1 » On the Parameterised Intractability of Monadic Second-Order ... |
70
Voted
CSL
2009
Springer
15 years 4 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
68
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
93
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
89
Voted
JSYML
2002
14 years 10 months ago
2002
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...