First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic

Volumn 8, Issue 4, 2007, Pages

  Durand, Arnaud ^a,c   Grandjean, Etienne ^b,d  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ DE CAEN   (France)

^c CNRS   (France)

^d Centre National de la Recherche Scientifique   (France)

Author keywords

Computational complexity; Enumeration problems; First order logic

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DYNAMICAL SYSTEMS; INTEGER PROGRAMMING; PROBLEM SOLVING; QUERY LANGUAGES;

D-DEGREE-BOUNDED; ENUMERATION PROBLEMS; FIRST-ORDER LOGIC; HANF'S MODEL-THEORETIC TECHNIQUE;

DATA STRUCTURES;

EID: 34548409905     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1276920.1276923     Document Type: Article

References (25)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley.
2. ARNBORG, S., LAGERGREN, J., AND SEESE, D. 1991. Easy problems for tree-decomposable graphs. J. Algor. 12, 2, 308-340.
3. BOROS, E., GURVICH, V., KHACHIYAN, L., AND MAKINO, K. 2000. Generating partial and multiple transversals of a hypergraph. In Proceedings of the 27th International Conference on Automata, Languages, and Programming (ICALP 2000), Geneva (Switzerland). U. Montanari, J. D. P. Rolim, and E. Welzl, Eds. Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, 588-599.
4. COMPTON, K. AND HENSON, C. 1990. A uniform method for proving lower bounds on the computational complexity of logical theories. Ann. Pure Appl. Logic 48, 1-79.
5. DOWNEY, R. G. AND FELLOWS, M. R. 1999. Parameterized Complexity. Springer-Verlag.
6. EITER, T. AND GOTTLOB, G. 1995. Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24, 6, 1278-1304.
7. EITER, T., GOTTLOB, G., AND MAKINO, K. 2003. New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput. 32, 2, 514-537.
8. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree decompositions. J. ACM 49, 6, 716-752.
9. FRICK, M. AND GROHE, M. 2001. Deciding first-order properties of locally tree decomposable structures. J. ACM 48, 1184-1206.
10. GAIFMAN, H. 1982. On local and nonlocal properties. In Proceeding of Logic Colloquium'81. J. Stern, Ed. North-Holland, 105-135.
11. GOLDBERG, L. A. 1994. Listing graphs that satisfy first order sentences. J. Comput. Sys. Sci. 49, 2, 408-424.
12. GRANDJEAN, E. AND OLIVE, F. 2004. Graphs properties checkable in linear time in the number of vertices. J. Comput. Sys. Sci. 68, 3, 546-597.
13. GRANDJEAN, E. AND SCHWENTICK, T 2002. Machine-independent characterizations and complete problems for deterministic linear time. SIAM J. Comput. 32, 1, 196-230.
14. HANF, W. 1965. Model-theoretic methods in the study of elementary logic. In The Theory of Models, L. H. J. Addison and A. Tarski, Eds. North-Holland, 132-145.
15. JOHNSON, D. S., YANNAKAKIS, M., AND PAPADIMITRIOU, C. H. 1988. On generating all maximal independent sets. Inform. Proces. Let. 27, 3, 119-123.
16. KAVVADIAS, D. J., SIDERI, M., AND STAVROPOULOS, E. C. 2000. Generating all maximal models of a boolean expression. Infor. Proces. Let. 74, 3-4, 157-162.
17. LIBKIN, L. 2004. Elements of Finite Model Theory. EATCS Series. Springer.
18. LINDELL, S. 2005. Computing monadic fixed-point in linear-time on doubly-linked data structures. In 7th Workshop on Logic and Computational Complexity (LCC'05).
19. PLEHN, J. AND VOIGT, B. 1990. Finding minimally weighted subgraphs. In 16th Workshop on Graph Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 484. 18-29.
20. RABIN, M. 1964. A simple method of undecidability proofs and some applications. In Logic, Methodology and Philosophy of Science, Bar-Hillel, Ed. Vol. 1. North-Holland, Amsterdam, 58-68.
21. ROBERTSON, N. AND SEYMOUR, P. 1983. Graph minors I. excluding a forest. J. Combinat. Theo. Ser. B 35, 39-61.
22. ROBERTSON, N. AND SEYMOUR, P. 1984. Graph minors III. planar tree-width. J Combinat. Theo. Ser. B 41, 92-114.
23. SEESE, D. 1992. Interpretability and tree automata: a simple way to solve algorithmic problems on graphs closely related to trees. In Tree Automata and Languages, M. Nivat and A. Podelski, Eds. Elsevier Science, 83-114.
24. SEESE, D. 1996. Linear time computable problems and first-order descriptions. Mathem. Struc. Comput. Sci. 6, 6 (Dec), 505-526.
25. VARDI, M. Y. 1995. On the complexity of bounded-variable queries. In ACM Symposium on Principles of Database Systems. ACM Press, 266-276.