Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,305 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.
2017
2017
Using Hypertree Decomposition for Parallel Constraint Solving
Ke Liu
,
Sven Löffler
,
Petra Hofstedt
GI-Jahrestagung
2017
Corpus ID: 27116696
2016
2016
On the Enumeration of Tree Decompositions
Nofar Carmeli
,
Batya Kenig
,
B. Kimelfeld
Alberto Mendelzon Workshop on Foundations of Data…
2016
Corpus ID: 9520855
Many intractable computational problems on graphs admit tractable algorithms when applied to trees or forests. Tree decomposition…
Expand
2014
2014
Tree-Decompositions with Connected Clusters for Solving Constraint Networks
Philippe Jégou
,
C. Terrioux
International Conference on Principles and…
2014
Corpus ID: 11491160
From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems…
Expand
2011
2011
Approximating Width Parameters of Hypergraphs with Excluded Minors
F. Fomin
,
P. Golovach
,
D. Thilikos
SIAM Journal on Discrete Mathematics
2011
Corpus ID: 2758865
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to…
Expand
2009
2009
Hypertree Decomposition for Solving Constraint Satisfaction Problems
Abdelmalek Ait-Amokhtar
,
Kamal Amroun
,
Z. Habbas
International Conference on Agents and Artificial…
2009
Corpus ID: 10482313
This paper deals with the structural decomposition methods and their use for solving Constraint Satisfaction problems (CSP). mong…
Expand
2009
2009
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
G. Gottlob
,
G. Greco
,
Bruno Marnette
Graph Theory, Computational Intelligence and…
2009
Corpus ID: 42250117
Generalized hypertree width (short: ghw) is a concept that leads to a large class of efficiently solvable CSP instances, whose…
Expand
2008
2008
A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving
Cédric Pinto
,
C. Terrioux
IEEE International Conference on Tools with…
2008
Corpus ID: 14074207
The tree-decomposition notion plays a central role in the frame of the structured CSP solving. On the one hand, it is exploited…
Expand
2007
2007
Genetic algorithms for generalized hypertree decompositions
Nysret Musliu
,
W. Schafhauser
2007
Corpus ID: 14813953
Many practical problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs…
Expand
2007
2007
An Empirical Comparison of CSP Decomposition Methods
S. Subbarayan
2007
Corpus ID: 14655188
We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree…
Expand
2004
2004
New Structural Decomposition Techniques for Constraint Satisfaction Problems
Yaling Zheng
,
B. Choueiry
ERCIM Annual Workshop on Constraint Solving and…
2004
Corpus ID: 14342871
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques…
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