Special tree-width and the verification of monadic second-order graph properties

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 8, Issue , 2010, Pages 13-29

  Courcelle, Bruno ^a  

^a INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE-WIDTH; DETERMINISTIC AUTOMATA; GRAPH COMPLEXITY; GRAPH PROPERTIES; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS; TREE-WIDTH;

AUTOMATA THEORY; FORESTRY; MODEL CHECKING; SOFTWARE ENGINEERING;

TREES (MATHEMATICS);

EID: 80053340064     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2010.13     Document Type: Conference Paper

References (24)

1. H. Bodlaender, J. Engelfriet, Domino tree-width, J. Algorithms 24 (1997) 94-123.
2. M. Chudnovsky et al., Recognizing Berge graphs, Combinatorica 25 (2005) 143-186.
3. M. Chudnovsky et al., The strong perfect graph theorem, Ann. Math. 164 (2006) 51-229.
4. H. Comon et al., Tree Automata Techniques and Applications, On line for free at: http://tata.gforge.inria.fr/
5. D. Corneil, U. Rotics, On the relationship between clique-width and tree-width. SIAM J. Comput. 34 (2005) 825-847.
6. B. Courcelle, Graph structure and monadic second-order logic, book to be published by Cambridge University Press. Readable on: http://www.labri.fr/perso/ courcell/Book/CourGGBook.pdf
7. B. Courcelle, On the model-checking of monadic second-order formulas with edge set quantifications, May 2010, to appear in Discrete Applied Mathematics. Available from: http://hal.archives-ouvertes.fr/hal-00481735/fr/
8. B. Courcelle, I. Durand, Verifying monadic second-order graph properties with tree automata, 3rd European Lisp Symposium, May 2010, Lisbon, Informal proceedings edited by C. Rhodes, pp. 7-21. See: http://www.labri.fr/perso/ courcell/ArticlesEnCours/BCDurandLISP.pdf
9. B. Courcelle, J. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33 (2000) 125-150.
10. B. Courcelle, S. Olariu, Upper bounds to the clique-width of graphs, Discrete Applied Mathematics 101 (2000) 77-114.
11. R. Diestel, Graph Theory, 3rd edition, Springer, 2005.
12. R. Downey, M. Fellows, Parameterized complexity, Springer-Verlag, 1999.
13. I. Durand, Autowrite: A tool for term rewrite systems and tree automata, Electronic Notes in Theoret. Comput. Sci. 124 (2005) 29-49.
14. J. Flum, M. Grohe, Parametrized complexity theory, Springer, 2006.
15. M. Frick, M. Grohe: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130 (2004) 3-31
16. R. Ganian, P. Hlineny, On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Applied Mathematics 158 (2010) 851-867
17. R. Ganian, P. Hlineny, J. Obdrzalek, Better algorithms for satisfiability problems for formulas of bounded rank-width, 2010, arXiv:1006.5621v1[cs. DM]
18. G. Gottlob, R. Pichler, F. Wei: Abduction with bounded tree-width: from theoretical tractability to practically efficient computation. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, Chicago, AAAI Press, 2008, pp. 1541-1546
19. G. Gottlob, R. Pichler, F. Wei: Monadic Datalog over finite structures with bounded tree-width, CoRR abs/0809.3140 (2008)
20. P. Hlineny, S. Oum: Finding branch-decompositions and rank-decompo-sitions. SIAM J. Comput. 38 (2008) 1012-1032.
21. L. Stockmeyer, A. Meyer, Cosmological lower bound on the circuit complexity of a small problem in logic. J. ACM 49 (2002) 753-784.
22. M. Weyer, Decidability of S1S and S2S. in Automata, Logics, and Infinite Games: A Guide to Current Research. Lect. Notes Comp. Sci. 2500, Springer, 2002, pp. 207-230.
23. M. Rao, MSOL partitioning problems on graphs of bounded tree-width and clique-width. Theor. Comput. Sci. 377 (2007) 260-267.
24. D. Wood, On tree-partition-width, European J. Combin. 30 (2009) 1245-1253.