Beyond Hypertree Width: Decomposition Methods Without Decompositions
From MaRDI portal
Publication:3524172
DOI10.1007/11564751_15zbMath1153.68452arXivcs/0505035OpenAlexW1787617900MaRDI QIDQ3524172
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0505035
Related Items
Structural tractability of counting of solutions to conjunctive queries, The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems, Constraint satisfaction with bounded treewidth revisited, Semantic Acyclicity on Graph Databases, Regularizing conjunctive features for classification, A More General Theory of Static Approximations for Conjunctive Queries, Tradeoffs in the Complexity of Backdoor Detection, Constraint satisfaction with succinctly specified relations, Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search, Finding a given number of solutions to a system of fuzzy constraints, Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms, Decomposing Quantified Conjunctive (or Disjunctive) Formulas, Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints, How many variables are needed to express an existential positive query?, HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results, A more general theory of static approximations for conjunctive queries, A Logical Approach to Constraint Satisfaction, Uniform Constraint Satisfaction Problems and Database Theory, Structural tractability of enumerating CSP solutions
