Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient core computation in data exchange
Journal of the ACM (JACM)
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Hi-index | 0.00 |
The principal aim of model checking is to provide efficient decision procedures for the evaluation of certain logical formulae over finite relational structures. Graphs and hypergraphs are important examples of such structures. If no restrictions are imposed on the logical formulae and on the structures under consideration, then this problem of model checking has a very high computational complexity. Hence, several restrictions have been proposed in the literature on the logical formulae and/or on the structures under consideration in order to guarantee the tractability of this decision problem, e.g., acyclicity, bounded tree-width, query-width and hypertree-width in the case of queries, as well as bounded tree-width and clique-width in the case of structures. The aim of this paper is a detailed comparison of the expressive power of these restrictions.