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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 708-719

  Gottlob, Georg ^a   Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORESTRY; GRAPH THEORY; COMPUTATIONAL LINGUISTICS;

CLIQUE-WIDTH; DECISION PROBLEMS; DECISION PROCEDURE; EXPRESSIVE POWER; FINITE RELATIONAL STRUCTURES; GRAPHS AND HYPERGRAPHS; HYPER GRAPH; LOGICAL FORMULAS;

MODEL CHECKING;

EID: 84879545412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_58     Document Type: Conference Paper

References (25)

1. S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases, Addison-Wesley Publishing Company (1995).
2. W. Bibel. Constraint Satisfaction from a Deductive Viewpoint. In Artificial Intelligence, Vol 35, pp. 401-413 (1988).
3. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. In SIAM Journal on Computing, Vol 25, No 6, pp. 1305-1317 (1996).
4. H. L. Bodlaender. Treewidth: Algorithmic Techniques and Results. In Proc. of MFCS'97, LNCS 1295, pp. 19-36, Springer, (1997).
5. A. K. Chandra, P. M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Databases. In Proc. of STOC'77, pp. 77-90, ACM Press (1977).
6. E. M. Clarke, O. Grumberg, D. Peled. Model Checking, MIT Press (1999).
7. Ch. Chekuri, A. Rajaraman. Conjunctive Query Containment Revisited. In Proc. of ICDT'97, LNCS 1186, pp. 130-144, Springer (1997).
8. D. G. Corneil, M. Habib, J.-M. Langlinel, B. Reed, U. Rotics. Polynomial Time Recognition of clique-width 3 graphs, extended abstract. In Proc. of LATIN 2000, LNCS 1776, pp. 126-134, Springer (2000).
9. B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Vol 2, pp. 194-241, J. van Leeuwen (ed. ), Elsevier Science Publishers (1990).
10. B. Courcelle. Monadic second-order logic of graphs VII: Graphs as relational structures. In Theoretical Computer Science, Vol 101, pp. 3-33 (1992).
11. B. Courcelle, J. Engelfriet, G. Rozenberg. Handle-rewriting hypergraph grammars. In Journal of Computer and System Sciences, Vol 46, pp. 218-270 (1993).
12. B. Courcelle, J. A. Makowsky, U. Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. In Theory of Computing Systems, Vol 33, pp. 125-150 (2000).
13. B. Courcelle, S. Olariu. Upper bounds on the clique-width of graphs. In Discrete Applied Mathematics, Vol 101, pp. 77-114 (2000).
14. A. D'Atri, M. Moscarini. Acyclic Hypergraphs: Their recognition and top-down versus bottom-up generation. Technical Report R. 29, Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi ed Informatica (1982).
15. R. G. Downey, M. R. Fellows. Parameterized Complexity, Springer-Verlag (1997).
16. R. Fagin. Degrees of Acyclicity for Hypergraphs and Relational Database Schemes. In Journal of the ACM, Vol 30, No 3, pp. 514-550 (1983).
17. J. Flum, M. Frick, and M. Grohe. Query Evaluation via Tree-Decomposition. In Proc. of ICDT'01. Currently available at www. math. uic. edu/grohe/pub/query. ps
18. G. Gottlob, N. Leone, F. Scarcello. The Complexity of Acyclic Conjunctive Queries. In Proc. of FOCS'98, pp. 706-715, (1998). Full paper to appear in JACM.
19. G. Gottlob, N. Leone, F. Scarcello. Hypertree Decompositions and Tractable Queries. In Proc. of PODS'99, pp. 21-32, ACM Press (1999).
20. G. Gottlob, N. Leone, F. Scarcello. A Comparison of Structural CSP Decomposition Methods. In Proc. of IJCAI'99, pp. 394-399, Morgan Kaufmann, (1999).
21. G. Gottlob, R. Pichler. Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. Full paper. Available from the authors (2001).
22. M. Grohe, T. Schwentick, and L. Segoufin. When is the Evaluation of Conjunctive Queries Tractable Manuscript, currently available at: www. math. uic. edu/grohe/pub/grid. ps (2001).
23. Ph. G. Kolaitis and M. Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. In Proc. of PODS'98, pp. 205-213, ACM Press (1998).
24. K. Kunen: Answer Sets and Negation as Failure. In Proc. of the Fourth Int. Conf. on Logic Programming, Melbourne, pp. 219-228 (1987).
25. M. Yannakakis. Algorithms for Acyclic Database Schemes. In Proc. of Int. Conf. on Very Large Data Bases (VLDB'81), pp. 82-94, Cannes, France (1981).