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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2016

Many intractable computational problems on graphs admit tractable algorithms when applied to trees or forests. Tree decomposition…

2014

From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach for solving Constraint Satisfaction Problems…

2011

The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to…

2009

This paper deals with the structural decomposition methods and their use for solving Constraint Satisfaction problems (CSP). mong…

2009

Generalized hypertree width (short: ghw) is a concept that leads to a large class of efficiently solvable CSP instances, whose…

2008

The tree-decomposition notion plays a central role in the frame of the structured CSP solving. On the one hand, it is exploited…

2007

Many practical problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs…

2007

We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree…

2004

We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques…