A comparison of structural CSP decomposition methods
From MaRDI portal
Recommendations
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- On the power of structural decompositions of graph-based representations of constraint problems
- Uniform Constraint Satisfaction Problems and Database Theory
- Recent Advances in Constraints
- A unified theory of structural tractability for constraint satisfaction problems
Cites work
- scientific article; zbMATH DE number 3986679 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- A Sufficient Condition for Backtrack-Free Search
- A sufficient condition for backtrack-bounded search
- Closure properties of constraints
- Conjunctive query containment revisited
- Conjunctive-query containment and constraint satisfaction
- Constraint satisfaction from a deductive viewpoint
- Decomposing constraint satisfaction problems using database techniques
- Easy problems for tree-decomposable graphs
- Graph minors. II. Algorithmic aspects of tree-width
- Hypertree decompositions and tractable queries
- Network-based heuristics for constraint-satisfaction problems
- On the Desirability of Acyclic Database Schemes
- Power of Natural Semijoins
- Syntactic Characterization of Tree Database Schemas
- Tree clustering for constraint networks
Cited in
(61)- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- Incremental Updates of Generalized Hypertree Decompositions
- Cops and robber on oriented graphs with respect to push operation
- Task-dependent qualitative domain abstraction
- A Logical Approach to Constraint Satisfaction
- Equivalence between hypergraph convexities
- Structural tractability of counting of solutions to conjunctive queries
- On the complexity of constrained Nash equilibria in graphical games
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- Structural decompositions for problems with global constraints
- A safeness condition for minimal separators based on vertex connectivity
- Tractable counting of the answers to conjunctive queries
- Dynamic Management of Heuristics for Solving Structured CSPs
- Uniform Constraint Satisfaction Problems and Database Theory
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Hypertree decompositions and tractable queries
- The complexity of counting homomorphisms seen from the other side
- Large hypertree width for sparse random hypergraphs
- CSP beyond tractable constraint languages
- A unified theory of structural tractability for constraint satisfaction problems
- A polynomial relational class of binary CSP
- Finding good decompositions for dynamic programming on dense graphs
- Unifying tree decompositions for reasoning in graphical models
- Lifted Reasoning for Combinatorial Counting
- The power of propagation: when GAC is enough
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- Constraint reasoning
- Weighted hypertree decompositions and optimal query plans
- Partition-based logical reasoning for first-order and propositional theories
- Coalition formation in social environments with logic-based agents1
- Constraint satisfaction with succinctly specified relations
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
- Treewidth computations. I: Upper bounds
- Generic local computation
- On minimal constraint networks
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Structural tractability of enumerating CSP solutions
- Domain permutation reduction for constraint satisfaction problems
- The complexity of reasoning with global constraints
- Hypertree width and related hypergraph invariants
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Disjunctions, independence, refinements
- Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
- Solving partial constraint satisfaction problems with tree decomposition
- Computing partial hypergraphs of bounded width
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- Causal graphs and structurally restricted planning
- HyperBench. A benchmark and tool for hypergraphs and empirical findings
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Typed Guarded Decompositions for Constraint Satisfaction
- On the power of structural decompositions of graph-based representations of constraint problems
- On sparse discretization for graphical games
- Learning to integrate deduction and search in reasoning about quantified Boolean formulas
- Fast parallel hypertree decompositions in logarithmic recursion depth
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Fixed-parameter tractability of treewidth and pathwidth
- Diagnosing tree-structured systems
- Decomposable constraints
- Fast and parallel decomposition of constraint satisfaction problems
This page was built for publication: A comparison of structural CSP decomposition methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589639)
