Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM

Volumn 48, Issue 6, 2001, Pages 1184-1206

  Frick, Markus ^a   Grohe, Martin ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

First order logic; Locality; Model checking; Parameterized complexity; Planar graphs; Query evaluation; Tree width

Indexed keywords

ALGORITHMIC LANGUAGES; ALGORITHMS; DECISION THEORY; FORMAL LOGIC; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

FIRST-ORDER LOGIC; MODEL-CHECKING; PLANAR GRAPHS; QUERY EVALUATION;

TREES (MATHEMATICS);

EID: 0000100916     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/504794.504798     Document Type: Article

References (35)

1. AHO, A., HOPCROFT, J., AND ULLMAN, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. AHO, A., AND ULLMAN, J. 1979. The universality of data retrieval languages. In Proceedings of the 6th Annual ACM Symposium on Principles of Programming Languages. ACM, New York, pp. 110-120.
3. ALBER, J., FERNAU, H., AND NIEDERMEIER, R. 2001. Parameterized complexity: Exponential speed-up for planar graph problems. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001). F. Orejas, P. Spirakis, and J. van Leeuwen, Eds. Lecture Notes in Computer Science, vol. 2076. Springer-Verlag, New York, pp. 261-272.
4. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1993. Near-linear cost sequential and distributed constructions of sparse neighborhood covers. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., pp. 638-647.
5. AWERBUCH, B., AND PELEG, D. 1990, Sparse partitions. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., pp. 503-513.
6. BAKER, B. 1994. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180.
7. BODLAENDER, H. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305-1317.
8. BODLAENDER, H. 1997. Treewidth: Algorithmic techniques and results. In Proceedings of the 22nd International Symposium, on Mathematical Foundations of Computer Science, MFCS'97, I. Privara and P. Ruzicka, Eds. Lecture Notes in Computer Science, vol. 1295. Springer-Verlag, New York, pp. 29-36.
9. COURCELLE, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. 2. Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 194-242.
10. COURCELLE, B., ENGELFRIET, J., AND ROZENBERG, G. 1993. Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci. 46, 218-270.
11. COURCELLE, B., MAKOWSKY, J., AND ROTICS, U. 2000. Linear time solvable optimization problems on graphs of bounded clique width. Theory Comput. Syst. 33, 2, 125-150.
12. DIESTEL, R. 2000. Graph Theory, Second ed. Springer-Verlag, New York.
13. DOWNEY, R., AND FELLOWS, M. 1999. Parameterized Complexity. Springer-Verlag, New York.
14. DOWNEY, R., FELLOWS, M., AND TAYLOR, U. 1996. The parameterized complexity of relational database queries and an improved characterization of W [1]. In Combinatorics, Complexity, and Logic Proceedings of DMTCS '96. D. S. Bridges, C. Calude, P. Gibbons, S. P. Reeves, and I. H. Witten, Eds. Springer-Verlag, New York, pp. 194-213.
15. EPPSTEIN, D. 1999. Subgraph isomorphism in planar graphs and related problems. J. Graph Algor. Appli. 3, 1-27.
16. EPPSTEIN, D. 2000. Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275-291.
17. ERDÖS, P. 1959. Graph theory and probability. Canadi. J. Math. 11, 34-38.
18. FLUM, J., FRICK, M., AND GROHE, M. 2001. Query evaluation via tree-decompositions. Currently available at http://www.dcs.ed.ac.uk/~grohe. A preliminary version of the paper appeared. In Proceedings of the 8th International Conference on Database Theory, LNCS 1973, Springer-Verlag.
19. FLUM, J., AND GROHE, M. 2001. Fixed-parameter tractability, definability, and model checking. SIAM J. Comput. 31, 1, 113-145.
20. GAIFMAN, H. 1982. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium' 81. North-Holland, Amsterdam, The Netherlands.
21. GAREY, M., JOHNSON, D., AND STOCKMEYER, L. 1976. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237-267.
22. GROHE, M. 2001. Local tree-width, excluded minors, and approximation algorithms. Combinatorica. To appear.
23. GROHE, M., AND WÖHRLE, S. 2001. An existential locality theorem. In Proceeding of the Computer Science Logic, 15th International Workshop CSL'01. Lecture Notes in Computer Science, vol. 2142. Springer-Verlag, New York, pp. 99-114.
24. IMMERMAN, N. 1982. Upper and lower bounds for first-order expressibility. J. Comput. Syst. Sci. 25, 76-98.
25. LIFSCHES, S., AND SHELAH, S. 2001. Distorted sums of models. Unpublished manuscript.
26. PAPADIMITRIOU, C., AND YANNAKAKIS, M. 1997. On the complexity of database queries. In Proceedings of the 17th ACM Symposium on Principles of Database Systems. ACM, New York, pp. 12-19.
27. PELEG, D. 1993. Distance-dependent distributed directories. Info. Computa. 103, 270-298.
28. ROBERTSON, N., AND SEYMOUR, P. 1984. Graph minors III. Planar tree-width. J. Combinat. Theory, Ser. B 36, 49-64.
29. ROBERTSON, N., AND SEYMOUR, P. 1986. Graph minors V. Excluding a planar graph. J. Combinat. Theory, Ser. B 41, 92-114.
30. ROBERTSON, N., AND SEYMOUR, P. 1995. Graph minors XIII. The disjoint paths problem. J. Combinat. Theory, Ser. B 63, 65-110.
31. SEESE, D. 1996. Linear time computable problems and first-order descriptions. Math. Structu. Comput. Sci. 6, 505-526.
32. THOMASSEN, C. 1995. Embeddings and minors. In Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovász, Eds. Vol. 1, Chap. 5. Elsevier, Amsterdam, The Netherlands, pp. 301-349.
33. VAN EMDE BOAS, P. 1990. Machine models and simulations. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. 1. Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 1-66.
34. VARDI, M. 1982. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing. ACM, New York, pp. 137-146.
35. YANNAKAKIS, M. 1995. Perspectives on database theory. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York, pp. 224-246.