Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width

Journal of Computer and System Sciences

Volumn 66, Issue 4, 2003, Pages 775-808

  Gottlob, Georg ^a   Leone, Nicola ^b   Scarcello, Francesco ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; QUERY LANGUAGES; TREES (MATHEMATICS);

HYPERGRAPHS;

GAME THEORY;

EID: 0038166188     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00030-8     Document Type: Conference Paper

References (33)

1. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, in: Proceedings of the 17th ACM Symposium on Principles of Database Systems (PODS'98), Seattle, Washington, 1998, pp. 254-263.
2. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley Publishing Company, Reading, MA, 1995.
3. I. Adler, Spiele als Hilfsmittel zu Strukturuntersuchungen bei Graphen und Hypergraphen (German), Diploma Thesis, Institut für mathematische Logik und Grundlagen der Informatik, Mathemartischa Fakultät, University of Freiburg, Freiburg im Breisgau, Germany, 2002. Available at http://www.math.uni-freiburg.de/archiv/diplom/isolde_adler.html
4. J. Van Benthem, Dynamic bits and pieces, ILLC Research Report, University of Amsterdam, 1997.
5. A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational databases, in: Proceedings of the ACM Symposium on Theory of Computing (STOC'77), 1977, pp. 77-90.
6. Ch. Chekuri, A. Rajaraman, Conjunctive query containment revisited, Theoret. Comput. Sci. 239(2) (2000) 211-229. A preliminary version appeared in: Proceedings of ICDT'97, Lecture Notes in Computer Science, Vol. 1186, Springer, Berlin, 1997, pp. 56-70.
7. B. Courcelle, J. Engelfried, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993) 218-270.
8. R. Dechter, Constraint networks, in: Encyclopedia of Artificial Intelligence, 2nd Edition, Wiley, New York, 1992, pp. 276-285.
9. R. Dechter, J. Pearl, Tree clustering for constraint networks, Artif. Intell. 38 (1989) 353-366.
10. J. Flum, M. Frick, M. Grohe, Query evaluation via tree-decomposition, in: Proceedings of ICDT'01, Lecture Notes in Computer Science, Vol. 1973, Springer, Berlin, 2001, pp. 22-38.
11. E.C. Freuder, A sufficient condition for backtrack-bounded search, J. ACM 32 (4) (1985) 755-761.
12. G. Gottlob, E. Grädel, H. Veith, Datalog LITE: a deductive query language with linear time model checking, ACM Trans. Comput. Logic 3 (1) (2002) 42-79.
13. G. Gottlob, N. Leone, F. Scarcello, On tractable queries and constraints, in: Proceedings of Database and Expert Systems Applications (DEXA'99), Lecture Notes in Computer Science, Vol. 1677, Springer, Florence, August 1999, pp. 1-15.
14. G. Gottlob, N. Leone, F. Scarcello, A comparison of structural CSP decomposition methods, Artif. Intell. 124(2) (2000) 243-282. A preliminary version appeared, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99), Vol. 1, 1999, pp. 394-399.
15. G. Gottlob, N. Leone, F. Scarcello, The complexity of acyclic conjunctive queries, J. ACM 48(3) (2000) 431-498. An extended abstract concerning part of this work has been published, in: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, 1998, pp. 706-715.
16. G. Gottlob, N. Leone, F. Scarcello, Hypertree decompositions and tractable queries, J. Comput. System Sci. 64(3) (2002) 579-627. An extended abstract concerning part of this work has been published, in: Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems (PODS'99), Philadelphia, Pennsylvania, May 1999, pp. 21-32.
17. G. Gottlob, N. Leone, F. Scarcello, Computing LOGCFL certificates, Theoret. Comput. Sci. 270(1-2) (2002) 761-777. A preliminary version appeared, in: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP'99), Lecture Notes in Computer Science, Vol. 1644, Springer, Prague, July, 1999, pp. 361-371.
18. G. Gottlob, R. Pichier, Hypergraphs in model checking: acyclicity hypertree-width versus clique-width, in: Proceedings of ICALP 2001, 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, July 8-12, 2001, pp. 708-719.
19. E. Grädel, On the restraining power of guards, J. Symbolic Logic 64 (1999) 1719-1742.
20. M. Grohe, T. Schwentick, L. Segoufin, When is the evaluation of conjunctive queries tractable? in: Proceedings of the ACM Symposium on Theory of Computing (STOC'01), 2001.
21. M. Gyssens, P.G. Jeavons, D.A. Cohen, Decomposing constraint satisfaction problems using database techniques, Artif. Intell. 66 (1994) 57-89.
22. M. Gyssens, J. Paredaens, A Decomposition Methodology for Cyclic Databases, in: Advances in Database Theory, Vol. 2, Plenum Press, New York, NY, 1984, pp. 85-122.
23. Ph.G. Kolaitis, M.Y. Vardi, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci. 61 (2000) 302-332.
24. A. Lustig, O. Shmueli, Acyclic hypergraph projections, J. Algorithms 30 (1999) 400-422.
25. N. Robertson, P.D. Seymour, Graph minors II, Algorithmic aspects of tree-width, J. Algorithms 7 (1986) 309-322.
26. F. Rossi, C. Petrie, V. Dhar, On the equivalence of constraint satisfaction problems, in: Proceedings of the 9th European Conference on Artificial Intelligence (ECAI'90), Stockholm, Sweden, 1990, pp. 550-556.
27. F. Scarcello, A. Mazzitelli, The hypertree decomposition homepage, http://wwwinfo.deis.unical.it/̃frank/ Hypertrees/
28. P.D. Seymour, R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B 58 (1993) 22-33.
29. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vol. II, Computer Science Press, Rockville, MD, 1989.
30. J.D. Ullman, Information integration using logical views, Theoret. Comput. Sci. 239 (2) (2000) 189-210.
31. M. Vardi, Complexity of relational query languages, in: Proceedings of the 14th ACM Symposium on Theory of Computing (STOC'82), 1982, pp. 137-146.
32. M. Vardi, Constraint satisfaction and database theory, Tutorial at the 19th ACM Symposium on Principles of Database Systems (PODS'00). Currently available at: http://www.cs.rice.edu/̃vardi/papers/pods00t.ps.gz.
33. M. Yannakakis, Algorithms for acyclic database schemes, in: C. Zaniolo, C. Delobel (Eds.), Proceedings of the International Conference on Very Large Data Bases (VLDB'81), Cannes, France, 1981, pp. 82-94.