A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
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
A comparison of structural CSP decomposition methods
Artificial Intelligence
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint Processing
Marshals, monotone marshals, and hypertree-width
Journal of Graph Theory
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)
Generalized hypertree decompositions: np-hardness and tractable variants
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
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Tree-width and functional dependencies in databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Typed guarded decompositions for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |
In this paper we introduce a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterized in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of decomposition, which we call a spread cut. We show that discovery of width k spread-cut decompositions is tractable for each k, and that the spread cut decomposition strongly generalize all existing decompositions except hypertrees. Finally we exhibit a family of hypergraphs Hn, for n = 1, 2, 3 ..., where the width of the best hypertree decomposition of each Hn is at least 3n, but the width of the best spreadcut decomposition is at most 2n.