Sciweavers

66 search results - page 1 / 14
» Bounded Model Construction for Monadic Second-Order Logics
Sort
View
CAV
2000
Springer
197views Hardware» more  CAV 2000»
13 years 9 months ago
Bounded Model Construction for Monadic Second-Order Logics
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
Abdelwaheb Ayari, David A. Basin
CSL
2009
Springer
13 years 11 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
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...
Stephan Kreutzer
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
LATA
2009
Springer
13 years 11 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
CSL
2005
Springer
13 years 10 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé