Pages that link to "Item:Q1401972"
From MaRDI portal
The following pages link to Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972):
Displaying 26 items.
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Hypertree decompositions and tractable queries (Q696962) (← links)
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Hypertree-depth and minors in hypergraphs (Q1929221) (← links)
- Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Hypertree width and related hypergraph invariants (Q2461773) (← links)
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
- Marshals, monotone marshals, and hypertree-width (Q3159383) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- Guarded Ontology-Mediated Queries (Q5015964) (← links)
- The treewidth of 2-section of hypergraphs (Q5024663) (← links)
- (Q5232911) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
