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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 407 - 416
Main Authors: Bojańczyk, Mikołaj, Pilipczuk, Michał
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 05.07.2016
Series:ACM Conferences
Subjects:
Theory of computation > Logic
Monadic Second-Order Logic
treewidth
recognizability
tree decomposition
Simon's factorization forest
ISBN:9781450343916, 1450343910
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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 recognized by tree automata. While the forward implication is a classic fact known as Courcelle's theorem, the converse direction remained open.
AbstractList 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 recognized by tree automata. While the forward implication is a classic fact known as Courcelle's theorem, the converse direction remained open.
Author Bojańczyk, Mikołaj
Pilipczuk, Michał
Author_xml – sequence: 1
  givenname: Mikołaj
  surname: Bojańczyk
  fullname: Bojańczyk, Mikołaj
  email: bojan@mimuw.edu.pl
  organization: Institute of Informatics, University of Warsaw
– sequence: 2
  givenname: Michał
  surname: Pilipczuk
  fullname: Pilipczuk, Michał
  email: michal.pilipczuk@mimuw.edu.pl
  organization: Institute of Informatics, University of Warsaw
BookMark eNqNjz1PwzAURS0BElAys3pkSXn-SGyPKEBBqsQCs-Xn2K2hxJCkQvDrCSLsTFd6V-fpnlNy2OUuEHLOYMmYrC65EaJS1XJKWYE-IIVReipASGFYfUyKYXgGAM6UNsBOSHMdYuocpl0aP2l437vdQPvg86ZLX3_nmHu66d3bdqA5Usz7rg0tHfsQPlI7bs_IUZywUMy5IE-3N4_NXbl-WN03V-vSca7GkgUOWrAWtefSCaeilMC8UcpH5OhlmBZr5U1tnG-ZRowgjazrCrkBgWJBlr9_nX-1mPPLYBnYH287e9vZ22KfQpyAi38C4hsx41sF
ContentType Conference Proceeding
Copyright 2016 ACM
Copyright_xml – notice: 2016 ACM
DOI 10.1145/2933575.2934508
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 416
GroupedDBID 6IE
6IF
6IG
6IL
6IN
AAJGR
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IEGSK
IJVOP
OCL
RIB
RIC
RIE
RIL
RIO
ID FETCH-LOGICAL-a227t-1e20831db8c24a3a7f4401c977cfb2bc4e50887c969acd18bbf0494665b2903b3
ISBN 9781450343916
1450343910
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387609200041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Jan 31 06:45:21 EST 2024
Wed Jan 31 06:44:04 EST 2024
IsPeerReviewed false
IsScholarly true
Keywords Monadic Second-Order Logic
treewidth
recognizability
tree decomposition
Simon's factorization forest
Language English
License Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.
LinkModel OpenURL
MeetingName LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science
MergedId FETCHMERGED-LOGICAL-a227t-1e20831db8c24a3a7f4401c977cfb2bc4e50887c969acd18bbf0494665b2903b3
PageCount 10
ParticipantIDs acm_books_10_1145_2933575_2934508_brief
acm_books_10_1145_2933575_2934508
PublicationCentury 2000
PublicationDate 20160705
PublicationDateYYYYMMDD 2016-07-05
PublicationDate_xml – month: 07
  year: 2016
  text: 20160705
  day: 05
PublicationDecade 2010
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationYear 2016
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002178901
Score 2.2379642
Snippet 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,...
SourceID acm
SourceType Publisher
StartPage 407
SubjectTerms Theory of computation -- Logic
Title Definability equals recognizability for graphs of bounded treewidth
WOSCitedRecordID wos000387609200041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELe6iQee-BpifMlITDxMgTp24uQRCogHOk1ioL0F27GlrjRFSzq2_vXc2UmaFSTggZckukZn1T_HPvvud0fI8wzdTZLbSDgBGxSVskhJLSMRG820FpZ7LsyXj_LoKDs9zY9Ho68dF-bim6yq7PIy__5foQYZgI3U2X-Au1cKAngG0OEKsMN1yyL-7eJz3Avrzv_PWd0cton0X0-moBq3eIefrhYYsrVaoMMAay6bQAEMZR66r344pt5ah1yrmTfdLfIx0engI5DWnRjDFn0WbN-8xqpNYNOi7_vHrGz6w-c3yzN1MEkOMmHWV_MQwD9fekmszvoJG097zHo17yP8wxthLsQczTUMpumAt3jtGIOlPuQ1GQy86bWdLRPJmHtW8GB2FaFAbrtQi_Dbr2uAwHQZYMZwMEVfwh1UZTtkR8px4Pf1Z3CwHcvAHvJ8v7a5Pg1Y13ybDgoEr7ZUoj1jFgNr5OQ22dv8X7rB-w4Z2eouudUhSFsE75HJEDgagKNbwFEAjgbg6NLRFjjaA7dHPr9_dzL5ELXVMyIVx7KJmI2xilypMxMLxZV0AvbSBux943SsjbDeNjd5mitTskxrh7mC0jTRcT7mmt8nu9Wysg8ILR1T3JVlohUT0vI8y1lsUpcrx6Tkcp88g54o8COoi8B0T4q2t4q2t_bJiz--U2gYN-7hX2h7RG5uBtFjstucr-wTcsNcNLP6_KlH-Sf-Sl4L
linkProvider IEEE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+31st+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Definability+equals+recognizability+for+graphs+of+bounded+treewidth&rft.au=Boja%C5%84czyk%2C+Miko%C5%82aj&rft.au=Pilipczuk%2C+Micha%C5%82&rft.series=ACM+Conferences&rft.date=2016-07-05&rft.pub=ACM&rft.isbn=9781450343916&rft.spage=407&rft.epage=416&rft_id=info:doi/10.1145%2F2933575.2934508
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/sc.gif&client=summon&freeimage=true