Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
The monadic second-order logic of graphs VII: graphs as relational structures
Theoretical Computer Science - Special issue on logic and applications to computer science
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Model checking
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Extension Preservation Theorems on Classes of Acyclic Finite Structures
SIAM Journal on Computing
Some characterizations of γ and β-acyclicity of hypergraphs
Information Processing Letters
| 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 case of queries as well as bounded tree-width and clique-width in case of structures. In this paper, we provide a detailed comparison of the expressive power of these restrictions.