Pages that link to "Item:Q1589639"

The following pages link to A comparison of structural CSP decomposition methods (Q1589639):

Displaying 50 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
• On minimal constraint networks (Q359976) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• Equivalence between hypergraph convexities (Q410668) (← links)
• Generic local computation (Q414892) (← links)
• Hypertree decompositions and tractable queries (Q696962) (← links)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• A polynomial relational class of binary CSP (Q722101) (← links)
• Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
• Treewidth computations. I: Upper bounds (Q964001) (← links)
• On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
• Causal graphs and structurally restricted planning (Q988572) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• Fixed-parameter complexity in AI and nonmonotonic reasoning (Q1603733) (← links)
• Disjunctions, independence, refinements (Q1614865) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
• Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
• The complexity of reasoning with global constraints (Q2454812) (← links)
• Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
• Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
• Task-dependent qualitative domain abstraction (Q2457691) (← links)
• Hypertree width and related hypergraph invariants (Q2461773) (← links)
• Characteristic function games with restricted agent interactions: core-stability and coalition structures (Q2634475) (← links)
• Computing partial hypergraphs of bounded width (Q2686128) (← links)
• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
• Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
• Dynamic Management of Heuristics for Solving Structured CSPs (Q3523068) (← links)
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
• Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
• On Sparse Discretization for Graphical Games (Q5130000) (← links)
• Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Lifted Reasoning for Combinatorial Counting (Q5870533) (← links)
• Diagnosing tree-structured systems (Q5940958) (← links)