Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width

SIAM Journal on Computing

Volumn 33, Issue 2, 2004, Pages 351-378

  Gottlob, Georg ^a   Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Acyclicity; Clique width; Database queries; Hypergraphs; Hypertree width; Model checking; Tractability

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; DECISION MAKING; PROBLEM SOLVING; TREES (MATHEMATICS);

ACYCLICITY; CLIQUE-WIDTH; DATABASE QUERIES; HYPERGRAPHS; HYPERTREE-WIDTH; MODEL CHECKING; TRACTABILITY;

GRAPH THEORY;

EID: 2342483742     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701396807     Document Type: Article

References (36)

1. S. ABITEBOUL, R. HULL, AND V. VIANU, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. G. AUSIELLO, A. D'ATRI, AND M. MOSCARINI, Chordality properties on graphs and minimal conceptual connections in semantic data models, J. Comput. System Sci., 33 (1986), pp. 179-202.
3. F. BAADER AND T. NIPKOW, Term Rewriting and All That, Cambridge University Press, Cambridge, UK, 1998.
4. H.-J. BANDELT AND H. M. MULDER, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986), pp. 182-208.
5. W. BIBEL, Constraint satisfaction from a deductive viewpoint, Artificial Intelligence, 35 (1988), pp. 401-413.
6. H. L. BODLAENDER, A linear-time algorithm for finding tree- decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
7. H. L. BODLAENDER, Treewidth: Algorithmic techniques and results, in Mathematical Foundations of Computer Science, I. Prívara and P. Ruzicka, eds., Lecture Notes in Comput. Sci. 1295, Springer-Verlag, Berlin, 1997, pp. 19-36.
8. A. BRANDSTÄDT, personal communication, 2002.
9. A. BRANDSTÄDT, V. B. LE, AND J. P. SPINRAD, Graph Classes: A Survey, SIAM Monogr. Discrete Math. Appl. 3, SIAM, Philadelphia, 1999.
10. A. BRANDSTÄDT AND V. V. LOZIN, On the linear structure and clique-width of bipartite permutation graphs, Ars Combin., 67 (2003), pp. 273-281.
11. A. K. CHANDRA AND P. M. MERLIN, Optimal implementation of conjunctive queries in relational data bases, in Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC'77), ACM Press, New York, 1977, pp. 77-90.
12. C. CHEKURI AND A. RAJARAMAN, Conjunctive query containment revisited, in Proceedings of the 6th International Conference on Database Theory (ICDT'97), Lecture Notes in Comput. Sci. 1186, Springer-Verlag, Berlin, 1997, pp. 130-144.
13. E. M. CLARKE, O. GRUMBERG, AND D. PELED, Model Checking, MIT Press, Cambridge, MA, 1999.
14. D. G. CORNELL, M. HABIB, J.-M. LANGLINEL, AND U. R. B. REED, Polynomial time recognition of clique-width ≤ 3 graphs, extended abstract, in Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN 2000), Lecture Notes in Comput. Sci. 1776, Springer-Verlag, Berlin, 2000, pp. 126-134.
15. B. COURCELLE, Graph rewriting: An algebraic and logic approach, in Handbook of Theoretical Computer Science, Vol. 2, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 194-241.
16. B. COURCELLE, Monadic second-order logic of graphs VII: Graphs as relational structures, Theoret. Comput. Sci., 101 (1992), pp. 3-33.
17. B. COURCELLE, J. ENGELFRIET, AND G. ROZENBERG, Handle- rewriting hypergraph grammars, J. Comput. System Sci., 46 (1993), pp. 218-270.
18. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125-150.
19. B. COURCELLE AND S. OLARIU, Upper bounds on the clique-width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
20. A. D'ATRI AND M. MOSCARINI, Acyclic Hypergraphs: Their Recognition and Top-Down versus Bottom-Up Generation, Tech, Report R.29, Consiglio Nazionale delle Ricerche, Tstituto di Analisi dei Sistemi ed Informatica, Rome, 1982.
21. A. D'ATRI AND M. MOSCARINI, Distance-hereditary graphs, Steiner trees, and connected domination, SIAM J. Comput., 17 (1988), pp. 521-538.
22. N. DERSHOWITZ AND J.-P. JOUANNAUD, Rewrite systems, in Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen, ed., Elsevier, Amsterdam, 1990, pp. 243-320.
23. R. G. DOWNEY AND M. R. FELLOWS. Parameterized Complexity, Springer-Verlag, New York, 1999.
24. R. FAGIN, Degrees of acyclicity for hypergraphs and relational database schemes, J. ACM, 30 (1983), pp. 514-550.
25. J. FLUM, M. FRICK, AND M. GROHE, Query evaluation via tree- decomposition, J. ACM, 49 (2002), pp. 716-752.
26. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
27. M. C. GOLUMBIC AND U. ROTICS. On the clique-width of perfect graph classes, Internat. J. Found. Comput. Sci., 11 (2000), pp. 423-443.
28. G. GOTTLOB, N. LEONE, AND F. SCARCELLO, A comparison of structural CSP decomposition methods, Artificial Intelligence, 124 (2000), pp. 243-282.
29. G. GOTTLOB, N. LEONE, AND F. SCARCELLO, Hypertree decompositions and tractable queries, J. Comput. System Sci., 64 (2002), pp. 579-627.
30. G. GOTTLOB AND R. PICHLER, Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), F. Orejas, P. G. Spirakis, and J. van Leeuwen, eds., Lecture Notes in Comput. Sci. 2076, Springer-Verlag, Berlin, 2001, pp. 708-719.
31. M. GROHE, T. SCHWENTICK, AND L. SEGOUFIN, When is the evaluation of conjunctive queries tractable?, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'01), ACM Press, New York, 2001, pp. 657-666.
32. P. L. HAMMER AND F. MAFFRAY, Completely separable graphs, Discrete Appl. Math., 27 (1990), pp. 85-99.
33. P. G. KOLAITIS AND M. Y. VARDI, Conjunctive-query containment and constraint satisfaction, in Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposum on Principles of Database Systems (PODS'98), ACM Press, New York, 1998, pp. 205-213.
34. K. KUNEN, Answer sets and negation as failure, in Proceedings of the 4th International Conference on Logic Programming (ICLP'87), J.-L. Lassez, ed., MIT Press, Cambridge, MA, 1987, pp. 219-228.
35. L. J. STOCKMEYER, The Complexity of Decision Problems in Automata Theory, Ph.D. thesis, Department of Electrical Engineering, MIT, Cambridge, MA, 1974.
36. M. YANMAKAKIS. Algorithms for acyclic database schemes, in Proceedings of the International Conference on Very Large Data Bases (VLDB'81), C. Zaniolo and C. Delobel, eds., IEEE Computer Society, Los Alamitos, CA, 1981, pp. 82-94.