 |
|
|
|
| HAL : hal-00481735, version 2 |
| DOI : 10.1016/j.dam.2010.12.017 |
| Fiche détaillée |  Récupérer au format |
|
|
| Discrete Applied Mathematics 160 (2012) 866-887 |
|
|
| Versions disponibles : | v1 (07-05-2010) | v2 (07-01-2011) |
|
|
|
|
| On the model-checking of monadic second-order formulas with edge set quantifications. |
|
|
| Bruno Courcelle 1, 2 |
|
|
| (2012) |
|
|
|
| In order to obtain fixed-parameter tractable model-checking algorithms for monadic second-order graph properties that depend on the multiplicities of edges, we extend clique-width to graphs with multiple edges, and we extend counting monadic second-order logic accordingly. For monadic second-order graph properties that need edge set quantifications in their logical expressions, we define a graph complexity measure called special tree-width. Its value is between path-width and tree-width. We study its main properties and we explain why it is better that tree-width. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2 : | Institut Universitaire de France (IUF) |
|
|
|
Ministère de l'Enseignement Supérieur et de la Recherche Scientifique |
|
|
|
|
|
|
|
|
|
| Méthodes Formelles |
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| tree-width – clique-width – monadic second-order logic |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00481735, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00481735 | |
| oai:hal.archives-ouvertes.fr:hal-00481735 | |
| Contributeur : Bruno Courcelle | |
| Soumis le : Jeudi 6 Janvier 2011, 14:27:42 | |
| Dernière modification le : Mercredi 14 Mars 2012, 12:15:21 | |
