Definability equals recognizability for graphs of bounded treewidth

We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree decompositions of graphs satisfying the property can be recognize...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science S. 407 - 416
Hauptverfasser:	Bojańczyk, Mikołaj, Pilipczuk, Michał
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 05.07.2016
Schriftenreihe:	ACM Conferences
Schlagworte:	Theory of computation > Logic Monadic Second-Order Logic treewidth recognizability tree decomposition Simon's factorization forest
ISBN:	9781450343916, 1450343910
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!