A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
The monadic second-order logic of graphs VII: graphs as relational structures
Theoretical Computer Science - Special issue on logic and applications to computer science
Graph searching and a min-max theorem for tree-width
Journal of Combinatorial Theory Series B
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Journal of Algorithms
Complexity of answering queries using materialized views
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
Acyclic hypergraph projections
Journal of Algorithms
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
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
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
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
Query answering exploiting structural properties
ACM SIGMOD Record
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Queries determined by views: pack your views
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hypertree width and related hypergraph invariants
European Journal of Combinatorics
Efficient core computation in data exchange
Journal of the ACM (JACM)
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Tree Projections: Game Characterization and Computational Aspects
Graph Theory, Computational Intelligence and Thought
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Progression of situation calculus action theories with incomplete information
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Views and queries: Determinacy and rewriting
ACM Transactions on Database Systems (TODS)
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Structural tractability of enumerating CSP solutions
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Approximation algorithms for domination search
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hypertree-depth and minors in hypergraphs
Theoretical Computer Science
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Querying the guarded fragment with transitivity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Theoretical Computer Science
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
In a previous paper (J. Comput. System Sci. 64 (2002) 519), the authors introduced the notion of hypertree decomposition and the corresponding concept of hypertree width and showed that the conjunctive queries whose hypergraphs have bounded hypertree width can be evaluated in polynomial time. Bounded hypertree width generalizes the notions of acyclicity and bounded treewidth and corresponds to larger classes of tractable queries. In the present paper, we provide natural characterizations of hypergraphs and queries having bounded hypertree width in terms of game-theory and logic. First we define the Robber and Marshals game, and prove that a hypergraph H has hypertree width at most k if and only if k marshals have a winning strategy on H, allowing them to trap a robber who moves along the hyperedges. This game is akin the well-known Robber and Cops game (which characterizes bounded treewidth), except that marshals are more powerful than cops: They can control entire hyperedges instead of just vertices. Kolaitis and Vardi (J. Comput. System Sci. 61 (2000) 302) recently gave an elegant characterization of the conjunctive queries having treewidth k in terms of the k-variable fragment of a certain logic L (= existential-conjunctive fragment of positive FO). We use the Robber and Marshals game to derive a surprisingly simple and equally elegant characterization of the class HW[k] of queries of hypertree width at most k in terms of guarded logic. In particular, we show that HW[k] = GFk(L), where GFk(L) denotes the k-guarded fragment of L. In this fragment, conjunctions of k atoms rather than just single atoms are allowed to act as guards. Note that, for the particular case k = 1, our results provide new characterizations of the class of acyclic queries. We extend the notion of bounded hypertree width to nonrecursive stratified Datalog and show that the k-guarded fragment GFk(FO) of first-order logic has the same expressive power as nonrecursive stratified Datalog of hypertree width at most k.