Skip to search formSkip to main contentSkip to account menu

Decomposition method (constraint satisfaction)

Known as: Decomposition method, Hypertree decomposition, Join-tree clustering 
In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Biconnected componentBinary constraintComplexity of constraint satisfactionConstraint satisfaction

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System
Big data analytics often requires processing complex queries using massive parallelism, where the main performance metrics is the… 
2014
2014
GYM: A Multiround Join Algorithm In MapReduce
Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can… 
2010
2010
Exploiting parallelism in decomposition methods for constraint satisfaction
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractable subclasses that rely on the… 
Highly Cited
2009
Highly Cited
2009
Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm
In this paper, we introduce an on-line, decentralised coordination algorithm for monitoring and predicting the state of spatial… 
2009
2009
Encoding Treewidth into SAT
  • M. SamerH. Veith
  • International Conference on Theory and…
  • 2009
  • Corpus ID: 17791966
One of the most important structural parameters of graphs is treewidth , a measure for the "tree-likeness" and thus in many cases… 
Highly Cited
2005
Highly Cited
2005
Unifying tree decompositions for reasoning in graphical models
Review
2001
Review
2001
Hypertree Decompositions: A Survey
This paper surveys recent results related to the concept of hypertree decomposition and the associated notion of hypertree width… 
Highly Cited
1999
Highly Cited
1999
A Comparison of Structural CSP Decomposition Methods
Highly Cited
1999
Highly Cited
1999
Bucket Elimination: A Unifying Framework for Reasoning
  • R. Dechter
  • Artificial Intelligence
  • 1999
  • Corpus ID: 996561
Highly Cited
1998
Highly Cited
1998
Hypertree decompositions and tractable queries
1 A preliminary version of this paper appeared in the ‘‘Proceedings of the Eighteenth ACM Symposium on Principles of Database… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)