Sciweavers

CORR
2007
Springer
162views Education» more  CORR 2007»
13 years 4 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
JAPLL
2008
101views more  JAPLL 2008»
13 years 4 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
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 ...
Stephan Kreutzer, Siamak Tazari
ECAI
2010
Springer
13 years 4 months ago
Higher-Order Coalition Logic
We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}] expressing that the coalition of all agents satisfying (x) can ac...
Guido Boella, Dov M. Gabbay, Valerio Genovese, Lee...
CSL
2010
Springer
13 years 5 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
DIMACS
1996
13 years 5 months ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle
DLT
2004
13 years 5 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
AIML
2008
13 years 6 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
CSR
2008
Springer
13 years 6 months ago
Logic and Rational Languages of Words Indexed by Linear Orderings
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
Nicolas Bedon, Alexis Bès, Olivier Carton, ...
BIRTHDAY
2008
Springer
13 years 6 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas