Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,023,925 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Biconnected component
Binary constraint
Complexity of constraint satisfaction
Constraint satisfaction
Expand
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
Shumo Chu
,
M. Balazinska
,
Dan Suciu
SIGMOD Conference
2015
Corpus ID: 522873
Big data analytics often requires processing complex queries using massive parallelism, where the main performance metrics is the…
Expand
2014
2014
GYM: A Multiround Join Algorithm In MapReduce
F. Afrati
,
Manas R. Joglekar
,
C. Ré
,
S. Salihoglu
,
J. Ullman
ArXiv
2014
Corpus ID: 7750473
Multiround algorithms are now commonly used in distributed data processing systems, yet the extent to which algorithms can…
Expand
2010
2010
Exploiting parallelism in decomposition methods for constraint satisfaction
D. Akatov
2010
Corpus ID: 44881563
Constraint Satisfaction Problems (CSPs) are NP-complete in general, however, there are many tractable subclasses that rely on the…
Expand
Highly Cited
2009
Highly Cited
2009
Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm
Ruben Stranders
,
A. Farinelli
,
A. Rogers
,
N. Jennings
International Joint Conference on Artificial…
2009
Corpus ID: 1797620
In this paper, we introduce an on-line, decentralised coordination algorithm for monitoring and predicting the state of spatial…
Expand
2009
2009
Encoding Treewidth into SAT
M. Samer
,
H. 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…
Expand
Highly Cited
2005
Highly Cited
2005
Unifying tree decompositions for reasoning in graphical models
Kalev Kask
,
R. Dechter
,
J. Larrosa
,
A. Dechter
Artificial Intelligence
2005
Corpus ID: 3131706
Review
2001
Review
2001
Hypertree Decompositions: A Survey
G. Gottlob
,
N. Leone
,
Francesco Scarcello
International Symposium on Mathematical…
2001
Corpus ID: 15847982
This paper surveys recent results related to the concept of hypertree decomposition and the associated notion of hypertree width…
Expand
Highly Cited
1999
Highly Cited
1999
A Comparison of Structural CSP Decomposition Methods
G. Gottlob
,
N. Leone
,
Francesco Scarcello
International Joint Conference on Artificial…
1999
Corpus ID: 1721251
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
G. Gottlob
,
N. Leone
,
Francesco Scarcello
ACM SIGACT-SIGMOD-SIGART Symposium on Principles…
1998
Corpus ID: 2520254
1 A preliminary version of this paper appeared in the ‘‘Proceedings of the Eighteenth ACM Symposium on Principles of Database…
Expand
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)
ACCEPT & CONTINUE