Sciweavers

Share
395 search results - page 2 / 79
» Locally Consistent Constraint Satisfaction Problems with Bin...
Sort
View
AI
2008
Springer
9 years 10 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
CP
2003
Springer
10 years 3 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
AAAI
2000
10 years 2 hour ago
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
We perform an extensive theoretical and empirical analysis of the use of auxiliary variables and implied constraints in modelling a class of non-binary constraint satisfaction pro...
Barbara M. Smith, Kostas Stergiou, Toby Walsh
TIME
2002
IEEE
10 years 3 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
CSCLP
2006
Springer
10 years 2 months ago
Extracting Microstructure in Binary Constraint Networks
Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Chavalit Likitvivatanavong, Roland H. C. Yap
books