Search Results for author:
Found 5 papers, 0 papers with code
Steepest ascent can be exponential in bounded treewidth problems
We investigate the complexity of local search based on steepest ascent.
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width.
Variable and value elimination in binary constraint satisfaction via forbidden patterns
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size.
Tractable Combinations of Global Constraints
We study the complexity of constraint satisfaction problems involving global constraints, i. e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm.
The tractability of CSP classes defined by forbidden patterns
We show that this framework generalises relational properties and allows us to capture known hybrid tractable classes.
